Hindley–Milner type system

In type theory and functional programming, Hindley–Milner (HM), also known as Damas–Milner or Damas–Hindley–Milner, is a classical type system for the lambda calculus with parametric polymorphism, first described by J. Roger Hindley^[1] and later rediscovered by Robin Milner.^[2] Luis Damas contributed a close formal analysis and proof of the method in his PhD thesis.^[3]^[4]

Among HM's more notable properties is completeness and its ability to deduce the most general type of a given program without the need of any type annotations or other hints supplied by the programmer. Algorithm W is a fast algorithm, performing type inference in almost linear time with respect to the size of the source, making it practically usable to type large programs.^{[note 1]} HM is preferably used for functional languages. It was first implemented as part of the type system of the programming language ML. Since then, HM has been extended in various ways, most notably by constrained types as used in Haskell.

Introduction

Organizing their original paper, Damas and Milner^[4] clearly separated two very different tasks. One is to describe what types an expression can have and another to present an algorithm actually computing a type. Keeping the two aspects separate allows one to focus separately on the logic (i.e. meaning) behind the algorithm, as well as to establish a benchmark for the algorithm's properties.

How expressions and types fit to each other is described by means of a deductive system. Like any proof system, it allows different ways to come to a conclusion and since one and the same expression arguably might have different types, dissimilar conclusions about an expression are possible. Contrary to this, the type inference method itself (Algorithm W) is defined as a deterministic step-by-step procedure, leaving no choice what to do next. Thus clearly, decisions not present in the logic might have been made constructing the algorithm, which demand a closer look and justifications but would perhaps remain non-obvious without the above differentiation.

Syntax

Expressions
${\begin{array}{lrll}e&=&x&{\textrm {variable}}\\&\vert &e_{1}\ e_{2}&{\textrm {application}}\\&\vert &\lambda \ x\ .\ e&{\textrm {abstraction}}\\&\vert &{\mathtt {let}}\ x=e_{1}\ {\mathtt {in}}\ e_{2}\\\end{array}}$
Types
${\begin{array}{llrll}{\textrm {mono}}&\tau &=&\alpha &\ {\textrm {variable}}\\&&\vert &D\ \tau \dots \tau &\ {\textrm {application}}\\{\textrm {poly}}&\sigma &=&\tau \\&&\vert &\forall \ \alpha \ .\ \sigma &\ {\textrm {quantifier}}\\\\\end{array}}$

Logic and algorithm share the notions of "expression" and "type", whose form is made precise by the syntax.

The expressions to be typed are exactly those of the lambda calculus, enhanced by a let-expression. These are shown in the adjacent table. For readers unfamiliar with the lambda calculus, here is a brief explanation: The application $e_{1}e_{2}$ represents applying the function $e_{1}$ to the argument $e_{2}$ , often written $e_{1}(e_{2})$ . The abstraction $\lambda \ x\ .\ e$ represents an anonymous function that maps the input $x$ to the output $e$ . This is also called function literal, common in most contemporary programming languages, and sometimes written as ${\mathtt {function}}\,(x)\ {\mathtt {return}}\ e\ {\mathtt {end}}$ . The let expression ${\mathtt {let}}\ x=e_{1}\ {\mathtt {in}}\ e_{2}$ represents the result of substituting every occurrence of $x$ in $e_{2}$ with $e_{1}$ .

Types as a whole are split into two groups, called mono- and polytypes.^{[note 2]}

Monotypes

Monotypes $\tau$ are syntactically represented as terms. A monotype always designates a particular type, in the sense that it is equal only to itself and different from all others.

Examples of monotypes include type constants like ${\mathtt {int}}$ or ${\mathtt {string}}$ , and parametric types like ${\mathtt {Map\ (Set\ string)\ int}}$ . These types are examples of applications of type functions, for example, from the set $\{{\mathtt {Map^{2},\ Set^{1},\ string^{0},\ int^{0}}}\}$ , where the superscript indicates the number of type parameters. The complete set of type functions $D$ is arbitrary in HM, except that it must contain at least $\rightarrow ^{2}$ , the type of functions. It is often written in infix notation for convenience. For example, a function mapping integers to strings has type ${\mathtt {int}}\rightarrow {\mathtt {string}}$ ; here, the type ${\mathtt {int}}\rightarrow {\mathtt {string}}$ is written in infix notation. In prefix notation, it would be $(\rightarrow )\ {\mathtt {int}}\ {\mathtt {string}}$ . ^{[note 3]}

