DMCA
Finally Tagless, Partially Evaluated -- Tagless Staged Interpreters for Simpler Typed Languages
Cached
Download Links
| Venue: | UNDER CONSIDERATION FOR PUBLICATION IN J. FUNCTIONAL PROGRAMMING |
| Citations: | 53 - 9 self |
BibTeX
@MISC{Carette_finallytagless,,
author = {Jacques Carette and Oleg Kiselyov and Chung-chieh Shan},
title = {Finally Tagless, Partially Evaluated -- Tagless Staged Interpreters for Simpler Typed Languages},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
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 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.
Keyphrases
simpler typed language partially evaluated tagless principal technique dependent type object term partial evaluator typed metalanguage initial algebra typed partial evaluation tagless interpretation inductive map data constructor higher-order typed object language higher-kinded type call-by-value cps transformer type-preserving interpretation object term abstract cps transformation algebraic data type combinator function higher-order abstract syntax first family coalgebraic structure
