Affiliation:
1. KU Leuven, Belgium
2. IRIF, France / CNRS, France / University of Paris Diderot, France
3. Aarhus University, Denmark
Abstract
We present a logical relations model of a higher-order functional programming language with impredicative polymorphism, recursive types, and a Haskell-style ST monad type with runST. We use our logical relations model to show that runST provides proper encapsulation of state, by showing that effectful computations encapsulated by runST are heap independent. Furthermore, we show that contextual refinements and equivalences that are expected to hold for pure computations do indeed hold in the presence of runST. This is the first time such relational results have been proven for a language with monadic encapsulation of state. We have formalized all the technical development and results in Coq.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Asynchronous Probabilistic Couplings in Higher-Order Separation Logic;Proceedings of the ACM on Programming Languages;2024-01-05
2. Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement;Proceedings of the ACM on Programming Languages;2024-01-05
3. Operationally-based program equivalence proofs using LCTRSs;Journal of Logical and Algebraic Methods in Programming;2023-10
4. More Fixpoints! (Functional Pearl);Proceedings of the ACM on Programming Languages;2023-08-30
5. First-class names for effect handlers;Proceedings of the ACM on Programming Languages;2022-10-31