Type variables are monotypes. Standing alone, a type variable $\alpha$ is meant to be as concrete as ${\mathtt {int}}$ or $\beta$ , and clearly different from both. Type variables occurring as monotypes behave as if they were type constants whose identity is unknown. Correspondingly, a function typed $\alpha \rightarrow \alpha$ only maps values of the particular type $\alpha$ on itself. Such a function can only be applied to values having type $\alpha$ and to no others.

Polytype

Polytypes (or type schemes) are types containing variables bound by one or more for-all quantifiers, e.g. $\forall \alpha .\alpha \rightarrow \alpha$ .

A function with polytype $\forall \alpha .\alpha \rightarrow \alpha$ can map any value of the same type to itself, and the identity function is a value for this type.

As another example $\forall \alpha .({\mathtt {Set}}\ \alpha )\rightarrow {\mathtt {int}}$ is the type of a function mapping all finite sets to integers. The count of members is a value for this type.

Note that quantifiers can only appear top level, i.e. a type $\forall \alpha .\alpha \rightarrow \forall \alpha .\alpha$ for instance, is excluded by the syntax of types. Note also that monotypes are included in the polytypes, thus a type has the general form $\forall \alpha _{1}\dots \forall \alpha _{n}.\tau$ , where $\tau$ is a monotype.

Free type variables

Free Type Variables
${\begin{array}{ll}{\text{free}}(\ \alpha \ )&=\ \left\{\alpha \right\}\\{\text{free}}(\ D\ \tau _{1}\dots \tau _{n}\ )&=\ \bigcup \limits _{i=1}^{n}{{\text{free}}(\ \tau _{i}\ )}\\{\text{free}}(\ \forall \ \alpha \ .\ \sigma \ )&=\ {\text{free}}(\ \sigma \ )\ -\ \left\{\alpha \right\}\\\end{array}}$

In a type $\forall \alpha _{1}\dots \forall \alpha _{n}.\tau$ , the symbol $\forall$ is the quantifier binding the type variables $\alpha _{i}$ in the monotype $\tau$ . The variables $\alpha _{i}$ are called quantified and any occurrence of a quantified type variable in $\tau$ is called bound and all unbound type variables in $\tau$ are called free. Like in the lambda calculus, the notion of free and bound variables is essential for the understanding of the meaning of types.

This is certainly the hardest part of HM, perhaps because polytypes containing free variables are not represented in programming languages like Haskell. Likewise, one does not have clauses with free variables in Prolog. In particular developers experienced with both languages and actually knowing all the prerequisites of HM, are likely to slip this point. In Haskell for example, all type variables implicitly occur quantified, i.e. a Haskell type a -> a means $\forall \alpha .\alpha \rightarrow \alpha$ here. Because a type like $\alpha \rightarrow \alpha$ , though it may practically occur in a Haskell program, cannot be expressed there, it can easily be confused with its quantified version.

So what function can have a type like e.g. $\forall \beta .\beta \rightarrow \alpha$ , i.e. a mixture of both bound and free type variables and what could the free type variable $\alpha$ therein mean?

Example 1
${\begin{array}{l}{\textbf {let}}\ {\mathit {bar}}\ [\forall \alpha .\forall \beta .\alpha \rightarrow (\beta \rightarrow \alpha )]=\lambda \ x.\\\quad {\textbf {let}}\ {\mathit {foo}}\ [\forall \beta .\beta \rightarrow \alpha ]=\lambda \ y.x\\\quad {\textbf {in}}\ {\mathit {foo}}\\{\textbf {in}}\ {\mathit {bar}}\end{array}}$

