Abstract

This work presents an approach to the linguistic treatment of concurrent systems which has three main objectives: ffl Declarativity: Definition of (1) a model whose elements are mathematical values each of which represents a system, or a run of a system, in a direct and intuitive way; (2) a syntax whose expressions are mapped into the model by a denotational semantics. ffl Causality: Full modeling of the relevant computational phenomena, i.e., without losing parallelism (by interleaving) or interactions (by hiding of "internal" interactions). ffl Programming: As opposed to specification. In particular, provision of an operational semantics that is concrete enough to serve as the basis for language implementation. A model based on reflexive domains --- not power domains --- and a corresponding language incorporating typed lambda-calculus with recursion are introduced. Using the full power of functional programming, we can compositionally define so-called Concurrent Structures, which...

Citations