See this document in CiteSeerX!

Shrinking Lambda Expressions in Linear Time (1997)  (Make Corrections)  (17 citations)
Andrew W. Appel, Trevor Jim
Journal of Functional Programming



  Home/Search   Context   Related

 
View or download:
princeton.edu/reports/1997/556.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  indiana.edu/pub/ucstri/index (more)
(Enter author homepages)

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

Abstract: Functional-language compilers often perform optimizations based on beta and delta reduction. To avoid speculative optimizations that can blow up the code size, we might wish to use only shrinking reduction rules guaranteed to make the program smaller: these include dead-variable elimination, constant folding, and a restricted beta rule that inlines only functions that are called just once. The restricted beta rule leads to a shrinking rewrite system that has not previously been studied. We show ... (Update)

Context of citations to this paper:   More

...the inliner, a function is never inlined into its own body. Our choice and implementation of optimizations was largely inspired by Appel and Jim #1998#. The optimizer does not perform speculative inlining. Optimization passes are performed repeatedly until no change is observed...

...a function is never inlined into its own body. Our choice and implementation of optimizations was largely inspired by Appel and Jim [3]. We do not perform speculative inlining. Optimization passes are performed repeatedly until no change is observed or some fixed small...

Cited by:   More
A Survey of Rewriting Strategies in Program Transformation Systems - Visser (2003)   (Correct)
Scoped Dynamic Rewrite Rules - Visser (2001)   (Correct)
From ML to Ada(!?!): Strongly-typed Language Interoperability .. - Oliva, Tolmach (1997)   (Correct)

Similar documents (at the sentence level):
26.4%:   Making Lambda Calculus Smaller, Faster - Appel, Jim (1994)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Compiling Standard ML to Java - An   (Correct)
0.2:   Compilation by Transformation in Non-Strict Functional Languages - Santos (1995)   (Correct)
0.2:   Lambda-Dropping: Transforming Recursive Equations into Programs.. - Danvy (1995)   (Correct)

Similar documents based on text:   More   All
0.2:   Improved Cryptanalysis of the Self-Shrinking Generator - Zenner, Krause, Lucks (2001)   (Correct)
0.2:   A New Parallel Binary Image Shrinking Algorithm - Shi, Ritter (1995)   (Correct)
0.2:   Shrinking Trees - Hastie, Pregibon (1990)   (Correct)

Related documents from co-citation:   More   All
13:   Compiling with Continuations (context) - Appel - 1992
8:   The essence of compiling with continuations - Flanagan, Sabry et al.
7:   TIL: A type-directed optimizing compiler for ML - Tarditi, Morrisett et al. - 1995

BibTeX entry:   (Update)

Andrew W. Appel and Trevor Jim. Shrinking lambda expressions in linear time. To appear in Journal of Functional Programming. http://citeseer.ist.psu.edu/appel97shrinking.html   More

@article{ appel97shrinking,
    author = "Andrew W. Appel and Trevor Jim",
    title = "Shrinking lambda Expressions in Linear Time",
    journal = "Journal of Functional Programming",
    volume = "7",
    number = "5",
    pages = "515-540",
    year = "1997",
    url = "citeseer.ist.psu.edu/appel97shrinking.html" }
Citations (may not include all citations):
729   The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
521   Compiling with Continuations (context) - Appel - 1992
220   ORBIT: An optimizing compiler for Scheme (context) - Kranz - 1987
155   The essence of compiling with continuations - Flanagan, Sabry et al. - 1993
89   closure-passing style (context) - Appel, Jim - 1989
50   Artificial Intelligence Laboratory (context) - Steele, for et al. - 1978
11   cient closure representations (context) - Shao, Appel - 1994
8   Compilation by Transformation in NonStrict Functional Langua.. (context) - de Medeiros - 1995
4   Making lambda-calculus smaller (context) - Appel, Jim - 1994
1   Implementing lazy functinal languages on stock hardware: the.. (context) - Jones - 1992



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


Documents on the same site (http://ftp.cs.indiana.edu/pub/ucstri/index):   More
Selection of Test Points during High-Level Synthesis - Nagel   (Correct)
Game Tree Search on a Massively Parallel System - Feldmann, Mysliwietz, Monien (1993)   (Correct)
Computing the Discrepancy with Applications to.. - Dobkin, Eppstein.. (1996)   (Correct)

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

CiteSeer.IST - Copyright Penn State and NEC