Abstract

As a functional pearl, we describe an efficient, modularized implementation of unification using the state of mutable reference cells to encode substitutions. We abstract our algorithms along two dimensions, first abstracting away from the structure of the terms to be unified, and second over the monad in which the mutable state is encapsulated. We choose this example to illustrate two important techniques that we believe many functional programmers would find useful. The first of these is the definition of recursive data types using two levels: a structure defining level, and a recursive knot-tying level. The second is the use of rank-2 polymorphism inside Haskell’s record types to implement a form of type parameterized modules.

Citations

251	A type-theoretic approach to higher-order modules - Harper, Lillibridge - 1994
161	PolyP—A polytypic programming language extension - Jansson, Jeuring - 1997
86	Polytypic programming - Jeuring, Jansson - 1996
84	A new approach to generic functional programming - Hinze - 2000
73	Basic polymorphic typechecking - Cardelli - 1987
63	Using parameterized signatures to express modular structure - Jones - 1996
49	Typing Haskell in Haskell - Jones - 1999
13	Memo functions, polytypically - Hinze - 2000
13	Functional pearl: Polytypic unification - Jansson, Jeuring - 1998
1	Lazyfunctional state threads - Peyton-Jones - 1994