Eingang zum Volltext in SciDok
Lizenz
Report (Bericht) zugänglich unter
A foundation for higher-order concurrent constraint programming
URN: urn:nbn:de:bsz:291-scidok-38060
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/3806/
Quelle:
(1994) Kaiserslautern ; Saarbrücken : DFKI, 1994
pdf-Format:
Dokument 1.pdf (234 KB)
SWD-Schlagwörter:
Künstliche Intelligenz
Institut:
DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
DDC-Sachgruppe:
Informatik
Dokumentart:
Report (Bericht)
Schriftenreihe:
Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Bandnummer:
94-16
Sprache:
Englisch
Erstellungsjahr:
1994
Publikationsdatum:
05.07.2011
Kurzfassung auf Englisch:
We present the gamma-calculus, a computational calculus for higher-order concurrent programming. The calculus can elegantly express higher-order functions (both eager and lazy) and concurrent objects with encapsulated state and multiple inheritance. The primitives of the gamma-calculus are logic variables, names, procedural abstraction, and cells. Cells provide a notion of state that is fully compatible with concurrency and constraints. Although it does not have a dedicated communication primitive, the gamma-calculus can elegantly express one-to-many and many-to-one communication. There is an interesting relationship between the gamma-calculus and the pi-calculus: The gamma-calculus is subsumed by a calculus obtained by extending the asynchronous and polyadic pi-calculus with logic variables. The gamma-calculus can be extended with primitives providing for constraint-based problem solving in the style of logic programming. A such extended gamma-calculus has the remarkable property that it combines first-order constraints with higher-order programming.
Lizenz:
Standard-Veröffentlichungsvertrag