A Transformation System Combining Partial Evaluation with Term Rewriting (1994)  (Make Corrections)  (9 citations)
Françoise Bellegarde

 @ NUS   Home/Search   Context   Related

 
View or download:
ogi.edu/pub/techreports...94010.ps.gz
Cached:  PS.gz  PS  PDF  Image  Update  Help

From:  ogi.edu/PacSoft/pub...bibliograph (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper presents a new approach to optimizing functional programs based on combining partial evaluation and rewriting. Programs are composed of higher-order primitives. Partial evaluation is used to eliminate higher-order functions. First-order rewriting is used to process the transformation. Laws about the higher-order primitives that are relevant for the optimizations are automatically extracted from a library and transformed into firstorder terms using partial evaluation. Such a... (Update)

Context of citations to this paper:   More

...performed by partial evaluation as a preprocessor of our system. Moreover, we can combine the partial evaluator Schism [8] with our system [3]. Partial evaluation, on the fly, transforms a given set of higher order laws into the first order laws that facilitate a...

...programs. Because we are using first order term rewriting, it seems more difficult to integrate a defunctionalization transformation. We have explored a way to combine partial evaluation with completion in [5]. Acknowledgement We have enjoyed discussions with L. Fegaras....

Cited by:   More
Termination Issues in Automated Syntheses - Bellegarde (1994)   (Correct)
ASTRE: Towards A Fully Automated Program Transformation System - Bellegarde (1994)   (Correct)
Calculating Software Generators from Solution.. - Kieburtz, Bellegarde.. (1994)   (Correct)

Similar documents (at the sentence level):
79.2%:   A Transformation System Combining Partial Evaluation with Term.. - Bellegarde (1993)   (Correct)

Active bibliography (related documents):   More   All
0.2:   ASTRE: a transformation system using completion - Bellegarde (1991)   (Correct)
0.1:   Deductive and Inductive Synthesis of Equational Programs - Dershowitz, Reddy (1992)   (Correct)
0.1:   Automating Synthesis by Completion - Bellegarde (1994)   (Correct)

Similar documents based on text:   More   All
0.3:   Sound And Complete Translations From Sorted Higher-Order Logic.. - Kerber (1994)   (Correct)
0.3:   Constraints to Stop Higher-Order Deforestation - Seidl, Sørensen (1997)   (Correct)
0.3:   Higher-Order Narrowing - Prehofer (1994)   (Correct)

Related documents from co-citation:   More   All
7:   Deforestation: transforming programs to eliminate trees - Wadler - 1990
6:   Completion and its Applications (context) - Dershowitz - 1988
6:   A transformation system for developing recursive programs - Burstall, Darlington - 1977

BibTeX entry:   (Update)

F. Bellegarde. A transformation system combining partial evaluation with term rewriting. In Higher Order Algebra, Logic and Term Rewriting (HOA '93), volume 816 of LNCS, pages 40--58. Springer-Verlag, September 1993. http://citeseer.comp.nus.edu.sg/126298.html   More

@misc{ bellegarde93transformation,
  author = "F. Bellegarde",
  title = "A transformation system combining partial evaluation with term rewriting",
  text = "F. Bellegarde. A transformation system combining partial evaluation with
    term rewriting. In Higher Order Algebra, Logic and Term Rewriting (HOA '93),
    volume 816 of LNCS, pages 40--58. Springer-Verlag, September 1993.",
  year = "1993",
  url = "citeseer.comp.nus.edu.sg/126298.html" }
Citations (may not include all citations):
385   A Transformation System For Developing Recursive Programs - Burstall, Darlington - 1977
324   Deforestation: Transforming programs to eliminate trees - Wadler - 1988
210   Functional Programming with Bananas (context) - Meijer, Fokkinga et al. - 1991
161   A short cut to Deforestation - Gill, Launchbury et al. - 1993
143   Theorem for free - Wadler - 1989
78   Programming Pearls (context) - Bentley - 1986
77   Type Theory and Functional Programming (context) - Thompson - 1991
69   A tour of Schism: A partial evaluation system for higher-ord.. - Consel - 1992
56   Higher order unification revisited: complete sets of transfo.. (context) - Snyder, Gallier - 1989
32   Automatic Methods for Program Transformation (context) - Chin - 1990
27   Mixed computation: potential applications and problem for st.. (context) - Ershov - 1982
15   Transformational derivation of programs using the Focus syst.. (context) - Reddy - 1988
11   Resolution of Equations in Algebraic Structures (context) - Dershowitz, its - 1988
11   Program Transformation and Rewriting - Bellegarde - 1991
5   Oregon Graduate Institute (context) - Bellegarde, System et al. - 1991
3   A fold for All Seasons (context) - Scheard, Fegaras - 1993



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cse.ogi.edu/PacSoft/publications/bibliograph.html):   More
Revisiting Catamorphisms over Datatypes with Embedded.. - Fegaras, Sheard (1996)   (Correct)
Unboxed Values as First Class Citizens in a Non-Strict.. - Jones, Launchbury (1991)   (Correct)
A Short Cut to Deforestation - Gill, Launchbury, Jones (1993)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.