Hennessy-Plotkin-Brookes revisited

Authors:
Gordon Plotkin
Affiliations:
Laboratory for the Foundations of Computer Science, School of Informatics, University of Edinburgh, Edinburgh, Scotland
Venue:
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2006

Citing 4
Cited 0

Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of Computation Determine Monads

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Monads and Effects

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Combining effects: sum and tensor

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [3] Hennessy and Plotkin gave a domain-theoretic semantics fully abstract for SIP (the Simple Imperative Programming language) + parallelism together with a certain unnatural synchronisation construct, but not, unfortunately, abstract without that construct. Later, in [1], Brookes gave a fully-abstract trace semantics for a slight variation on SIP + parallelism. In his semantics, meanings of programs are sets of traces subject to certain closure conditions, namely ‘stuttering' and ‘mumbling'; traces are sequences of pairs of states.