DMCA
A Foundation for Higher-order Concurrent Constraint Programming (1994)
| Citations: | 66 - 13 self |
BibTeX
@MISC{Smolka94afoundation,
author = {Gert Smolka},
title = {A Foundation for Higher-order Concurrent Constraint Programming},
year = {1994}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present the fl-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 fl-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 fl-calculus can elegantly express one-to-many and many-to-one communication. There is an interesting relationship between the fl-calculus and the ß-calculus: The fl-calculus is subsumed by a calculus obtained by extending the asynchronous and polyadic ß-calculus with logic variables. The fl-calculus can be extended with primitives providing for constraint-based problem solving in the style of logic programming. A such extended fl-calculus has the remarkable property that it combines first-or...
Keyphrases
higher-order concurrent constraint programming logic variable interesting relationship logic programming constraint-based problem solving communication primitive remarkable property procedural abstraction polyadic calculus higher-order concurrent programming computational calculus higher-order function multiple inheritance extended fl-calculus concurrent object many-to-one communication encapsulated state
