A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus
- 1 July 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Lisp Pointers
- Vol. VII (3), 196-207
- https://doi.org/10.1145/182590.182456
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- The Undecidability of the Semi-unification ProblemInformation and Computation, 1993
- Type reconstruction in finite rank fragments of the second-order λ-calculusInformation and Computation, 1992
- Bounded quantification is undecidablePublished by Association for Computing Machinery (ACM) ,1992
- Finitely stratified polymorphismInformation and Computation, 1991
- Type inference in polymorphic type disciplineLecture Notes in Computer Science, 1991
- Type inference and semi-unificationPublished by Association for Computing Machinery (ACM) ,1988
- The typechecking of programs with implicit type structureLecture Notes in Computer Science, 1984
- Polymorphic type inferencePublished by Association for Computing Machinery (ACM) ,1983
- Edinburgh LCFLecture Notes in Computer Science, 1979