Finally Tagless, Partially Evaluated

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 CPS transformers. cipal 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 transformaur 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 demons...

• Type: Conference
• Year: 2007
• Where: APLAS
• Authors: Jacques Carette, Oleg Kiselyov, Chung-chieh Shan
• Keywords: APLAS 2007, Call-by-value Cps Transformers, Generalized Algebraic Data Types, Object Term, Programming Languages