A Fully Abstract Trace Semantics for General References

DOI10.1007/978-3-540-73420-8_58zbMath1171.68408OpenAlexW1709253165MaRDI QIDQ5428848

James Laird

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_58

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Related Items (11)

A System-Level Game Semantics ⋮ A Complete, Co-inductive Syntactic Theory of Sequential Control and State ⋮ Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts ⋮ Higher-order linearisability ⋮ A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus ⋮ Complete trace models of state and control ⋮ Global State Considered Helpful ⋮ From Applicative to Environmental Bisimulation ⋮ Realisability semantics of parametric polymorphism, general references and recursive types ⋮ Unnamed Item ⋮ A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References

This page was built for publication: A Fully Abstract Trace Semantics for General References