See this document in CiteSeerX!

Transforming Recursive Equations into Programs with Block Structure (1997)  (Make Corrections)  
Olivier Danvy, Ulrik P. Schultz



  Home/Search   Context   Related

 
View or download:
brics.dk/RS/97/Ref...RICSRS976.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  brics.dk/RS/97/Ref/BRICSRS97... (more)
(Enter author homepages)

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

Abstract: Lambda-lifting a functional program transforms it into a set of recursive equations. We present the symmetric transformation: lambdadropping. (Update)

Similar documents (at the sentence level):
39.3%:   Implicit and Explicit Aspects of Scope and Block Structure - Schultz   (Correct)
21.5%:   Lambda-Dropping: Transforming Recursive Equations into Programs.. - Danvy (1995)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Terrain Reconstruction from Widely Separated Images - Schultz (1995)   (Correct)
0.2:   Compiling Monads - Danvy, Koslowski, Malmkjær (1991)   (Correct)
0.1:   The Semantics and Implementation of Bindings in Higher-Order.. - Banerjee (1995)   (Correct)

Similar documents based on text:   More   All
1.4:   A Unifying Approach to Goal-Directed Evaluation - Danvy, Grobauer, Rhiger (2001)   (Correct)
1.3:   A Simple Take on Typed Abstract Syntax in Haskell-like Languages - Danvy, Rhiger (2000)   (Correct)
1.3:   Normalization by Evaluation with Typed Abstract Syntax - Danvy, Rhiger, Rose (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ danvy-transforming,
  author = "Olivier Danvy and Ulrik P. Schultz",
  title = "Transforming Recursive Equations into Programs with Block Structure",
  url = "citeseer.ist.psu.edu/danvy97transforming.html" }
Citations (may not include all citations):
866   Techniques and Tools (context) - Aho, Sethi et al. - 1986
638   Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
521   Compiling with Continuations (context) - Appel - 1992
324   Deforestation: Transforming programs to eliminate trees - Wadler
206   Tutorial notes on partial evaluation (context) - Consel, Danvy - 1993
155   The essence of compiling with continuations - Flanagan, Sabry et al. - 1993
122   Type-directed partial evaluation - Danvy - 1996
99   A partial evaluator for the untyped lambda-calculus - Gomard, Jones - 1991
98   MIX: A selfapplicable partial evaluator for experiments in c.. (context) - Jones, Sestoft et al. - 1989
84   The next 700 programming languages (context) - Landin - 1966
74   Replacing function parameters by global variables (context) - Sestoft - 1989
69   Compiling Lazy Functional Languages (context) - Johnsson - 1987
69   A tour of Schism: A partial evaluation system for higher-ord.. - Consel - 1993
61   Control-Flow Analysis of Higher-Order Languages or Taming La.. - Shivers - 1991
55   Space-efficient closure representations - Shao, Appel
53   Prentice Hall International Series in Computer Science (context) - Jones, of et al. - 1987
53   Prentice Hall International Series in Computer Science (context) - Jones, Lester et al. - 1992
40   The Lambda Calculus --- Its Syntax and Semantics (context) - Barendregt - 1984
38   Selective and lightweight closure conversion - Wand, Steckler
38   Partial evaluation of Standard ML (context) - Birkedal, Welinder - 1993
38   Static and dynamic semantics processing - Consel, Danvy - 1991
38   Efficient analyses for realistic offline partial evaluation (context) - Bondorf, Jrgensen - 1993
36   Compiling Lazy Functional Languages (context) - Augustsson - 1988
35   Super combinators: A new implementation method for applicati.. (context) - Hughes
34   Lambda lifting: Transforming programs to recursive equations - Johnsson - 1985
32   Let-floating: moving bindings to give faster programs - Jones, Partain et al.
29   Topics in Online Partial Evaluation (context) - Ruf - 1993
17   or a simple optimizing compiler for Scheme (context) - Clinger, Hansen et al.
17   Implementation of the typed callby -value lambda-calculus us.. - Tofte, Talpin
13   Syntactic detection of single-threading using continuations - Fradet - 1991
13   Resourcebounded partial evaluation (context) - Danvy, Heintze et al. - 1996
6   Detecting global variables in denotational definitions (context) - Schmidt - 1985
5   Polyvariant specialization for higher-order (context) - Malmkjaer, rbaek - 1995
4   An introduction to fully-lazy supercombinators (context) - Jones - 1985
3   Department of Computer Science (context) - Schultz, DAIMI - 1997
3   ML partial evaluation using set-based analysis - Malmkjaer, Heintze et al.
1   A categorical interpretation of Landin's correspondence prin.. - Banerjee, Schmidt - 1993

Documents on the same site (http://www.brics.dk/RS/97/Ref/BRICS-RS-97-Ref/):   More
CoFI: The Common Framework Initiative for Algebraic Specification .. - Mosses (1997)   (Correct)
Syntax and Semantics of the logic ... - Butz (1997)   (Correct)
What is a `Good' Encoding of Guarded Choice? - Nestmann (1997)   (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