Journal of Functional Programming

Articles

Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages

JACQUES CARETTEa1, OLEG KISELYOVa2 and CHUNG-CHIEH SHANa3

a1 McMaster University (e-mail: carette@mcmaster.ca)

a2 FNMOC (e-mail: oleg@pobox.org)

a3 Rutgers University (e-mail: ccshan@rutgers.edu)

Abstract

We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, generalized algebraic data types, or postprocessing to eliminate tags. The statically type-preserving interpretations include an evaluator, a compiler (or staged evaluator), a partial evaluator, and call-by-name and call-by-value continuation-passing style (CPS) transformers. Our principal technique is to encode de Bruijn or higher-order abstract syntax using combinator functions rather than data constructors. In other words, we represent object terms not in an initial algebra but using the coalgebraic structure of the λ-calculus. Our representation also simulates inductive maps from types to types, which are required for typed partial evaluation and CPS transformations. Our encoding of an object term abstracts uniformly over the family of ways to interpret it, yet statically assures that the interpreters never get stuck. This family of interpreters thus demonstrates again that it is useful to abstract over higher-kinded types.

(Online publication April 15 2009)