Principality and decidable type inference for finite-rank intersection types
- 1 January 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 161-174
- https://doi.org/10.1145/292540.292556
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Typability and type checking in the second-order λ-calculus are equivalent and undecidablePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Type reconstruction in FωMathematical Structures in Computer Science, 1997
- What are principal typings and what are they good for?Published by Association for Computing Machinery (ACM) ,1996
- Bounded Quantification Is UndecidableInformation and Computation, 1994
- A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculusPublished by Association for Computing Machinery (ACM) ,1994
- Filter models with polymorphic typesTheoretical Computer Science, 1992
- Principal type scheme and unification for intersection type disciplineTheoretical Computer Science, 1988
- Principal type schemes for an extended type theoryTheoretical Computer Science, 1983
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982
- Functional Characters of Solvable TermsMathematical Logic Quarterly, 1981