DFKI Research Report-94-16
by Gert Smolka
A Foundation for Higher-order Concurrent Constraint Programming
We present the -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 -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 -calculus can elegantly express one-to-many and many-to-one communication.There is an interesting relationship between the -calculus and the -calculus: The -calculus is subsumed by a calculus obtained by extending the asynchronous and polyadic -calculus with logic variables. The -calculus can be extended with primitives providing for constraint-based problem solving in the style of logic programming. A such extended -calculus has the remarkable property that it combines first-order constraints with higher-order programming.
This document is available as Postscript.
The next abstract is here, and the previous abstract is here.
Note: This page was written to look best with CSS stylesheet support Level 1 or higher. Since you can see this, your browser obviously doesn't support CSS, or you have turned it off. We highly recommend you use a browser that supports and uses CSS, and review this page once you do. However, don't fear, we've tried to write this page to still work and be readable without CSS.