The emptiness problem for intersection types

This publication has 13 references indexed in Scilit:

• Type reconstruction in Fω is undecidable
  Published by Springer Nature ,2005
• A theory of type polymorphism in programming
  Published by Elsevier ,2003
• Intersection Types as Logical Formulae
  Journal of Logic and Computation, 1994
• The completeness of provable realizability.
  Notre Dame Journal of Formal Logic, 1989
• Proof functional connectives
  Lecture Notes in Mathematics, 1985
• A filter lambda model and the completeness of type assignment
  The Journal of Symbolic Logic, 1983
• Polymorphic type inference
  Published by Association for Computing Machinery (ACM) ,1983
• Functional Characters of Solvable Terms
  Mathematical Logic Quarterly, 1981
• An extension of the basic functionality theory for the $\lambda$-calculus.
  Notre Dame Journal of Formal Logic, 1980
• The Principal Type-Scheme of an Object in Combinatory Logic
  Transactions of the American Mathematical Society, 1969