From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Paradigmmulti-paradigm: constraint, imperative, logic
Designed byKrzysztof Apt, Marc Bezem, Jacob Brunekree, Vincent Partington, Andrea Schaerf
DeveloperCentrum Wiskunde & Informatica
Typing disciplinestatic
Major implementations

Alma-0 is a multi-paradigm computer programming language. This language is an augmented version of the imperative Modula-2 language with logic-programming features and convenient backtracking capability.[1] It is small, strongly typed, and combines constraint programming, a limited number of features inspired by logic programming and supports imperative paradigms. The language advocates declarative programming. The designers claim that search-oriented solutions built with it are substantially simpler than their counterparts written in purely imperative or logic programming style.[citation needed] [1] Alma-0 provides natural, high-level constructs for the construction of search trees.[2]


Since the designers of Alma-0 wanted to create a distinct and substantially simpler proposal than previous attempts at integration of declarative programming constructs (such as automatic backtracking) into imperative programming, the design of Alma-0 was guided by the following four principles:

  • the logic-based extension should be downward compatible with the underlying imperative programming language
  • the logic-based extension should be upward compatible with a future extension that will support constraint programming
  • the constructs that will implement the extension should support and encourage declarative programming.
  • the extension should be kept small (nine new features have been proposed and implemented)

Alma-0 can be viewed not only as a specific and concrete programming language proposal, but also as an example of a generic method for extending any imperative programming language with features that support declarative programming.

The feasibility of the Alma-0 approach has been demonstrated through a full implementation of the language (including a description of its semantics) for a subset of Modula-2.


The implemented features in Alma-0 include:

  • use of boolean expressions as statements and vice versa
  • a dual for the FOR statement that introduces non-determinism in the form of choice points and backtracking
  • a FORALL statement that introduces a controlled form of iteration over the backtracking
  • unification which, although limited to the use of equality as assignment, yields a new parameter-passing mechanism.

Imperative and logic programming modes[edit]

The Alma-0 designers claim that the assignment, which is usually shunned in pure declarative and logic programming, is actually needed in a number of natural situations, including for counting and recording purposes. They also affirm that the means of expression of such "natural" uses of assignment within the logic programming paradigm are unnatural.


  1. ^ Liu, Jed; Myers, Andrew C. (2003). JMatch: Iterable Abstract Pattern Matching for Java. Lecture Notes in Computer Science. 2562/2003. pp. 110–127. doi:10.1007/3-540-36388-2_9. ISBN 978-3-540-00389-2.
  2. ^ Van Hentenryck, Pascal; Perron, Laurent; Puget, Jean-François (October 2000). "Search and strategies in OPL". ACM Transactions on Computational Logic. 1 (2): 285–320. CiteSeerX doi:10.1145/359496.359529.