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… (More)
Wikipedia

Related topics

Related topics

23 relations
Attribute grammarDisjoint-set data structureFormal systemFree variables and bound variables
(More)

Broader (5)

Formal methodsLambda calculusTheoretical computer scienceType inference
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Extending Hindley-Milner Type Inference with Coercive Subtyping ( long version )
We investigate how to add coercive structural subtyping to a type system for simply-typed lambda calculus with Hindley-Milner… (More)
  • figure 4
  • figure 5
  • figure 9
  • figure 13
  • figure 15
Is this relevant?
2011
2011
Extending Hindley-Milner Type Inference with Coercive Structural Subtyping
We investigate how to add coercive structural subtyping to a type system for simply-typed lambda calculus with Hindley-Milner… (More)
  • figure 4
  • figure 8
  • figure 11
  • figure 12
Is this relevant?
2008
2008
Many holes in hindley-milner
We implement statically-typed multi-holed contexts in OCaml using an underlying algebraic datatype augmented with phantom types… (More)
Is this relevant?
2006
2006
Concoqtion : Mixing Dependent Types and Hindley-Milner Type Inference ( Technical Report )
This paper addresses the question of how to extend OCaml’s Hindley-Milner type system with types indexed by logical propositions… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2002
2002
Generalizing Hindley-Milner Type Inference Algorithms
Type inferencing according to the standard algorithms W and M often yields uninformative error messages. Many times, this is a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Type Inference with Constrained Types
There are many type systems that extend the Hindley/Milner[Mil78] system with constraints. Examples are found in record systems… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A Practical Soft Type System for Scheme
A soft type system infers types for the procedures and data structures of dynamically typed programs. Like conventional static… (More)
Is this relevant?
1995
1995
From Hindley-Milner Types to First-Class Structures
We describe extensions of the Hindley-Milner type system to support higher-order polymorphism and first-class structures with… (More)
  • figure 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Once Upon a Type
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley… (More)
  • figure 1
  • figure 3
Is this relevant?
1994
1994
Using Hindley-Milner Type Inference to Optimise List Representation
Lists are a pervasive data structure in functional programs. The generality and simplicity of their structure makes them… (More)
Is this relevant?