Type inference for partial types is decidable

This publication has 14 references indexed in Scilit:

• A theory of type polymorphism in programming
  Published by Elsevier ,2003
• Type inference with simple subtypes
  Journal of Functional Programming, 1991
• Efficient type inference for higher-order binding-time analysis
  Published by Springer Nature ,1991
• Dynamics in ML
  Published by Springer Nature ,1991
• On the complexity of type inference with coercion
  Published by Association for Computing Machinery (ACM) ,1989
• Type inference with partial types
  Published by Springer Nature ,1988
• Type inference with subtypes
  Published by Springer Nature ,1988
• Coercion and type inference
  Published by Association for Computing Machinery (ACM) ,1984
• A semantic prototyping system
  Published by Association for Computing Machinery (ACM) ,1984
• The completeness theorem for typing λ-terms
  Theoretical Computer Science, 1983