Full abstraction for nominal general references
From MaRDI portal
Publication:3401132
DOI10.2168/LMCS-5(3:8)2009zbMath1188.68179arXiv0907.4477OpenAlexW3100163783MaRDI QIDQ3401132
Publication date: 28 January 2010
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.4477
Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (10)
Unnamed Item ⋮ Algorithmic games for full ground references ⋮ Full abstraction for Reduced ML ⋮ Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts ⋮ Block structure vs scope extrusion: between innocence and omniscience ⋮ Program equivalence in a simple language with state ⋮ Polynomial-time equivalence testing for deterministic fresh-register automata ⋮ Global State Considered Helpful ⋮ Towards Nominal Abramsky ⋮ Game Semantics for Access Control
This page was built for publication: Full abstraction for nominal general references
