A fully abstract translation between a λ-calculus with reference types and Standard ML
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 397-413
- https://doi.org/10.1007/bfb0014067
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Equality in lazy computation systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- References, local variables and operational reasoningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A co-induction principle for recursively defined domainsTheoretical Computer Science, 1994
- Full Abstraction in the Lazy Lambda CalculusInformation and Computation, 1993
- Fully abstract translations between functional languagesMathematical Structures in Computer Science, 1993
- Observable properties of higher order functions that dynamically create local names, or: What's new?Published by Springer Nature ,1993
- Equivalence in functional languages with effectsJournal of Functional Programming, 1991
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977