Philip Wadler

The great type hope

Philip Wadler. The Great Type Hope. Presented at Erlang Workshop (colocated with ICFP 2002) Pittsburgh, 7 October 2002 (invited talk).

This talk explains the relation between logic and typed lambda calculus, and reviews the paper cited below from a perspective of five years later.

Available in: pdf.

A practical subtyping system for Erlang

Simon Marlow and Philip Wadler. 2nd International Conference on Functional Programming, Amsterdam, June 1997.

We present a type system for the programming language Erlang. The type system supports subtyping and declaration-free recursive types, using subtyping constraints. Our system is similar to one explored by Aiken and Wimmers, though it sacrifices expressive power in favor of simplicity. We cover our techniques for type inference, type simplification, and checking when an inferred type conforms to a user-supplied type signature, and report on early experience with our prototype.

Available in: pdf, dvi, ps, dvi.gz, ps.gz.

Also see the Erlang home page.
Philip Wadler,