Decision Algorithms for Checking Definability of Order-2 Finitary PCF
Abstract elided by the publisher.
Related papers
- Reachability is Decidable for ATM-Typable Finitary PCF with Effect Handlers APLAS 2025
- On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus POPL 2025
- Finitary polymorphism for optimizing type-directed compilation ICFP 2018
- The geometry of types POPL 2013
- Faster Algorithms for Finitary Games TACAS 2007
- Fair Termination for Parameterized Probabilistic Concurrent Systems TACAS 2017
- Polyregular Model Checking CAV 2025
- Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming POPL 2018