A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus

@inproceedings{Kfoury1994ADA,
  title={A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus},
  author={Assaf J. Kfoury and Joe B. Wells},
  booktitle={LISP and Functional Programming},
  year={1994}
}
We examine the problem of type inference for a family of polymorphic type systems containing the power of Core-ML. This family comprises the levels of the stratification of the second-order λ-calculus (system F) by “rank” of types. We show that typability is an undecidable problem at every rank k≥3. While it was already known that typability is decidable at rank 2, no direct and easy-to-implement algorithm was available. We develop a new notion of λ-term reduction and use it to prove that the… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…