Extending Pruning Techniques to Polymorphic Second order Lambda-Calculus
No abstract available.
Related papers
- Empty Types in Polymorphic Lambda Calculus POPL 1987
- Finitary polymorphism for optimizing type-directed compilation ICFP 2018
- The Complexity of Type Inference for Higher-Order Typed Lambda Calculi POPL 1991
- A Polymorphic Record Calculus and Its Compilation TOPLAS 1995
- How to prove your calculus is decidable: practical applications of second-order algebraic theories and computation ICFP 2017
- Semantics of pattern unification JFP 2025
- Strong Normalisation for the Linear Term Calculus JFP 1995
- Full abstraction for the quantum lambda-calculus POPL 2020