Abstract

Abstract. Type-directed partial evaluation stems from the residualization of arbitrary static values in dynamic contexts, given their type. Its algorithm coincides with the one for coercing asubtype value into a supertype value, which itself coincides with the one of normalization in the-calculus. Type-directed partial evaluation is thus used to specialize compiled, closed programs, given their type. Since Similix, let-insertion is a cornerstone of partial evaluators for callby-value procedural programs with computational e ects. It prevents the duplication of residual computations, and more generally maintains the order of dynamic side e ects in residual programs. This article describes the extension of type-directed partial evaluation to insert residual let expressions. This extension requires the userto annotate arrowtypes with e ect information. It is achieved by delimiting and abstracting control, comparably to continuation-based specialization in direct style. It enables type-directed partial evaluation of e ectful programs (e.g.,ade nitional lambda-interpreter for an imperative language) that are in direct style. The residual programs are in A-normal form. 1

Citations

593	Partial Evaluation and Automatic Program Generation - Jones, Gomard, et al. - 1993
230	Tutorial notes on partial evaluation - Consel, Danvy - 1993
172	Logic programming in the LF logical framework - Pfenning - 1991
133	Hygienic Macro Expansion - Kohlbecker, Friedman, et al. - 1986
114	Automatic autoprojection of recursive equations with global variables and abstract data types, Science of Computer Programming 16 - Bondorf, Danvy - 1991
101	Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation - Olivier - 1992
87	Automatic online partial evaluation - Weise, Conybeare, et al. - 1991
54	Program extraction from normalization proofs - Berger - 1993
50	An inverse of the evaluation functional for typed -calculus - Berger, Schwichtenberg - 1991
49	Dybvig. The Scheme Programming Language - Kent - 1987
47	Compiling scientific code using partial evaluation - Berlin, Weise - 1990
47	Static and dynamic semantics processing - Consel, Danvy - 1991
45	Partially static structures in a self-applicable partial evaluator - Mogensen - 1988
40	Partial evaluation applied to numerical computation - Berlin - 1990
34	New insights into partial evaluation: The Schism experiment - Consel - 1988
32	The essence of eta-expansion in partial evaluation - Danvy, r, et al. - 1995
29	From Semantics to Rules: A Machine Assisted Analysis - Coquand - 1993
28	Syntactic Extensions in the Programming Language Lisp - Kohlbecker - 1986
21	Categorical reconstruction of a reduction-free normalization proof - Altenkirch, Hofmann, et al. - 1995
21	Semantics-based compiling: A case study in type-directed partial evaluation - Danvy, Vestergaard - 1996
20	Normalization and the Yoneda embedding - Čubrić, Dybjer, et al. - 1998
20	Action Semantics, volume 26 of Cambridge Tracts - Mosses - 1992
17	A compilation strategy for numerical programs based on partial evaluation. Master 's thesis - Berlin - 1989
13	on-line partial evaluator for a polymorphic language - Sheard - 1997
11	Similix manual, system version 3.0 - Bondorf - 1991
7	From proof normalization to compiler generation and type-directed change-of-representation - Vestergaard - 1997
5	Automatic Program Specialization for Interactive Media - Draves - 1997
5	Recursive Application Survival in the -Calculus - Goldberg - 1995
4	Strong normalization by run-time code generation - Balat, Danvy - 1997
3	Compilation as Partial Evaluation of Functor Category Semantics. Unpublished manuscript - Harrison, Kamin - 1997
3	A study in higher-order programming languages. Master 's thesis - Rhiger - 1997
2	Reduction- free normalisation for a polymorphic system - Altenkirch, Hofmann, et al. - 1996
2	Compiling actions by type-directed partial evaluation - Danvy, Rhiger - 1997
2	Type specialisation for the lambda calculus - Hughes - 1996