Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC

Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC (1994)

Cached

Download Links

[www-sop.inria.fr]

Other Repositories/Bibliography

DBLP

by Morten Heine Sørensen , Robert Glück , Neil D. Jones

Citations:

22 - 0 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC	user correction - Legacy Corrections
AUTHOR NAME	Morten Heine Sørensen	user correction - Legacy Corrections
AUTHOR AFFIL	DIKU, Department of Computer Science, University of	user correction - Legacy Corrections
AUTHOR ADDR	Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark, E-mail:	user correction - Legacy Corrections
AUTHOR NAME	Robert Glück	user correction - Legacy Corrections
AUTHOR AFFIL	DIKU, Department of Computer Science, University of	user correction - Legacy Corrections
AUTHOR ADDR	Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark, E-mail:	user correction - Legacy Corrections
AUTHOR NAME	Neil D. Jones	user correction - Legacy Corrections
AUTHOR AFFIL	DIKU, Department of Computer Science, University of	user correction - Legacy Corrections
AUTHOR ADDR	Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark, E-mail:	user correction - Legacy Corrections
ABSTRACT	We study four transformation methodologies which are automatic instances of Burstall and Darlington's fold/unfold framework: partial evaluation, deforestation, supercompilation, and generalized partial computation (GPC). One can classify these and other fold/unfold based transformers by how much information they maintain during transformation. We introduce the positive supercompiler, a version of deforestation including more information propagation, to study such a classification in detail. Via the study of positive supercompilation we are able to show that partial evaluation and deforestation have simple information propagation, positive supercompilation has more information propagation, and supercompilation and GPC have even more information propagation. The amount of information propagation is significant: positive supercompilation, GPC, and supercompilation can specialize a general pattern matcher to a fixed pattern so as to obtain efficient output similar to that of the Knuth-Morris-Pratt algorithm. In the case of partial evaluation and deforestation, the general matcher must be rewritten to achieve this.	user correction - Legacy Corrections
YEAR	1994	user correction - Legacy Corrections
CITATIONS	23 found	ParsCit 1.0