Olivier Danvy  Home/Search
Context Related
| daimi.aau.dk/~ups/papers/tcs00.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: daimi.aau.dk/~ups/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Lambda-lifting a block-structured program transforms it into a set of recursive equations. We present the symmetric transformation: lambda-dropping. Lambdadropping a set of recursive equations restores block structure and lexical scope. (Update)
Context of citations to this paper: More
...lexically scoped program. Lambda dropping was reported at PEPM 97 jointly with Schultz and implemented as the back end of a partial evaluator [4, 10]. In that joint work, we tried to emphasize the symmetric aspects of lambda lifting and lambdadropping: recursive equations...
.... the same token, it could lambda drop the variable t, as we do in the residual programs displayed in Sections 4, 5, and 7, for readability [23]. So all in all, a specialized program is defined as a main function (an instance of match) with many locally defined and mutually...
Cited by: More
Lambda-Lifting in Quadratic Time - Danvy, Schultz (2004) (Correct)
The Abstraction and Instantiation of String-Matching.. - Amtoft, Consel.. (2001) (Correct)
Type-Based Useless-Variable Elimination - Naoki Kobayashi Koba (1999) (Correct)
Similar documents (at the sentence level):
18.1%: Lambda-Dropping: Transforming Recursive Equations into.. - Danvy, Schultz (1995) (Correct)
17.3%: Transforming Recursive Equations into Programs with Block.. - Danvy, Schultz (1997) (Correct)
Active bibliography (related documents): More All
0.7: Implicit and Explicit Aspects of Scope and Block Structure - Schultz (Correct)
0.3: Compilation by Transformation in Non-Strict Functional Languages - Santos (1995) (Correct)
0.3: Secrets of the Glasgow Haskell Compiler inliner - Jones, Marlow (1999) (Correct)
Similar documents based on text: More All
0.7: BRICS Research Series, 1997 - Brics (1999) (Correct)
0.7: A Modular Fully-lazy Lambda Lifter in HASKELL - Jones, Lester (1991) (Correct)
0.6: A Unifying Approach to Goal-Directed Evaluation - Danvy, Grobauer, Rhiger (2001) (Correct)
Related documents from co-citation: More All
6: Super combinators - a new implementation method for applicative languages (context) - Hughes - 1982
6: Compiling with Continuations (context) - Appel - 1992
6: Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
BibTeX entry: (Update)
Olivier Danvy. Lambda-dropping: transforming recursive equations into programs with block structure. Technical report DART 252, Computer Science Department, Aarhus University, Aarhus, Denmark, January 1995. http://citeseer.ist.psu.edu/article/danvy95lambdadropping.html More
@article{ danvy00lambdadropping,
author = "Olivier Danvy and Ulrik P. Schultz",
title = "Lambda-dropping: transforming recursive equations into programs with block structure",
journal = "Theoretical Computer Science",
volume = "248",
number = "1--2",
pages = "243--287",
year = "2000",
url = "citeseer.ist.psu.edu/article/danvy95lambdadropping.html" }
Citations (may not include all citations):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
218 The mechanical evaluation of expressions (context) - Landin - 1964
206 Tutorial notes on partial evaluation (context) - Consel, Danvy - 1993
155 The essence of compiling with continuations - Flanagan, Sabry et al. - 1993
133 Implicit and explicit aspects of scope and block structure - Schultz - 1997
122 Type-directed partial evaluation - Danvy - 1996
99 A partial evaluator for the untyped lambda-calculus - Gomard, Jones - 1991
98 MIX: A self-applicable partial evaluator for experiments in .. (context) - Jones, Sestoft et al. - 1989
84 The next 700 programming languages (context) - Landin - 1966
74 Replacing function parameters by global variables (context) - Sestoft - 1988
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 higherorde.. - Consel - 1993
61 Control-Flow Analysis of Higher-Order Languages or Taming La.. - Shivers - 1991
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 Partial evaluation of Standard ML (context) - Birkedal, Welinder - 1993
38 Static and dynamic semantics processing - Consel, Danvy - 1991
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.
32 ACM Transactions on Programming Languages and Systems (context) - Steckler, Wand et al. - 1997
31 Modern Compiler Implementation in {C (context) - Appel - 1998
31 Galois connections and computer science applications (context) - Melton, Schmidt et al. - 1986
29 Topics in Online Partial Evaluation (context) - Ruf - 1993
17 Implementation of the typed call-by-value lambda-calculus us.. - Tofte, Talpin
17 or a simple optimizing compiler for Scheme (context) - Clinger, Hansen et al.
15 Lambda-dropping: transforming recursive equations into progr.. - Danvy, Schultz - 1997
13 Syntactic detection of single-threading using continuations - Fradet - 1991
13 Resource-bounded partial evaluation (context) - Danvy, Heintze et al. - 1996
11 cient closure representations (context) - Shao, Appel
8 An extensional characterization of lambda-lifting and lambda.. - Danvy - 1998
8 Compilation by transformation in non-strict functional langu.. (context) - Santos - 1996
6 Detecting global variables in denotational definitions (context) - Schmidt - 1985
5 Polyvariant specialization for higherorder (context) - Malmkjr, rbk - 1995
5 Type specialisation for the lambda calculus; or (context) - Hughes - 1996
5 cient analyses for realistic o#-line partial evaluation (context) - Bondorf, Jrgensen - 1993
4 Loop headers in lambda-calculus or CPS - Appel - 1994
4 An introduction to fully-lazy supercombinators (context) - Jones - 1985
3 ML partial evaluation using set-based analysis - Malmkjr, Heintze et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.daimi.aau.dk/~ups/): More
Harissa: A Hybrid Approach to Java Execution - Muller, Schultz (1999) (Correct)
Object-Oriented Software Engineering Using Partial Evaluaion - Schultz (2000) (Correct)
Partial Evaluation for Class-Based Object-Oriented Languages - Schultz (2000) (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