Full Abstraction for Reduced ML
From MaRDI portal
Recommendations
Cites work
- A game semantics of names and pointers
- A new approach to abstract syntax with variable binding
- Algorithmic nominal game semantics
- Bad Variables Under Control
- Foundations of Software Science and Computation Structures
- Full abstraction for PCF
- Functions with local state: regularity and undecidability
- Game theoretic analysis of call-by-value computation
- Games and full abstraction for FPC.
- scientific article; zbMATH DE number 1223609 (Why is no real title available?)
- scientific article; zbMATH DE number 1499102 (Why is no real title available?)
- 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
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(6)
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 Q3617719)