Extending the power of automatic constraint-based partial evaluators L. Lafave and J. P. Gallagher ACM Computing Surveys, Vol. 30, No. 3es, September 1998 Article 15 Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Copyright 1998 ACM 0360-0300/98/03es- . . . $5.00 Extending the Power of Automatic Constraint-based Partial Evaluators L. Lafave and J.P. Gallagher University of Bristol, UK In the control of automatic program specialisers, there has always been a tradeo between precision and termination. What is necessary to extend the power of automatic partial evaluation? We compare two frameworks for partial evaluation: constraint-based partial evaluation, and generalized partial computation. Both techniques incorporate advanced information propagation. Using theorem proving, generalized partial computation achieves greater specialisation than constraintbased partial evaluation, but the constraint-based approach has a
/lp/association-for-computing-machinery/extending-the-power-of-automatic-constraint-based-partial-evaluators-KrXYzolQq0