Purity of an ST monad: full abstraction by semantically typed back-translation
Abstract
In 1995, Launchbury and Peyton Jones extended Haskell with an ST monad that allows the programmer to use higher-order mutable state. They informally argued that these state computations were safely encapsulated, and as such, that the rich reasoning principles stemming from the purity of the language, were not threatened.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Apr 29, 2022
- Source ID
- 10.1145/3527326
Entities
People
- Amin Timany
- Dominique Devriese
- Koen Jacobs
Organizations
- Aarhus University
- Air Force Office of Scientific Research
- Katholieke Universiteit Leuven