Consider ${\mathit {foo}}$ in Example 1, with type annotations in brackets. Its parameter $y$ is not used in the body, but the variable $x$ bound in the outer context of ${\mathit {foo}}$ surely is. As a consequence, ${\mathit {foo}}$ accepts every value as argument, while returning a value bound outside and with it its type. ${\mathit {bar}}$ to the contrary has type $\forall \alpha .\forall \beta .\alpha \rightarrow (\beta \rightarrow \alpha )$ , in which all occurring type variables are bound. Evaluating, for instance ${\mathit {bar}}\ 1$ , results in a function of type $\forall \beta .\beta \rightarrow \ {\mathit {int}}$ , perfectly reflecting that foo's monotype $\alpha$ in $\forall \beta .\beta \rightarrow \alpha$ has been refined by this call.

In this example, the free monotype variable $\alpha$ in foo's type becomes meaningful by being quantified in the outer scope, namely in bar's type. I.e. in context of the example, the same type variable $\alpha$ appears both bound and free in different types. As a consequence, a free type variable cannot be interpreted better than stating it is a monotype without knowing the context. Turning the statement around, in general, a typing is not meaningful without a context.

Context and typing

Syntax
${\begin{array}{llrl}{\text{Context}}&\Gamma &=&\epsilon \ {\mathtt {(empty)}}\\&&\vert &\Gamma ,\ x:\sigma \\{\text{Typing}}&&=&\Gamma \vdash e:\sigma \\\\\end{array}}$
Free Type Variables
${\begin{array}{ll}{\text{free}}(\ \Gamma \ )&=\ \bigcup \limits _{x:\sigma \in \Gamma }{\text{free}}(\ \sigma \ )\end{array}}$

Consequently, to get the yet disjoint parts of the syntax, expressions and types together meaningfully, a third part, the context is needed. Syntactically, it is a list of pairs $x:\sigma$ , called assignments or assumptions, stating for each value variable $x_{i}$ therein a type $\sigma _{i}$ . All three parts combined gives a typing judgment of the form $\Gamma \ \vdash \ e:\sigma$ , stating, that under assumptions $\Gamma$ , the expression $e$ has type $\sigma$ .

Now having the complete syntax at hand, one can finally make a meaningful statement about the type of ${\mathit {foo}}$ in example 1, above, namely $x:\alpha \vdash \lambda \ y.x:\forall \beta .\beta \rightarrow \alpha$ . Contrary to the above formulations, the monotype variable $\alpha$ no longer appears unbound, i.e. meaningless, but bound in the context as the type of the value variable $x$ . The circumstance whether a type variable is bound or free in the context apparently plays a significant role for a type as part of a typing, so ${\text{free}}(\ \Gamma \ )$ it is made precise in the side box.

Polymorphic type order

While the equality of monotypes is purely syntactical, polytypes offer a richer structure by being related to other types through a specialization relation $\sigma \sqsubseteq \sigma '$ expressing that $\sigma '$ is more special than $\sigma$ .

When being applied to a value a polymorphic function has to change its shape specializing to deal with this particular type of values. During this process, it also changes its type to match that of the parameter. If for instance the identity function having type $\forall \alpha .\alpha \rightarrow \alpha$ is to be applied on a number having type $int$ , both simply cannot work together, because all the types are different and nothing fits. What is needed is a function of type $int\rightarrow int$ . Thus, during application, the polymorphic identity is specialized to a monomorphic version of itself. In terms of the specialization relation, one writes $\forall \alpha .\alpha \rightarrow \alpha \sqsubseteq \ int\rightarrow int$

Now the shape shifting of polymorphic values is not fully arbitrary but rather limited by their pristine polytype. Following what has happened in the example one could paraphrase the rule of specialization, saying, a polymorphic type $\forall \alpha .\tau$ is specialized by consistently replacing each occurrence of $\alpha$ in $\tau$ and dropping the quantifier. While this rule works well for any monotype used as replacement, it fails when a polytype, say $\forall \beta .\beta$ is tried as a replacement, resulting in the non-syntactical type $\forall \beta .\beta \rightarrow \forall \beta .\beta$ .

The syntactic restriction to allow quantification only top-level is imposed to prevent generalization while specializing. Instead of $\forall \beta .\beta \rightarrow \forall \beta .\beta$ , the more special type $\forall \beta .\beta \rightarrow \beta$ must be produced in this case.

