Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

Optimization of equational programs using partial evaluation

Published: 01 May 1991 Publication History
First page of PDF

References

[1]
L. Beckman, Haraldsson A., Oskarsson (~)., and Sandewall E. A partial evaluator, and its use as a programming tool. Artificial Intelligence, (7):319-357, 1976.
[2]
Anders Bondorf. A self-applicable partial evaluator for term-rewriting systems. In Internalional Joinl Conference on the Theory and Praclice of Software Development (TAPSOFT), volume 2. Springer-Verlag, 1989.
[3]
lrene Durand and Robert Strandh. A decision procedure for forward-branching equational programs. Technical Report 05-9'0, GRECO Programmation, 1990.
[4]
A. Haraldsson. A Program Manipulation System Based on Partial Evaluation. PhD thesis, Department of Mathematics, LinkSping University, LinkSping, 1977.
[5]
Christoph Hoffmann and Michael J. O'Donnell. Programming wit, h equations. A CM Transactions on Programruing Languages and Systems, pages 83-112, 1982.
[6]
C. Hoffmann, M. J. O'Donnell, and R. Strandh. Programming with equations. Software, Praclice and Experience, 1985.
[7]
N.D. Jones, P. Sestoft, and H. Sdndergaard. An experiment in partial evaluation: The generation of a compiler generator. Technical report, Institute of Datalogy, Universi~Ly of Copenhagen, Copenhagen, 1985.
[8]
Michael J. O'Donnell. Equational Logic as a Programmzng Language. MIT Press, 1985.
[9]
David J. Sherman. Lazy directed congruence closure. Technical Report 90-028, University of Chicago Department of Computer Science, 1990.
[10]
David J. Sherman and Robert I. Strandh. An abstract machine for efficient implementation of term rewriting. Technical Report 90-012, University of Chicago Department of Computer Science, 1990.
[11]
Robert I. Strandh. Compiling Equational Programs into Efficient Machine Code. PhD thesis, Johns Hopkins University, Baltimore, Maryland, 1988.
[12]
Robert I. Strandh. Classes of equational programs that compile into efficient machine code. In Proceedings of the Third International Conference on Rewrite Techniques and Applications, 1989.
[13]
Philip Wadler. Deforestation: Transforming programs to eliminate trees. In Second European Symposium on Programming. Springer- Verlag, 1988.

Cited By

View all
  • (2000)Lazy rewriting on eager machineryACM Transactions on Programming Languages and Systems (TOPLAS)10.1145/345099.34510222:1(45-86)Online publication date: 1-Jan-2000
  • (2005)Development of rewriting strategiesProgamming Language Implementation and Logic Programming10.1007/3-540-57186-8_92(378-390)Online publication date: 1-Jun-2005
  • (1999)Optimizing term rewriting using discrimination nets with specializationProceedings of the 1999 ACM symposium on Applied computing10.1145/298151.298431(511-518)Online publication date: 28-Feb-1999

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices
ACM SIGPLAN Notices  Volume 26, Issue 9
Sept. 1991
333 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/115866
Issue’s Table of Contents
  • cover image ACM Conferences
    PEPM '91: Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
    May 1991
    333 pages
    ISBN:0897914333
    DOI:10.1145/115865
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1991
Published in SIGPLAN Volume 26, Issue 9

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)91
  • Downloads (Last 6 weeks)15
Reflects downloads up to 22 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2000)Lazy rewriting on eager machineryACM Transactions on Programming Languages and Systems (TOPLAS)10.1145/345099.34510222:1(45-86)Online publication date: 1-Jan-2000
  • (2005)Development of rewriting strategiesProgamming Language Implementation and Logic Programming10.1007/3-540-57186-8_92(378-390)Online publication date: 1-Jun-2005
  • (1999)Optimizing term rewriting using discrimination nets with specializationProceedings of the 1999 ACM symposium on Applied computing10.1145/298151.298431(511-518)Online publication date: 28-Feb-1999

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media