HM(X) type inference is CLP(X) solving
From MaRDI portal
Publication:5451969
DOI10.1017/S0956796807006569zbMath1142.68021MaRDI QIDQ5451969
Martin Sulzmann, Peter J. Stuckey
Publication date: 27 March 2008
Published in: Journal of Functional Programming (Search for Journal in Brave)
68N18: Functional programming and lambda calculus
Related Items
Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis, Idealized coinductive type systems for imperative object-oriented programs, Abstract Compilation of Object-Oriented Languages into Coinductive CLP(X): Can Type Inference Meet Verification?
Uses Software
Cites Work
- Unnamed Item
- A polymorphic type system for Prolog
- Type inference with subtypes
- A theory of type polymorphism in programming
- Nominal unification
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- Concepts in Programming Languages
- A framework for type inference with subtyping
- A Machine-Oriented Logic Based on the Resolution Principle
- A constraint-based region inference algorithm