One could undo the former specialization by specializing on some value of type $\forall \alpha .\alpha$ again. In terms of the relation one gains $\forall \alpha .\alpha \rightarrow \alpha \sqsubseteq \forall \beta .\beta \rightarrow \beta \sqsubseteq \forall \alpha .\alpha \rightarrow \alpha$ as a summary, meaning that syntactically different polytypes are equal with respect to renaming their quantified variables.

Specialization Rule
$\displaystyle {\frac {\tau '=\left[\alpha _{i}:=\tau _{i}\right]\tau \quad \beta _{i}\not \in {\textrm {free}}(\forall \alpha _{1}...\forall \alpha _{n}.\tau )}{\forall \alpha _{1}...\forall \alpha _{n}.\tau \sqsubseteq \forall \beta _{1}...\forall \beta _{m}.\tau '}}$

Now focusing only on the question whether a type is more special than another and no longer what the specialized type is used for, one could summarize the specialization as in the box above. Paraphrasing it clockwise, a type $\forall \alpha _{1}\dots \forall \alpha _{n}.\tau$ is specialized by consistently replacing any of the quantified variables $\alpha _{i}$ by arbitrary monotypes $\tau _{i}$ gaining a monotype $\tau '$ . Finally, type variables in $\tau '$ not occurring free in the pristine type can optionally be quantified.

Thus the specialization rules makes sure that no free variable, i.e. monotype in the pristine type becomes unintentionally bound by a quantifier, but originally quantified variable can be replaced with whatever, even with types introducing new quantified or unquantified type variables.

Starting with a polytype $\forall \alpha .\alpha$ , the specialization could either replace the body by another quantified variable, actually a rename or by some type constant (including the function type) which may or may not have parameters filled either with monotypes or quantified type variables. Once a quantified variable is replaced by a type application, this specialization cannot be undone through another substitution as it was possible for quantified variables. Thus the type application is there to stay. Only if it contains another quantified type variable, the specialization could continue further replacing for it.

So the specialization introduces no further equivalence on polytype beside the already known renaming. Polytypes are syntactically equal up to renaming their quantified variables. The equality of types is a reflexive, antisymmetric and transitive relation and the remaining specializations of polytypes are transitive and with this the relation $\sqsubseteq$ is an order.

Deductive system

