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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Type inference and program analysis both infer static properties about a program. Yet, they are constructed using very different… 
2009
2009
Los seres humanos organizan los acontecimientos pasados como “memorias”, es decir, todo lo que aprenden se codifica y almacena en… 
2003
2003
Coercive subtyping is a theory of abbreviation for dependent type theories. In this paper, we incorporate the idea of coercive… 
2000
2000
  • S. Nishizaki
  • 2000
  • Corpus ID: 23600700
The polymorphic environment calculus is a polymorphic lambda calculus which enables us to treat environments as first-class… 
1999
1999
Type-directed partial evaluation was originally implemented in Scheme, a dynamically typed language. It has also been implemented… 
1999
1999
We introduce an explicitly typed λµ-calculus of call-by-value as a short-hand for the 2nd order Church-style. Our motivation… 
1996
1996
We investigate bridging in a telechelic polymer brush in solution using the Milner−Witten−Cates self-consistent mean-field model… 
1994
1994
Lists are a pervasive data structure in functional programs. The generality and simplicity of their structure makes them… 
1993
1993
This note is (intended to be) released in conjunction with a preliminary announcement of Abram-sky, Jagadeesan and Malacaria… 
1991
1991
For many years, abstract interpretation has been thought of as the best way to formalize the analysis of semantic properties of…