Add to ORKGType-directed partial evaluation was originally implemented in Scheme, a dynamically typed language. It has also been implemented in ML, a statically Hindley-Milner typed lan-guage. This note shows how the latter implementation can be derived from the former through a functional representa-tion of inductively dened types.
97 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003.For larger languages, this tec...
AbstractAs a partial solution to the problem of combining static and dynamic typing in a language wi...
As a partial solution to the problem of combining static and dynamic typing in a language with param...
We present a strikingly simple partial evaluator, that is typedirected and reifies a compiled progra...
This article presents an alternative method of type-directed partial evaluation, which is simpler an...
. We formally characterize partial evaluation of functional programs as a normalization problem in a...
l handled by -abstracting them from the original term (using an explicit Y-combinator for recursion)...
Type-directed partial evaluation stems from the residualization of static values in dynamic contexts...
We present an offline partial evaluator for a higher-order subset of ML with reference types. Its no...
Introduction This paper gives a brief introduction to partial evaluation of typed functional languag...
We present an implementation in the Coq proof assistant of type directed partial evaluation (TDPE) a...
We describe the design and implementation of an off-line partial evaluator for Standard ML programs....
We give an introduction to normalization by evaluation and type-directed partial evaluation. We firs...
Partial evaluation is a powerful automated strategy for transforming programs, some of whose inputs ...
The essence of partial evaluation is beautifully simple: we just take a program, together with value...
97 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003.For larger languages, this tec...
AbstractAs a partial solution to the problem of combining static and dynamic typing in a language wi...
As a partial solution to the problem of combining static and dynamic typing in a language with param...
We present a strikingly simple partial evaluator, that is typedirected and reifies a compiled progra...
This article presents an alternative method of type-directed partial evaluation, which is simpler an...
. We formally characterize partial evaluation of functional programs as a normalization problem in a...
l handled by -abstracting them from the original term (using an explicit Y-combinator for recursion)...
Type-directed partial evaluation stems from the residualization of static values in dynamic contexts...
We present an offline partial evaluator for a higher-order subset of ML with reference types. Its no...
Introduction This paper gives a brief introduction to partial evaluation of typed functional languag...
We present an implementation in the Coq proof assistant of type directed partial evaluation (TDPE) a...
We describe the design and implementation of an off-line partial evaluator for Standard ML programs....
We give an introduction to normalization by evaluation and type-directed partial evaluation. We firs...
Partial evaluation is a powerful automated strategy for transforming programs, some of whose inputs ...
The essence of partial evaluation is beautifully simple: we just take a program, together with value...
97 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003.For larger languages, this tec...
AbstractAs a partial solution to the problem of combining static and dynamic typing in a language wi...
As a partial solution to the problem of combining static and dynamic typing in a language with param...