In CCS, non-determinate behaviours (in sane sense of detexminacy) are the rule rather than
the exception. The outcome-or even the capability-of future observations may not be …

A language called ASL for describing structured algebraic specifications is presented. ASL
is a declarative higher-order language. It contains constructs for building (possibly infinite) …

The aim of this work is largely a practical one. A widely employed style of programming,
particularly in structure-processing languages which impose no discipline of types, entails …

The Formal Semantics of Programming Languages provides the basic mathematical
techniques necessary for those who are beginning a study of the semantics and logics of …

This text is based on the chapter Domain Theory in the Handbook for Logic in Computer
Science, volume 3, edited by S. Abramsky, Dov M. Gabbay, and TS E. Maibaum, published …

Since a nondeterministic and concurrent program may, in general, communicate repeatedly
with its environment, its meaning cannot be presented naturally as an input/output function …

We overview a programme to provide a unified semantics for computational effects based
upon the notion of a countable enriched Lawvere theory. We define the notion of countable …

Two complementary but equivalent semantic interpretations of a high level probabilistic
programming language are given. One of these interprets programs as partial measurable …

A mathematics book with six authors is perhaps a rare enough occurrence to make a reader
ask how such a collaboration came about. We begin, therefore, with a few words on how we …

Development methods for (sequential) programs that run in isolation have been studied
elsewhere. Programs that run in parallel can interfere with each other, either via shared …