The essence of eta-expansion in partial evaluation

The essence of eta-expansion in partial evaluation (1995)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Olivier Danvy , Karoline Malmkjaer , Jens Palsberg

Venue:	LISP AND SYMBOLIC COMPUTATION
Citations:	32 - 11 self

Versions

Version History

Metadata Version 2

User correction supplied by mph

Datum	Value	Source
TITLE	The essence of eta-expansion in partial evaluation	INFERENCE
AUTHOR NAME	Olivier Danvy	user correction
AUTHOR AFFIL	Aarhus University	user correction
AUTHOR NAME	Karoline Malmkjaer	user correction
AUTHOR AFFIL	Aarhus University	user correction
AUTHOR NAME	Jens Palsberg	user correction
AUTHOR AFFIL	Northeastern University	user correction
ABSTRACT	Selective eta-expansion is a powerful "binding-time improvement", i.e., a source-program modification that makes a partial evaluator yield better results. But like most binding-time improvements, the exact problem it solves and the reason why have not been formalized and are only understood by few. In this paper, we describe the problem and the effect of eta-redexes in terms of monovariant binding-time propagation: eta-redexes preserve the static data ow of a source program by interfacing static higher-order values in dynamic contexts and dynamic higher-order values in static contexts. They contribute to two distinct binding-time improvements. We present two extensions of Gomard's monovariant binding-time analysis for the pure-calculus. Our extensions annotate and eta-expand-terms. The rst one eta-expands static higher-order values in dynamic contexts. The second also eta-expands dynamic higher-order values in static contexts. As a significant application, we show that our first binding-time analysis suffices to reformulate the traditional formulation of a CPS transformation into a modern onepass CPS transformer. This binding-time improvement is known, but it is still left unexplained in contemporary literature, e.g., about "cps-based" partial evaluation. We also outline the counterpart of eta-expansion for partially static data structures.	user correction
YEAR	1995	INFERENCE
VENUE	LISP AND SYMBOLIC COMPUTATION	user correction
VENUE TYPE	CONFERENCE	INFERENCE
VOLUME	8	INFERENCE
CITATIONS	27 found	ParsCit 1.0