https://ideawaza.com/index.php?action=history&feed=atom&title=Alma-0Alma-0 - Revision history2026-09-30T03:41:01ZRevision history for this page on the wikiMediaWiki 1.46.0https://ideawaza.com/index.php?title=Alma-0&diff=70218&oldid=prevwikademia>Eme: by http://en.wikipedia.org/w/index.php?title=Alma-0&action=history2011-02-26T07:41:07Z<p>by http://en.wikipedia.org/w/index.php?title=Alma-0&action=history</p>
<p><b>New page</b></p><div><br />
'''Alma-0''' is a [[multi-paradigm]] computer [[programming language]]. It is small, [[Strongly typed programming language|strongly typed]], and combines [[constraint programming]], a limited number of features inspired by [[logic programming]] and supports [[imperative (programming)|imperative]] [[programming paradigm|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|date=February 2011}}<br />
<br />
==Overview==<br />
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:<br />
* the logic-based extension should be ''downward'' compatible with the underlying imperative programming language<br />
* the logic-based extension should be ''upward'' compatible with a future extension that will support [[constraint programming]]<br />
* the constructs that will implement the extension should support and encourage declarative programming.<br />
* the extension should be kept small (nine new features have been proposed and implemented)<br />
<br />
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.<br />
<br />
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]].<br />
<br />
==Features==<br />
The implemented features in Alma-0 include:<br />
*use of boolean expressions as statements and vice versa<br />
*a dual for the <code>FOR</code> statement that introduces non-determinism in the form of ''choice points'' and ''backtracking''<br />
*a <code>FORALL</code> statement that introduces a controlled form of iteration over the backtracking<br />
*[[unification (computing)|unification]] which, although limited to the use of equality as assignment, yields a new [[Parameter (computer science)|parameter-passing]] mechanism.<br />
<br />
==Imperative and logic programming modes==<br />
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.<br />
<br />
==External links==<br />
*[http://www.cwi.nl/en/alma/ Towards an Imperative Constraint Programming Language] Centrum Wiskunde & Informatica, CWI project home page<br />
*[http://www.cwi.nl/alma Compiler] download<br />
{{Use dmy dates|date=February 2011}}<br />
<br />
[[Category:Procedural programming languages]]<br />
[[Category:Logic programming languages]]<br />
[[Category:Multi-paradigm programming languages]]</div>wikademia>Eme