Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,791,656 papers from all fields of science
Search
Sign In
Create Free Account
Hindley–Milner type system
Known as:
Let generalization
, Hindley-Milner type system
, Hindley-Milner type inference
Expand
In type theory and functional programming, Hindley–Milner (HM), also known as Damas–Milner or Damas–Hindley–Milner, is a classical type system for…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
23 relations
Attribute grammar
Disjoint-set data structure
Formal system
Free variables and bound variables
Expand
Broader (5)
Formal methods
Lambda calculus
Theoretical computer science
Type inference
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2004
Review
2004
The origins of structural operational semantics
G. Plotkin
J. Log. Algebraic Methods Program.
2004
Corpus ID: 503212
Highly Cited
2003
Highly Cited
2003
Information flow inference for ML
F. Pottier
,
Vincent Simonet
TOPL
2003
Corpus ID: 2175441
This paper presents a type-based information flow analysis for a call-by-value λ-calculus equipped with references, exceptions…
Expand
Highly Cited
1999
Highly Cited
1999
Type Inference with Constrained Types
Martin Odersky
,
M. Sulzmann
,
M. Wehr
Theory Pract. Object Syst.
1999
Corpus ID: 14459622
In this paper we present a general framework HM(X) for Hindley/Milner style type systems with constraints, analogous to the CLP(X…
Expand
Highly Cited
1999
Highly Cited
1999
Dependent types in practical programming
H. Xi
,
F. Pfenning
POPL '99
1999
Corpus ID: 245490
We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index objects are…
Expand
Highly Cited
1998
Highly Cited
1998
Theorem Proving with the Real Numbers
MA John Harrison PhD
Distinguished Dissertations
1998
Corpus ID: 5739114
ions are not often seen in informal mathematics, but they have at least two merits. First, they allow one to write anonymous…
Expand
Review
1993
Review
1993
The Glasgow Haskell Compiler: a technical overview
S. Jones
,
K. Hammond
,
Will Partain
,
P. Wadler
,
C. Hall
,
S. Jones
1993
Corpus ID: 56228824
We give an overview of the Glasgow Haskell compiler, focusing especially on way in which we have been able to exploit the rich…
Expand
Highly Cited
1993
Highly Cited
1993
Type inference with polymorphic recursion
F. Henglein
TOPL
1993
Corpus ID: 17411856
The Damas-Milner Calculus is the typed λ-calculus underlying the type system for ML and several other strongly typed polymorphic…
Expand
Highly Cited
1991
Highly Cited
1991
Polymorphic Type, Region and Effect Inference
J. Talpin
,
P. Jouvelot
J. Funct. Program.
1991
Corpus ID: 16268773
We present a new static system which reconstructs the types, regions and effects of expressions in an implicitly typed functional…
Expand
Highly Cited
1985
Highly Cited
1985
Algebra of Communicating Processes with Abstraction
J. Bergstra
,
J. Klop
Theor. Comput. Sci.
1985
Corpus ID: 19447107
Highly Cited
1978
Highly Cited
1978
A Theory of Type Polymorphism in Programming
R. Milner
J. Comput. Syst. Sci.
1978
Corpus ID: 388583
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE