Stackability in the Simply-Typed Call-by-Value Lambda Calculus
No abstract available.
Related papers
- Backpropagation in the simply typed lambda-calculus with linear negation POPL 2020
- Recovering purity with comonads and capabilities ICFP 2020
- The calculus of dependent lambda eliminations JFP 2017
- Implementation of the Typed Call-by-Value lambda-Calculus using a Stack of Regions POPL 1994
- On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus POPL 2025
- A Case for First-Class Environments OOPSLA 2024
- Formal Small-Step Verification of a Call-by-Value Lambda Calculus Machine APLAS 2018
- Static typing for a faulty lambda calculus ICFP 2006