Ulrik Pagh Schultz  @ NUS Home/Search
Context
Related
| irisa.fr/prive/ups/...speciale97.ps.gz daimi.aau.dk/~ups/m...speciale97.ps.gz Cached: PS.gz PS PDF Image Update Help From: irisa.fr/compose/ups/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Block structure is a fundamental mechanism for expressing the scope of variables in a computation. Scope can be expressed either explicitly with formal parameters or implicitly with free variables. We discuss the transformations between explicit and implicit scope. Making scope explicit is current practice in functional programming: it is called "lambdalifting. " Our thesis addresses the transformations between explicit and implicit scope. We show lambda-dropping to be a useful transformation... (Update)
Similar documents (at the sentence level):
10.1%: Lambda-Dropping: Transforming Recursive Equations into.. - Danvy, Schultz (1995) (Correct)
9.7%: Transforming Recursive Equations into Programs with Block.. - Danvy, Schultz (1997) (Correct)
Active bibliography (related documents): More All
0.3: The Semantics and Implementation of Bindings in Higher-Order.. - Banerjee (1995) (Correct)
0.2: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.2: Partial Evaluation - Mogensen, Sestoft (1996) (Correct)
Similar documents based on text: More All
0.1: Under consideration for publication in J. Functional.. - Department Of Computer (Correct)
0.1: Specialization Patterns - Schultz, Lawall, Consel (1999) (Correct)
0.1: Java Bytecode Compression For Embedded Systems - Ręder Clausen, Schultz.. (1998) (Correct)
BibTeX entry: (Update)
@misc{ schultz-implicit,
author = "Ulrik Pagh Schultz",
title = "Implicit and Explicit Aspects of Scope and Block Structure",
url = "citeseer.comp.nus.edu.sg/120067.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
293 The essence of functional programming - Wadler - 1992
210 Implementing lazy functional languages on stock hardware: th.. - Jones - 1993
206 Tutorial notes on partial evaluation (context) - Consel, Danvy - 1993
122 Type-directed partial evaluation - Danvy - 1996
106 Essentials of Programming Languages (context) - Friedman, Wand et al. - 1991
99 A partial evaluator for the untyped lambdacalculus - Gomard, Jones - 1991
84 The next 700 programming languages (context) - Landin - 1966
79 Polymorphic type schemes and recursive definitions (context) - Mycroft - 1984
79 Object-Oriented Programming in Common Lisp (context) - Keene - 1989
70 Mathematical Structures in Computer Science (context) - Danvy, Filinski et al. - 1992
69 A tour of Schism: A partial evaluation system for higher-ord.. - Consel - 1993
69 Compiling Lazy Functional Languages (context) - Johnsson - 1987
69 Revised report on the algorithmic language ALGOL (context) - Naur - 1963
68 Introduction to Metamathematics (context) - Kleene - 1952
67 Representing control in the presence of first-class continua.. - Hieb, Dybvig et al. - 1990
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
38 Partial evaluation of Standard ML (context) - Birkedal, Welinder - 1993
38 Static and dynamic semantics processing - Consel, Danvy - 1991
38 Efficient analyses for realistic off-line partial evaluation (context) - Bondorf, Jorgensen - 1993
36 Compiling Lazy Functional Languages (context) - Augustsson - 1988
34 Lambda lifting: Transforming programs to recursive equations - Johnsson - 1985
32 Let-floating: moving bindings to give faster programs - Jones, Partain et al. - 1996
30 The syntax and semantics of the proposed international algeb.. (context) - Backus - 1959
29 Topics in Online Partial Evaluation (context) - Ruf - 1993
29 An empirical and analytic study of stack vs (context) - Appel, Shao - 1994
26 Polyvariant mixed computation for analyzer programs (context) - Bulyonkov - 1984
17 Implementation of the typed call-by-value lambda-calculus us.. - Tofte, Talpin - 1994
17 or a simple optimizing compiler for Scheme (context) - Clinger, Hansen et al. - 1994
15 ML partial evaluation using set-based analysis - Malmkjaer, Heintze et al. - 1994
15 Lambda-dropping: transforming recursive equations into progr.. - Danvy, Schultz - 1997
13 Resource-bounded partial evaluation (context) - Danvy, Heintze et al. - 1996
13 Recursive programming (context) - Dijkstra - 1960
13 Explicit substitution tutorial & survey (context) - Rose - 1996
10 Yale University (context) - Consel, Manual - 1990
8 Computer Science Department (context) - Filinski, categorical et al. - 1989
5 Polyvariant specialization for higher-order (context) - Malmkjaer, Orbaek - 1995
1 An introduction to the Kfij-Calculus (context) - Goldberg - 1996
1 A nonrecursive list compacting algorithm (context) - Cheeney - 1984
Documents on the same site (http://www.irisa.fr/compose/ups/):
Lambda-Dropping: Transforming Recursive Equations into.. - Danvy, Schultz (1995) (Correct)
Specialization Patterns - Schultz, Lavall, al. (1999) (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.