The Syntax of Rules
${\begin{array}{lrl}{\text{Predicate}}&=&\sigma \sqsubseteq \sigma '\\&\vert \ &\alpha \not \in free(\Gamma )\\&\vert \ &x:\alpha \in \Gamma \\\\{\text{Judgment}}&=&{\text{Typing}}\\{\text{Premise}}&=&{\text{Judgment}}\ \vert \ {\text{Predicate}}\\{\text{Conclusion}}&=&{\text{Judgment}}\\\\{\text{Rule}}&=&\displaystyle {\frac {{\textrm {Premise}}\ \dots }{\textrm {Conclusion}}}\quad [{\mathtt {Name}}]\end{array}}$

The syntax of HM is carried forward to the syntax of the inference rules that form the body of the formal system, by using the typings as judgments. Each of the rules define what conclusion could be drawn from what premises. Additionally to the judgments, some extra conditions introduced above might be used as premises, too.

A proof using the rules is a sequence of judgments such that all premises are listed before a conclusion. Please see the Examples 2 and 3 below for a possible format of proofs. From left to right, each line shows the conclusion, the $[{\mathtt {Name}}]$ of the rule applied and the premises, either by referring to an earlier line (number) if the premise is a judgment or by making the predicate explicit.

Typing rules

Principal type

As mentioned in the introduction, the rules allow one to deduce different types for one and the same expression. See for instance, Example 2, steps 1,2 and Example 3, steps 2,3 for three different typings of the same expression. Clearly, the different results are not fully unrelated, but connected by the type order. It is an important property of the rule system and this order that whenever more than one type can be deduced for an expression, among them is (modulo alpha-renaming of the type variables) a unique most general type in the sense, that all others are specialization of it. Though the rule system must allow to derive specialized types, a type inference algorithm should deliver this most general or principal type as its result.

Let-polymorphism

Not visible immediately, the rule set encodes a regulation under which circumstances a type might be generalized or not by a slightly varying use of mono- and polytypes in the rules $[{\mathtt {Abs}}]$ and $[{\mathtt {Let}}]$ .

In rule $[{\mathtt {Abs}}]$ , the value variable of the parameter of the function $\lambda x.e$ is added to the context with a monomorphic type through the premise $\Gamma ,\ x:\tau \vdash _{D}e:\tau '$ , while in the rule $[{\mathtt {Let}}]$ , the variable enters the environment in polymorphic form $\Gamma ,\ x:\sigma \vdash _{D}e_{1}:\tau$ . Though in both cases the presence of $x$ in the context prevents the use of the generalisation rule for any monotype variable in the assignment. This regulation forces the parameter $x$ in a $\lambda$ -expression to remain monomorphic, while in a let-expression, the variable could already be introduced polymorphic, making specializations possible.

As a consequence of this regulation, no type can be inferred for $\lambda f.(f\,{\textrm {true}},f\,{\textrm {0}})$ since the parameter $f$ is in a monomorphic position, while ${\textbf {let}}\ f=\lambda x.x\,{\textbf {in}}\,(f\,{\textrm {true}},f\,{\textrm {0}})$ yields a type $(bool,int)$ , because $f$ has been introduced in a let-expression and is treated polymorphic therefore. Note that this behaviour is in strong contrast to the usual definition ${\textbf {let}}\ x=e_{1}\ {\textbf {in}}\ e_{2}\ ::=(\lambda \ x.e_{2})\ e_{1}$ and the reason why the let-expression appears in the syntax at all. This distinction is called let-polymorphism or let generalization and is a conception owed to HM.

Towards an algorithm

Now that the deduction system of HM is at hand, one could present an algorithm and validate it with respect to the rules. Alternatively, it might be possible to derive it by taking a closer look on how the rules interact and proof are formed. This is done in the remainder of this article focusing on the possible decisions one can make while proving a typing.

Degrees of freedom choosing the rules

Isolating the points in a proof, where no decision is possible at all, the first group of rules centered around the syntax leaves no choice since to each syntactical rule corresponds a unique typing rule, which determines a part of the proof, while between the conclusion and the premises of these fixed parts chains of $[{\mathtt {Inst}}]$ and $[{\mathtt {Gen}}]$ could occur. Such a chain could also exist between the conclusion of the proof and the rule for topmost expression. All proofs must have the so sketched shape.

Because the only choice in a proof with respect of rule selection are the $[{\mathtt {Inst}}]$ and $[{\mathtt {Gen}}]$ chains, the form of the proof suggests the question whether it can be made more precise, where these chains might be needed. This is in fact possible and leads to a variant of the rules system with no such rules.

Syntax-directed rule system

Syntactical Rule System
${\begin{array}{cl}\displaystyle {\frac {x:\sigma \in \Gamma \quad \sigma \sqsubseteq \tau }{\Gamma \vdash _{S}x:\tau }}&[{\mathtt {Var}}]\\\\\displaystyle {\frac {\Gamma \vdash _{S}e_{0}:\tau \rightarrow \tau '\quad \quad \Gamma \vdash _{S}e_{1}:\tau }{\Gamma \vdash _{S}e_{0}\ e_{1}:\tau '}}&[{\mathtt {App}}]\\\\\displaystyle {\frac {\Gamma ,\;x:\tau \vdash _{S}e:\tau '}{\Gamma \vdash _{S}\lambda \ x\ .\ e:\tau \rightarrow \tau '}}&[{\mathtt {Abs}}]\\\\\displaystyle {\frac {\Gamma \vdash _{S}e_{0}:\tau \quad \quad \Gamma ,\,x:{\bar {\Gamma }}(\tau )\vdash _{S}e_{1}:\tau '}{\Gamma \vdash _{S}{\mathtt {let}}\ x=e_{0}\ {\mathtt {in}}\ e_{1}:\tau '}}&[{\mathtt {Let}}]\end{array}}$
Generalization
${\bar {\Gamma }}(\tau )=\forall \ {\hat {\alpha }}\ .\ \tau \quad \quad {\hat {\alpha }}={\textrm {free}}(\tau )-{\textrm {free}}(\Gamma )$

A contemporary treatment of HM uses a purely syntax-directed rule system due to Clement^[5] as an intermediate step. In this system, the specialization is located directly after the original $[{\mathtt {Var}}]$ rule and merged into it, while the generalization becomes part of the $[{\mathtt {Let}}]$ rule. There the generalization is also determined to always produce the most general type by introducing the function ${\bar {\Gamma }}(\tau )$ , which quantifies all monotype variables not bound in $\Gamma$ .

Formally, to validate, that this new rule system $\vdash _{S}$ is equivalent to the original $\vdash _{D}$ , one has to show that $\Gamma \vdash _{D}\ e:\sigma \Leftrightarrow \Gamma \vdash _{S}\ e:\sigma$ , which falls apart into two sub-proofs:

$\Gamma \vdash _{D}\ e:\sigma \Leftarrow \Gamma \vdash _{S}\ e:\sigma$ (Consistency)
$\Gamma \vdash _{D}\ e:\sigma \Rightarrow \Gamma \vdash _{S}\ e:\sigma$ (Completeness)

While consistency can be seen by decomposing the rules $[{\mathtt {Let}}]$ and $[{\mathtt {Var}}]$ of $\vdash _{S}$ into proofs in $\vdash _{D}$ , it is likely visible that $\vdash _{S}$ is incomplete, as one cannot show $\lambda \ x.x:\forall \alpha .\alpha \rightarrow \alpha$ in $\vdash _{S}$ , for instance, but only $\lambda \ x.x:\alpha \rightarrow \alpha$ . An only slightly weaker version of completeness is provable ^[6] though, namely

$\Gamma \vdash _{D}\ e:\sigma \Rightarrow \Gamma \vdash _{S}\ e:\tau \wedge {\bar {\Gamma }}(\tau )\sqsubseteq \sigma$

implying, one can derive the principal type for an expression in $\vdash _{S}$ allowing to generalize the proof in the end.

Comparing $\vdash _{D}$ and $\vdash _{S}$ note that only monotypes appear in the judgments of all rules, now.

Degrees of freedom instantiating the rules

Within the rules themselves, assuming a given expression, one is free to pick the instances for (rule) variables not occurring in this expression. These are the instances for the type variable in the rules. Working towards finding the most general type, this choice can be limited to picking suitable types for $\tau$ in $[{\mathtt {Var}}]$ and $[{\mathtt {Abs}}]$ . The decision of a suitable choice cannot be made locally, but its quality becomes apparent in the premises of $[{\mathtt {App}}]$ , the only rule, in which two different types, namely the function's formal and actual parameter type have to come together as one.

Therefore, the general strategy for finding a proof would be to make the most general assumption ( $\alpha \not \in free(\Gamma )$ ) for $\tau$ in $[{\mathtt {Abs}}]$ and to refine this and the choice to be made in $[{\mathtt {Var}}]$ until all side conditions imposed by the $[{\mathtt {App}}]$ rules are finally met. Fortunately, no trial and error is needed, since an effective method is known to compute all the choices, Robinson's Unification in combination with the so-called Union-Find algorithm.

To briefly summarize the union-find algorithm, given the set of all types in a proof, it allows one to group them together into equivalence classes by means of a ${\mathtt {union}}$ procedure and to pick a representative for each such class using a ${\mathtt {find}}$ procedure. Emphasizing on the word procedure in the sense of side effect, we're clearly leaving the realm of logic to prepare an effective algorithm. The representative of a ${\mathtt {union}}(a,b)$ is determined such, that if both $a$ and $b$ are type variables the representative is arbitrarily one of them, while uniting a variable and a term, the term becomes the representative. Assuming an implementation of union-find at hand, one can formulate the unification of two monotypes as follows:

unify(ta,tb):
  ta = find(ta)
  tb = find(tb)
  if both ta,tb are terms of the form D p1..pn with identical D,n then
    unify(ta[i],tb[i]) for each corresponding ith parameter
  else
  if at least one of ta,tb is a type variable then
    union(ta,tb)
  else
    error 'types do not match'

Algorithm W

Algorithm W
${\begin{array}{cl}\displaystyle {\frac {x:\sigma \in \Gamma \quad \tau ={\mathit {inst}}(\sigma )}{\Gamma \vdash _{W}x:\tau }}&[{\mathtt {Var}}]\\\\\displaystyle {\frac {\Gamma \vdash _{W}e_{0}:\tau _{0}\quad \Gamma \vdash _{W}e_{1}:\tau _{1}\quad \tau '={\mathit {newvar}}\quad {\mathit {unify}}(\tau _{0},\ \tau _{1}\rightarrow \tau ')}{\Gamma \vdash _{W}e_{0}\ e_{1}:\tau '}}&[{\mathtt {App}}]\\\\\displaystyle {\frac {\tau ={\mathit {newvar}}\quad \Gamma ,\;x:\tau \vdash _{W}e:\tau '}{\Gamma \vdash _{W}\lambda \ x\ .\ e:\tau \rightarrow \tau '}}&[{\mathtt {Abs}}]\\\\\displaystyle {\frac {\Gamma \vdash _{W}e_{0}:\tau \quad \quad \Gamma ,\,x:{\bar {\Gamma }}(\tau )\vdash _{W}e_{1}:\tau '}{\Gamma \vdash _{W}{\mathtt {let}}\ x=e_{0}\ {\mathtt {in}}\ e_{1}:\tau '}}&[{\mathtt {Let}}]\end{array}}$

The presentation of Algorithm W as shown in the side box does not only deviate significantly from the original^[4] but is also a gross abuse of the notation of logical rules, since it includes side effects. It is legitimized here, for allowing a direct comparison with $\vdash _{S}$ while expressing an efficient implementation at the same time. The rules now specify a procedure with parameters $\Gamma ,e$ yielding $\tau$ in the conclusion where the execution of the premises proceeds from left to right. Alternatively to a procedure, it could be viewed as an attributation of the expression.

The procedure $inst(\sigma )$ specializes the polytype $\sigma$ by copying the term and replacing the bound type variables consistently by new monotype variables. ' $newvar$ ' produces a new monotype variable. Likely, ${\bar {\Gamma }}(\tau )$ has to copy the type introducing new variables for the quantification to avoid unwanted captures. Overall, the algorithm now proceeds by always making the most general choice leaving the specialization to the unification, which by itself produces the most general result. As noted above, the final result $\tau$ has to be generalized to ${\bar {\Gamma }}(\tau )$ in the end, to gain the most general type for a given expression.

Because the procedures used in the algorithm have nearly O(1) cost, the overall cost of the algorithm is close to linear in the size of the expression for which a type is to be inferred. This is in strong contrast to many other attempts to derive type inference algorithms, which often came out to be NP-hard, if not undecidable with respect to termination. Thus the HM performs as well as the best fully informed type-checking algorithms can. Type-checking here means that an algorithm does not have to find a proof, but only to validate a given one.

Efficiency is slightly reduced because the binding of type variables in the context has to be maintained to allow computation of ${\bar {\Gamma }}(\tau )$ and enable an occurs check to prevent the building of recursive types during $union(\alpha ,\tau )$ . An example of such a case is $\lambda \ x.(x\ x)$ , for which no type can be derived using HM. Practically, types are only small terms and do not build up expanding structures. Thus, in complexity analysis, one can treat comparing them as a constant, retaining O(1) costs.

Original presentation of Algorithm W

In the original paper,^[4] the algorithm is presented more formally using a substitution style instead of side effects in the method above. In the latter form, the side effect invisibly takes care of all places where a type variable is used. Explicitly using substitutions not only makes the algorithm hard to read, because the side effect occurs virtually everywhere, but also gives the false impression that the method might be costly. When implemented using purely functional means or for the purpose of proving the algorithm to be basically equivalent to the deduction system, full explicitness is of course needed and the original formulation a necessary refinement.

Further topics

Recursive definitions

A central property of the lambda calculus is, that recursive definitions are non-elemental, but can instead be expressed by a fixed point combinator. The original paper^[4] notes that recursion can realized by this combinator's type ${\mathit {fix}}:\forall \alpha .(\alpha \rightarrow \alpha )\rightarrow \alpha$ . A possible recursive definitions could thus be formulated as ${\mathtt {rec}}\ v=e_{1}\ {\mathtt {in}}\ e_{2}\ ::={\mathtt {let}}\ v={\mathit {fix}}(\lambda v.e_{1})\ {\mathtt {in}}\ e_{2}$ .

Alternatively an extension of the expression syntax and an extra typing rule is possible as:

\displaystyle {\frac {\Gamma ,\Gamma '\vdash e_{1}:\tau _{1}\quad \dots \quad \Gamma ,\Gamma '\vdash e_{n}:\tau _{n}\quad \Gamma ,\Gamma ''\vdash e:\tau }{\Gamma \ \vdash \ {\mathtt {rec}}\ v_{1}=e_{1}\ {\mathtt {and}}\ \dots \ {\mathtt {and}}\ v_{n}=e_{n}\ {\mathtt {in}}\ e:\tau }}\quad [{\mathtt {Rec}}]

where

$\Gamma '=v_{1}:\tau _{1},\ \dots ,\ v_{n}:\tau _{n}$
$\Gamma ''=v_{1}:{\bar {\Gamma }}(\ \tau _{1}\ ),\ \dots ,\ v_{n}:{\bar {\Gamma }}(\ \tau _{n}\ )$

basically merging $[{\mathtt {Abs}}]$ and $[{\mathtt {Let}}]$ while including the recursively defined variables in monotype positions where they occur left to the ${\mathtt {in}}$ but as polytypes right to it. This formulation perhaps best summarizes the essence of let-polymorphism.

Notes

↑ Hindley–Milner is DEXPTIME-complete. However, non-linear behaviour only manifests itself on pathological inputs, as such the complexity theoretic proofs by (Mairson 1990) and (Kfoury, Tiuryn & Urzyczyn 1990) came as a surprise to the research community. When the depth of nested let-bindings is bounded—as is the case in realistic programs—Hindley–Milner type inference becomes polynomial.
↑ Polytypes are called "type schemes" in the original article.
↑ The parametric types $D\ \tau \dots \tau$ were not present in the original paper on HM and are not needed to present the method. None of the inference rules below will take care or even note them. The same holds for the non-parametric "primitive types" in said paper. All the machinery for polymorphic type inference can be defined without them. They have been included here for sake of examples but also because the nature of HM is all about parametric types. This comes from the function type $\tau \rightarrow \tau$ , hard-wired in the inference rules, below, which already has two parameters and has been presented here as only a special case.

References

↑ Hindley, J. Roger (1969). "The Principal Type-Scheme of an Object in Combinatory Logic". Transactions of the American Mathematical Society. 146: 29–60. doi:10.2307/1995158. JSTOR 1995158.
↑ Milner, Robin (1978). "A Theory of Type Polymorphism in Programming". Journal of Computer and System Science (JCSS). 17: 348–374. CiteSeerX 10.1.1.67.5276. doi:10.1016/0022-0000(78)90014-4.
↑ Damas, Luis (1985). Type Assignment in Programming Languages (PhD thesis). University of Edinburgh (CST-33-85).
1 2 3 4 5 Damas, Luis; Milner, Robin (1982). Principal type-schemes for functional programs (PDF). 9th Symposium on Principles of programming languages (POPL'82). ACM. pp. 207–212.
↑ Clement (1986). A Simple Applicative Language: Mini-ML. LFP'86. ACM.
↑ Vaughan, Jeff (July 23, 2008) [May 5, 2005]. "A proof of correctness for the Hindley–Milner type inference algorithm" (PDF). Archived from the original (PDF) on 2012-03-24.

Mairson, Harry G. (1990). "Deciding ML typability is complete for deterministic exponential time". Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL '90. ACM: 382–401. doi:10.1145/96709.96748. ISBN 0-89791-343-4.
Kfoury, A. J.; Tiuryn, J.; Urzyczyn, P. (1990). "ML typability is dexptime-complete". Lecture Notes in Computer Science. CAAP '90. 431: 206–220. doi:10.1007/3-540-52590-4_50.

External links

A literate Haskell implementation of Algorithm W along with its source code on GitHub.

This article is issued from Wikipedia - version of the 11/15/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.