Fully abstract semantics for observably sequential languages

DOI10.1006/INCO.1994.1047zbMath0806.68072OpenAlexW2012319728MaRDI QIDQ1327401

Matthias Felleisen, Robert Cartwright, Pierre-Louis Curien

Publication date: 19 June 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1994.1047

zbMATH Keywords

denotational semanticssequential programming language

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (18)

Comparing hierarchies of types in models of linear logic ⋮ A synthetic theory of sequential domains ⋮ Sequential algorithms for unbounded nondeterminism ⋮ Unnamed Item ⋮ Symmetry and Interactivity in Programming ⋮ Concrete data structures and functional parallel programming ⋮ A stable programming language ⋮ Unnamed Item ⋮ Non-uniform (hyper/multi)coherence spaces ⋮ Nondeterminism and Observable Sequentiality ⋮ Non-Uniform Hypercoherences ⋮ Locally Boolean domains ⋮ Parallel and serial hypercoherences ⋮ The sequentially realizable functionals ⋮ A relative PCF-definability result for strongly stable functions and some corollaries ⋮ Games and full abstraction for FPC. ⋮ Definability and Full Abstraction ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin

This page was built for publication: Fully abstract semantics for observably sequential languages