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 (opens in a new tab)

Related topics

Related topics

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

Broader (5)

Formal methodsLambda calculusTheoretical computer scienceType inference

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Deriving a complete type inference for hindley-milner and vector sizes using expansion
Type inference and program analysis both infer static properties about a program. Yet, they are constructed using very different… 
2009
2009
Necessidade de informação a pais de crianças portadoras de cardiopatia congênita
INTRODUCAO: a equipe de enfermagem deve informar pais de criancas portadoras de cardiopatias no que diz respeito as necessidades… 
2003
2003
Coercions in Hindley-Milner Systems
Coercive subtyping is a theory of abbreviation for dependent type theories. In this paper, we incorporate the idea of coercive… 
1999
1999
Deriving a Statically Typed Type-Directed Partial Evaluator
Type-directed partial evaluation was originally implemented in Scheme, a dynamically typed language. It has also been implemented… 
1999
1999
Program modules, separate compilation, and intermodule optimisation
  • M. Elsman
  • Technical report / University of Copenhagen…
  • 1999
  • Corpus ID: 190006864
iii Abstract This thesis is about a framework for elaborating and interpreting module language constructs at compile time in such… 
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… 
Highly Cited
1993
Highly Cited
1993
A sort inference algorithm for the polyadic π-calculus
In Milner's polyadic π-calculus there is a notion of sorts which is analogous to the notion of types in functional programming… 
1993
1993
A framework for optimising abstract data types
Hindley-Milner type inference and partial evaluation are all that is needed to optimise lists, yielding considerable improvements… 
1991
1991
Strictness Analysis Using Hindley-Milner Type Inference
For many years, abstract interpretation has been thought of as the best way to formalize the analysis of semantic properties of… 
Review
1990
Review
1990
Polymorphic Constructs in Natural and Programming Languages
Problems in parsing conjoined phrases with conjuncts of different syntactic type can apparently be overcome with techniques… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)