Legality of Cannabis by U.S. Jurisdiction

Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
 
(35 intermediate revisions by 28 users not shown)
Line 1: Line 1:
⚫
{{Use dmy dates|date=June 2022}}
<!-- Please do not remove or change this AfD message until the issue is settled -->
{{Primary sources|date=April 2011}}
{{AfDM|page=Alma-0 (2nd nomination)|year=2011|month=February|day=20|substed=yes|origtag=afdx}}
<!-- End of AfD message, feel free to edit beyond this point -->
{{Infobox programming language
{{Infobox programming language
|name = Alma-0
|name = Alma-0
|logo =
|logo =
|paradigm = [[multi-paradigm programming language|multi-paradigm]]: [[Constraint programming|constraint]], [[Imperative programming|imperative]], [[Logic programming|logic]]
|paradigm = [[Multi-paradigm programming language|multi-paradigm]]: [[Constraint programming|constraint]], [[Imperative programming|imperative]], [[Logic programming|logic]]
|family = [[Niklaus Wirth|Wirth]] [[Modula]]
|year = [[2004]]
|designer = Krzysztof Apt, Marc Bezem, Jacob Brunekree,
|designers = [[Krzysztof R. Apt|Krzysztof Apt]], Marc Bezem, Jacob Brunekreef, Vincent Partington, Andrea Schaerf
Vincent Partington, Andrea Schaerf
|developer = [[Centrum Wiskunde & Informatica]]
|developer = [[Centrum Wiskunde & Informatica]]
|released = {{Start date and age|1997}}
|latest_release_version =
|latest release version =
|latest_release_date =
|latest release date =
|typing = [[Type system|static]]
|typing = [[Type system|static]]
|scope = [[Scope (computer science)|Lexical]] (static)
|implementations = Alma-0
|implementations = Alma-0
|dialects =
|dialects =
|influenced by = [[Modula-2]]
|influenced_by =
|website = [http://www.cwi.nl/en/alma/ www.cwi.nl/en/alma]
|website = {{URL|www.cwi.nl/en/alma}}
}}
}}
'''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]] ability.<ref>{{cite book

|last1=Liu |first1=Jed |last2=Myers |first2=Andrew C. |title=Practical Aspects of Declarative Languages |chapter=JMatch: Iterable Abstract Pattern Matching for Java |series=Lecture Notes in Computer Science |year=2003
'''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}}
|volume=2562/2003 |pages=110–127 |doi=10.1007/3-540-36388-2_9 |isbn=978-3-540-00389-2}}</ref> 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.<ref>{{Cite report |last=Partington |first=Vincent |date=July 1997 |title=Implementation of an Imperative Programming Language with Backtracking |url=http://www.klomp.org/vinny/P9712.pdf |publisher=University of Amsterdam Programming, Research Group |access-date=15 February 2021 |archive-date=29 November 2023 |archive-url=https://web.archive.org/web/20231129091208/http://www.klomp.org/vinny/P9712.pdf |url-status=live }} Also in [http://www.cwi.nl/~apt/partington.ps Postscript] {{Webarchive|url=https://web.archive.org/web/20240531214535/http://www.cwi.nl/~apt/partington.ps |date=31 May 2024 }}.</ref> Alma-0 provides natural, high-level constructs for building search trees.<ref>{{cite journal |last1=Van Hentenryck |first1=Pascal |last2=Perron |first2=Laurent |last3=Puget |first3=Jean-François |date=October 2000 |title=Search and strategies in OPL
|journal=ACM Transactions on Computational Logic
|volume=1 |issue=2 |pages=285–320
|doi=10.1145/359496.359529 |citeseerx=10.1.1.17.836|s2cid=15926704 }}</ref>


