Full Abstraction for Reduced ML

DOI10.1007/978-3-642-00596-1_4zbMath1234.68058OpenAlexW1861428078MaRDI QIDQ3617719

Nikos Tzevelekos, Andrzej S. Murawski

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_4

Mathematics Subject Classification ID

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

Related Items

Algorithmic games for full ground references ⋮ Full abstraction for Reduced ML ⋮ Program equivalence in a simple language with state ⋮ ML and Extended Branching VASS ⋮ Algorithmic Nominal Game Semantics

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
• A game semantics of names and pointers
• Algorithmic Nominal Game Semantics
• Bad Variables Under Control
• Game theoretic analysis of call-by-value computation
• Tools and Algorithms for the Construction and Analysis of Systems
• Foundations of Software Science and Computation Structures