Skip to search formSkip to main contentSkip to account menu

Hindley–Milner type system

Known as: Let generalization, Hindley-Milner type system, Hindley-Milner type inference 
In type theory and functional programming, Hindley–Milner (HM), also known as Damas–Milner or Damas–Hindley–Milner, is a classical type system for… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2004
Review
2004
  • G. Plotkin
  • J. Log. Algebraic Methods Program.
  • 2004
  • Corpus ID: 503212
Highly Cited
2003
Highly Cited
2003
This paper presents a type-based information flow analysis for a call-by-value λ-calculus equipped with references, exceptions… 
Highly Cited
1999
Highly Cited
1999
In this paper we present a general framework HM(X) for Hindley/Milner style type systems with constraints, analogous to the CLP(X… 
Highly Cited
1999
Highly Cited
1999
We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index objects are… 
Highly Cited
1998
Highly Cited
1998
ions are not often seen in informal mathematics, but they have at least two merits. First, they allow one to write anonymous… 
Review
1993
Review
1993
We give an overview of the Glasgow Haskell compiler, focusing especially on way in which we have been able to exploit the rich… 
Highly Cited
1993
Highly Cited
1993
The Damas-Milner Calculus is the typed λ-calculus underlying the type system for ML and several other strongly typed polymorphic… 
Highly Cited
1991
Highly Cited
1991
We present a new static system which reconstructs the types, regions and effects of expressions in an implicitly typed functional… 
Highly Cited
1985
Highly Cited
1985
Highly Cited
1978
Highly Cited
1978
  • R. Milner
  • J. Comput. Syst. Sci.
  • 1978
  • Corpus ID: 388583