Reachability is Decidable for ATM-Typable Finitary PCF with Effect Handlers
No abstract available.
Related papers
- On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus POPL 2025
- On Higher-Order Model Checking of Effectful Answer-Type-Polymorphic Programs OOPSLA 2025
- Higher-Order Model Checking of Effect-Handling Programs with Answer-Type Modification OOPSLA 2024
- Decision Algorithms for Checking Definability of Order-2 Finitary PCF APLAS 2015
- Finitary polymorphism for optimizing type-directed compilation ICFP 2018
- From Capabilities to Regions: Enabling Efficient Compilation of Lexical Effect Handlers OOPSLA 2023
- When Types Intersect and Effects Get Handled ICFP 2026
- Effects for efficiency: asymptotic speedup with first-class control ICFP 2020