Results 1 
3 of
3
Finally Tagless, Partially Evaluated  Tagless Staged Interpreters for Simpler Typed Languages
 UNDER CONSIDERATION FOR PUBLICATION IN J. FUNCTIONAL PROGRAMMING
"... We have built the first family of tagless interpretations for a higherorder 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 typepreserving interpretations include an ..."
Abstract

Cited by 53 (9 self)
 Add to MetaCart
(Show Context)
We have built the first family of tagless interpretations for a higherorder 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 typepreserving interpretations include an evaluator, a compiler (or staged evaluator), a partial evaluator, and callbyname and callbyvalue CPS transformers. Our principal technique is to encode de Bruijn or higherorder 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 higherkinded types.
From Settheoretic Coinduction to Coalgebraic Coinduction: some results, some problems
, 1999
"... ..."
(Show Context)
Coalgebraic Coinduction in (Hyper)settheoretic Categories
, 2000
"... This paper is a contribution to the foundations of coinductive types and coiterative functions, in (Hyper)settheoretical Categories, in terms of coalgebras. We consider atoms as first class citizens. First of all, we give a sharpening, in the way of cardinality, of Aczel's Special Final Coalg ..."
Abstract
 Add to MetaCart
This paper is a contribution to the foundations of coinductive types and coiterative functions, in (Hyper)settheoretical Categories, in terms of coalgebras. We consider atoms as first class citizens. First of all, we give a sharpening, in the way of cardinality, of Aczel's Special Final Coalgebra Theorem, which allows for good estimates of the cardinality of the final coalgebra. To these end, we introduce the notion of Y uniform functor, which subsumes Aczel's original notion. We give also an nary version of it, and we show that the resulting class of functors is closed under many interesting operations used in Final Semantics. We define also canonical wellfounded versions of the final coalgebras of functors uniform on maps. This leads to a reduction of coiteration to ordinal induction, giving a possible answer to a question raised by Moss and Danner. Finally, we introduce a generalization of the notion of Fbisimulation inspired by Aczel's notion of precongruence, and we show t...