Functional Back-Ends within the Lambda-Sigma Calculus
Abstract
Projet PARA
Related papers
- Functional Runtime Systems Within the Lambda-Sigma Calculus JFP 1998
- From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions POPL 1994
- Label dependent lambda calculus and gradual typing OOPSLA 2021
- Theoretical Pearl: An adequate and efficient left-associated binary numeral system in the Lambda-calculus JFP 2000
- Director Strings as Combinators TOPLAS 1988
- A Quantum-Control Lambda-Calculus with Multiple Measurement Bases APLAS 2025
- Type-preserving compilation of end-to-end verification of security enforcement PLDI 2010
- Completeness and Decidability of de Bruijn Substitution Algebra in Coq CPP 2015