Fully abstract models for effectful λ-calculi via category-theoretic logical relations
Ohad Kammar, Shin-ya Katsumata, Philip Saville
Abstract
We present a construction which, under suitable assumptions, takes a model of Moggi’s computational λ-calculus with sum types, effect operations and primitives, and yields a model that is adequate and fully abstract. The construction, which uses the theory of fibrations, categorical glueing, ⊤⊤-lifting, and ⊤⊤-closure, takes inspiration from O’Hearn & Riecke’s fully abstract model for PCF. Our construction can be applied in the category of sets and functions, as well as the category of diffeological spaces and smooth maps and the category of quasi-Borel spaces, which have been studied as semantics for differentiable and probabilistic programming.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 2361f2cc-b205-43a4-9122-f10cca5418faCited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- Concrete categories and higher-order recursion: With applications including probability, differentiability, and full abstractionCristina Matache, Sean K. Moss, Sam StatonLICS 2022 · 3 citations
- Commutative Monads for Probabilistic Programming LanguagesXiaodong Jia, Bert Lindenhovius, Michael W. Mislove, Vladimir ZamdzhievLICS 2021 · 19 citations
- ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable ProgramsMathieu Huot, Alexander K. Lew, Vikash K. Mansinghka, Sam StatonLICS 2023 · 5 citations
- Cones as a model of intuitionistic linear logicThomas EhrhardLICS 2020 · 4 citations
- Cartesian Coherent Differential CategoriesThomas Ehrhard, Aymeric WalchLICS 2023 · 2 citations
