Partial polymorphic type inference and higher-order unification

This publication has 10 references indexed in Scilit:

• Higher-order abstract syntax
  Published by Association for Computing Machinery (ACM) ,1988
• Natural deduction as higher-order resolution
  The Journal of Logic Programming, 1986
• Abstract types have existential types
  Published by Association for Computing Machinery (ACM) ,1985
• Partial polymorphic type inference is undecidable
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• Automating Higher-Order Logic
  Contemporary Mathematics, 1984
• Polymorphic type inference
  Published by Association for Computing Machinery (ACM) ,1983
• The undecidability of the second-order unification problem
  Theoretical Computer Science, 1981
• A unification algorithm for typed λ-calculus
  Theoretical Computer Science, 1975
• Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types
  Published by Elsevier ,1971
• A formulation of the simple theory of types
  The Journal of Symbolic Logic, 1940