Full abstraction for Reduced ML
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1223609 (Why is no real title available?)
- scientific article; zbMATH DE number 1499102 (Why is no real title available?)
- A game semantics of names and pointers
- A new approach to abstract syntax with variable binding
- Algorithmic games for full ground references
- Algorithmic nominal game semantics
- Bad Variables Under Control
- Block structure vs. scope extrusion: between innocence and omniscience
- Foundations of Software Science and Computation Structures
- Full Abstraction for Reduced ML
- Full abstraction for PCF
- Full abstraction for nominal general references
- Functions with local state: regularity and undecidability
- Game Semantics for Higher-Order Concurrency
- Game-theoretic analysis of call-by-value computation
- Games and full abstraction for FPC.
- Global state considered helpful
- Notions of computation and monads
- On full abstraction for PCF: I, II and III
- On the semantics of the bad-variable constructor in Algol-like languages
- Operational reasoning for functions with local state
Cited in
(3)
This page was built for publication: Full abstraction for Reduced ML
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388212)