Types in Lambda Calculi and Programming Languages
No abstract available.
Related papers
- The Complexity of Type Inference for Higher-Order Typed Lambda Calculi POPL 1991
- Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework POPL 2023
- Typed lambda-calculi with one binder JFP 2005
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi JFP 2021
- The Complexity of Type Inference for Higher-Order Typed lambda Calculi JFP 1994
- Blame and coercion: Together again for the first time JFP 2021
- Optimal Derivations in Weak Lambda-calculi and in Orthogonal Terms Rewriting Systems POPL 1991
- From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions POPL 1994