Unification and ML-Type Reconstruction

@inproceedings{Kanellakis1991UnificationAM,
  title={Unification and ML-Type Reconstruction},
  author={Paris C. Kanellakis and Harry G. Mairson and John C. Mitchell},
  booktitle={Computational Logic - Essays in Honor of Alan Robinson},
  year={1991}
}
We study the complexity of type reconstruction for a core fragment of ML with lambda abstraction, function application, and the polymorphic let declaration. We derive exponential upper and lower bounds on recognizing the typable core ML expressions. Our primary technical tool is uniication of succinctly represented type expressions. After observing that core ML expressions, of size n, can be typed in DTIME(2 n), we exhibit two diierent families of programs whose principal types grow… CONTINUE READING
Highly Cited
This paper has 52 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 35 extracted citations

52 Citations

0510'90'96'03'10'17
Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Combinatory Logic I

  • H. B. Curry, R. Feys
  • North-Holland
  • 1958

Similar Papers

Loading similar papers…