Full abstraction for nominal general references
From MaRDI portal
Publication:3401132
DOI10.2168/LMCS-5(3:8)2009zbMath1188.68179arXiv0907.4477MaRDI 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
68Q55: Semantics in the theory of computing
18C50: Categorical semantics of formal languages
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Unnamed Item, Towards Nominal Abramsky, Polynomial-time equivalence testing for deterministic fresh-register automata, Global State Considered Helpful, Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts, Full abstraction for Reduced ML, Program equivalence in a simple language with state, Algorithmic games for full ground references, Game Semantics for Access Control, Block structure vs scope extrusion: between innocence and omniscience