==Overview==
==Overview==
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:
Since the designers of Alma-0 wanted to create a distinct and substantially simpler proposal than prior attempts to integrate declarative programming constructs (such as automatic backtracking) into imperative programming, the design of Alma-0 was guided by four principles:
* the logic-based extension should be ''downward'' compatible with the underlying imperative programming language
* 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 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 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)
* 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.
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 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]].<ref>{{Cite book |last=Dahl |first=Veronica |url=https://books.google.com/books?id=zs2JYJQ3tOEC |title=Practical Aspects of Declarative Languages: 5th International Symposium, PADL 2003, New Orleans, LA, USA, January 13-14, 2003, Proceedings |date=2003-02-12 |publisher=Springer Science & Business Media |isbn=978-3-540-00389-2 |language=en |access-date=25 February 2023 |archive-date=31 May 2024 |archive-url=https://web.archive.org/web/20240531214535/https://books.google.com/books?id=zs2JYJQ3tOEC |url-status=live }}</ref>


==Features==
==Features==
The implemented features in Alma-0 include:
The implemented features in Alma-0 include:
*use of boolean expressions as statements and vice versa
*Use of boolean expressions as statements and vice versa
*a dual for the <code>FOR</code> statement that introduces non-determinism in the form of ''choice points'' and ''backtracking''
*A dual for the <code>FOR</code> statement that introduces non-determinism in the form of ''choice points'' and ''backtracking''
*a <code>FORALL</code> statement that introduces a controlled form of iteration over the backtracking
*A <code>FORALL</code> statement that introduces a controlled form of iteration over the backtracking
*[[unification (computing)|unification]] which, although limited to the use of equality as assignment, yields a new [[Parameter (computer science)|parameter-passing]] mechanism.
*[[Unification (computer science)|Unification]] which, although limited to the use of equality as assignment, yields a new [[Parameter (computer science)|parameter-passing]] mechanism.


==Imperative and logic programming modes==
==Imperative and logic programming modes==
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.
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.


==External links==
== References ==
{{Reflist}}
*[http://www.cwi.nl/en/alma/ Towards an Imperative Constraint Programming Language] Centrum Wiskunde & Informatica, CWI project home page
* Jacob Brunekreef (1998). [https://web.archive.org/web/20110724171948/http://www.science.uva.nl/pub/programming-research/reports/1998/P9803.ps.gz "Annotated Algebraic Specification of the Syntax and Semantics of the Programming Language Alma-0"].
*[http://www.cwi.nl/alma Compiler] download
* [[Krzysztof R. Apt]], Jacob Brunekreef, Vincent Partington, Andrea Schaerf (1998). [http://www.cwi.nl/~apt/alma.ps "Alma-0: An Imperative Language that Supports Declarative Programming"].
⚫
{{Use dmy dates|date=February 2011}}
* [[Krzysztof R. Apt]], Andrea Schaerf (1998). [http://www.cwi.nl/~apt/frocos98.ps "Programming in Alma-0, or Imperative and Declarative Programming Reconciled"].
* [[Krzysztof R. Apt]], Andrea Schaerf (1998). [http://www.cwi.nl/~apt/as2.ps "Integrating Constraints into an Imperative Programming Language"].
* [[Krzysztof R. Apt]], Andrea Schaerf (1999). [http://www.cwi.nl/~apt/langmaack99.ps "The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming"].

{{Modula, Oberon}}


[[Category:Modula programming language family]]
[[Category:Systems programming languages]]
[[Category:Procedural programming languages]]
[[Category:Procedural programming languages]]
[[Category:Logic programming languages]]
[[Category:Logic programming languages]]
[[Category:Multi-paradigm programming languages]]
[[Category:Multi-paradigm programming languages]]
[[Category:Programming languages created in the 20th century]]
[[Category:Constraint programming languages]]

Latest revision as of 01:59, 8 June 2024

Alma-0
Paradigmmulti-paradigm: constraint, imperative, logic
FamilyWirth Modula
Designed byKrzysztof Apt, Marc Bezem, Jacob Brunekreef, Vincent Partington, Andrea Schaerf
DeveloperCentrum Wiskunde & Informatica
First appeared1997; 27 years ago (1997)
Typing disciplinestatic
ScopeLexical (static)
Websitewww.cwi.nl/en/alma
Major implementations
Alma-0
Influenced by
Modula-2

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 ability.[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.[2] Alma-0 provides natural, high-level constructs for building search trees.[3]

Overview[edit]

Since the designers of Alma-0 wanted to create a distinct and substantially simpler proposal than prior attempts to integrate declarative programming constructs (such as automatic backtracking) into imperative programming, the design of Alma-0 was guided by 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.[4]

Features[edit]

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.

References[edit]

  1. ^ Liu, Jed; Myers, Andrew C. (2003). "JMatch: Iterable Abstract Pattern Matching for Java". Practical Aspects of Declarative Languages. Lecture Notes in Computer Science. Vol. 2562/2003. pp. 110–127. doi:10.1007/3-540-36388-2_9. ISBN 978-3-540-00389-2.
  2. ^ Partington, Vincent (July 1997). Implementation of an Imperative Programming Language with Backtracking (PDF) (Report). University of Amsterdam Programming, Research Group. Archived (PDF) from the original on 29 November 2023. Retrieved 15 February 2021. Also in Postscript Archived 31 May 2024 at the Wayback Machine.
  3. ^ 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 10.1.1.17.836. doi:10.1145/359496.359529. S2CID 15926704.
  4. ^ Dahl, Veronica (12 February 2003). Practical Aspects of Declarative Languages: 5th International Symposium, PADL 2003, New Orleans, LA, USA, January 13-14, 2003, Proceedings. Springer Science & Business Media. ISBN 978-3-540-00389-2. Archived from the original on 31 May 2024. Retrieved 25 February 2023.
source: https://en.wikipedia.org/w/index.php?title=Alma-0&diff=1227836273&oldid=414883153