Full abstraction for Reduced ML

DOI10.1016/j.apal.2013.05.007zbMath1358.68060MaRDI QIDQ388212

Andrzej S. Murawski, Nikos Tzevelekos

Publication date: 19 December 2013

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2013.05.007

zbMATH Keywords

full abstraction; game semantics; contextual equivalence; ML-like references; nominal techniques; Reduced ML

Mathematics Subject Classification ID

68N18: Functional programming and lambda calculus

68Q55: Semantics in the theory of computing

Related Items

Unnamed Item, Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts

Uses Software

• ML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the semantics of the bad-variable constructor in Algol-like languages
• Functions with local state: regularity and undecidability
• A new approach to abstract syntax with variable binding
• Notions of computation and monads
• Games and full abstraction for FPC.
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Game-theoretic analysis of call-by-value computation
• A game semantics of names and pointers
• Algorithmic Nominal Game Semantics
• Algorithmic Games for Full Ground References
• Full abstraction for nominal general references
• Block Structure vs. Scope Extrusion: Between Innocence and Omniscience
• Bad Variables Under Control
• Full Abstraction for Reduced ML
• Foundations of Software Science and Computation Structures
• Game Semantics for Higher-Order Concurrency
• Global State Considered Helpful