The Complexity of Type Inference for Higher-Order Typed Lambda Calculi
Abstract
We analyze the computational complexity of type inference for untyped A.terms in the second-order polymorphic typed ~-calculus (l'z) invented by Gi-
Related papers
- The Complexity of Type Inference for Higher-Order Typed lambda Calculi JFP 1994
- CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms POPL 1994
- On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi ESOP 2014
- Type classes with more higher-order polymorphism ICFP 2002
- Embedding a full linear Lambda calculus in Haskell Haskell 2015
- Better Defunctionalization through Lambda Set Specialization PLDI 2023
- Trust in the lambda-Calculus JFP 1997
- Types in Lambda Calculi and Programming Languages ESOP 1990