The Hindley Milner Type Inference Algorithm
OCaml CSS HTML Other
Latest commit 1b31cc9 Dec 10, 2016 @prakhar1989 committed on GitHub Create master branch via GitHub
Failed to load latest commit information.
images Create master branch via GitHub Dec 11, 2016
javascripts Create master branch via GitHub Dec 11, 2016
stylesheets Create master branch via GitHub Dec 11, 2016
.gitignore added alcotest for running tests Apr 21, 2016
.travis.yml final fixes Apr 21, 2016
Makefile updated readme, gone back to use ocamlyacc Apr 21, 2016 added screencast Apr 27, 2016 string_of_type now print generic types in alpha order. fixes #2 Apr 21, 2016
parser.mly completed inference for function appl. lambda calc done 🤘 Apr 21, 2016
scanner.mll added comments in lexer Apr 27, 2016 finished the test suite Apr 21, 2016

Hindley Milner Type Inference

Build Status

The Hindley Milner Type Inference or Algorithm W is a type-inference algorithm that infers types in a programming language.

This repository contains a working implementation written in OCaml to demonstrate type-inference on a small functional language.



The language that this implementation works on is a small subset called the lambda calculus. In essence, the lambda calculus allows one to express any computation purely in terms of anonymous functions and application of these functions.

> (fun x -> x * x)          (* function declaration *)
> (fun x -> x * x) 10       (* function application *)

In pure lambda calculus, numerals and booleans are also expressed in terms of functions but to make it easy, the language supports integer and boolean literals, alongwith binary operations such as addition, multiplication, boolean and etc.


Before we jump on to the type-inference algorithm, we need to define the types in our language. There are three primitive types that our language supports -

  • int: An integer type for integer literals. Binary operations such as + and *, work only on integers and return an integer type.
  • bool: Our language has boolean literals true and false, both of which have a bool type. To operate on bools && and || are provided. Lastly, two additional operators > and < work on any type, but return a bool type.
  • T -> U: The function type where the T is the type of the input and U is the return type of the function. So for example, a square function above has a type int -> int.


The project ships with an interactive Read-Eval-Print-Loop (REPL) that you can use to play with the algorithm. To build the REPL, you need OCaml installed.

If you prefer Docker, there's an image that you can use to try out the REPL. Simply run

$ docker run -w /home/opam/type-inference -it prakhar1989/type-infer /bin/bash

Compile the REPL with make and if all goes well, you should be good to go.

$ ./repl

Welcome to the REPL.
Type in expressions and let Hindley-Milner Type Inference run its magic.

Out of ideas? Try out a simple lambda expression: (fun x -> x + 10)

> 10 + 20 > 40
> (fun x -> (x && true) || false)
(bool -> bool)
> (fun x -> x + 10) 20
> (fun f -> f 3)
((int -> 'a) -> 'a)
>  (fun f -> (fun g -> (fun x -> f (g x))))
(('a -> 'b) -> (('c -> 'a) -> ('c -> 'b)))


To run the tests, you need Alcotest package installed. Install it by running opam install alcotest.

$ make test


Huge thanks to these lecture notes for providing an understandable breakdown of the algorithm.