We present a monadic denotational semantics for higher-order programming language with shared-state concurrency, i.e. global-state in the presence of interleaving concurrency. Central to our approach is use Plotkin and Power’s algebraic effect methodology: designing an equational theory that captures intended semantics, proving representation theorem it. Hyland et al.’s resumptions extends non-...

For the control ow kernel of or-parallel Prolog with commit an operational and a denotational model are constructed and related using techniques from metric semantics. By maintaining explicit scope information a compositional handling of the commit for the denotational model is established. By application of an abstraction function, which deletes this extra information, the operational semantic...

We have recently introduced the ”continuation semantics for concurrency” (CSC) technique in an attempt to exploit the benefits of using continuations in concurrent systems development. CSC is a general technique for denotational semantics which provides excellent flexibility in the compositional modeling of concurrent control concepts. In this paper, we present a denotational semantics designed...

A complete formal semantic description of a practical programming language (such as Java) is likely to be a lengthy document, regardless of which semantic framework is being used. Good modularity of the description is important to the person(s) developing it, to facilitate reuse, change, and extension. Unfortunately, the conventional versions of the major semantic frameworks have rather poor mo...

Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...

The formal speciication language LOTOS is an international standard for use in Open Systems Interconnection. A timed extension called ET-LOTOS has been proposed. This paper presents a fully-abstract denotational semantics for the process algebraic component of this extension. The beneets of a denotational semantics are discussed, as are the applications.

During the last three decades several diierent styles of semantics for programming languages have been developed. This thesis compares two of them: the operational and the denotational approach. We show how to give operational and denotational semantics to programming languages, and how to compare diierent semantic models for a given language. Both in the deenition of the denotational semantics...

In this paper we present an algebraic model for the description of probabilistic and nondeterministic processes: PNAL (Probabilistic and Nondeterministic Algebraic Language), an extension of EPL, dee-ned by Matthew Hennessy, including a probabilistic choice operator. An operational semantics and a testing semantics for the language are presented. A denotational semantics for the nite subset of ...

In this paper, we introduce a new semantics for hybrid systems called symbolic dynamics. The semantics is constructed in the tradition of denotational semantics of programming languages, which defines the meaning of a construct by a function. The novelty of this approach is that these semantic functions are defined on complex state spaces carrying algebraic and analytic structures. As in the de...