Aliasing Control in an Imperative Pure Calculus
Abstract elided by the publisher.
Related papers
- Recovering purity with comonads and capabilities ICFP 2020
- Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Affordable with Precise Effect Dependencies OOPSLA 2023
- LaCasa: lightweight affinity and object capabilities in Scala OOPSLA 2016
- Functional translation of a calculus of capabilities ICFP 2008
- Destination Calculus: A Linear 𝜆-Calculus for Purely Functional Memory Writes OOPSLA 2025
- 'do' unchained: embracing local imperativity in a purely functional language (functional pearl) ICFP 2022
- A logical analysis of aliasing in imperative higher-order functions JFP 2007
- Aeneas: Rust verification by functional translation ICFP 2022