See this document in CiteSeerX!

Closure generation based on viewing LAMBDA as EPSILON plus COMPILE (1992)  (Make Corrections)  (5 citations)
Marc Feeley, Guy Lapalme
Computer Languages



  Home/Search   Context   Related

Links:   DBLP

 
View or download:
iro.umontreal.ca/~fe...complang92.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  iro.umontreal.ca/~feeley/ (more)
(Enter author homepages)

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

Abstract: This paper describes a way of expressing --expressions (which produce closures) in terms of ffl--expressions (--expressions containing only local and global variable references) and calls to an interactive compiler that compiles ffl--expressions. This point of view is an interesting way of describing the semantics of --expressions and closure generation. It also leads to an efficient closure implementation both in time and space. A closure is uniformly represented as a piece of code instead of... (Update)

Context of citations to this paper:   More

.... an alternative to the conventional implementation of closures; this idea has also been described by Appel [App87] and Feeley and Lapalme [FL92]. Stages of computation also arise from conventional iteration constructs such as loop nests. Values computed in an outer loop are...

...in the program text. 3 Appel has made a similar observation [App87] and all code closures have been proposed by Feeley and Lapalme [FL92]. We have restricted our attention to two computation stages in this paper in order to simplify the presentation. In general, however,...

Cited by:   More
BIT: A Very Compact Scheme System for Embedded Applications - Dube (2000)   (Correct)
Realistic Compilation by Program Transformation - Kelsey, Hudak (1989)   (Correct)
Putting It In Context: A Syntactic Theory Of Incremental.. - Shinn-Der Lee (1996)   (Correct)

Active bibliography (related documents):   More   All
0.8:   Revised^4 Report on the Algorithmic Language Scheme - Clinger, (ed.), Rees.. (1991)   (Correct)
0.5:   Revised^3 Report on the Algorithmic Language Scheme - Rees, (ed.), Clinger.. (1991)   (Correct)
0.3:   The Evolution of Lisp - Steele, Jr., Gabriel (1993)   (Correct)

Similar documents based on text:   More   All
0.3:   A Debugging Environment for Lazy Functional Languages - Lapalme, al. (1999)   (Correct)
0.3:   The Computer Calculation of Lie Point Symmetries of.. - Champagne, Hereman.. (1990)   (Correct)
0.3:   Genome Halving - El-Mabrouk, Nadeau, Sankoff   (Correct)

Related documents from co-citation:   More   All
3:   Efficient implementation of the Smalltalk--80 system - Deutsch, Schiffman - 1984
2:   Towards efficient partial evaluation (context) - Malmkjaer - 1993
2:   Language triplets: The AMIX approach (context) - Kehler - 1988

BibTeX entry:   (Update)

Marc Feeley and Guy Lapalme. Closure generation based on viewing lambda as epsilon plus compile. Computer Languages, 17(4):251--267, October 1992. http://citeseer.ist.psu.edu/feeley92closure.html   More

@article{ feeley92closure,
    author = "Marc Feeley and Guy Lapalme",
    title = "Closure Generation Based on Viewing Lambda as Epsilon Plus Compile",
    journal = "Computer Languages",
    volume = "17",
    number = "4",
    pages = "251-267",
    year = "1992",
    url = "citeseer.ist.psu.edu/feeley92closure.html" }
Citations (may not include all citations):
484   Common Lisp: the Language (context) - Steele - 1984  ACM
430   Structure and Interpretation of Computer Programs (context) - Abelson, Sussman et al. - 1985  ACM
359   The Implementation of Functional Programming Languages (context) - Jones - 1987
197   The Revised 3 Report on the Algorithmic Language Scheme - Rees, Clinger - 1986
127   Principles of Compiler Design (context) - Aho, Ullman - 1977
42   Compiling a Functional Language - Cardelli - 1984  ACM   DBLP
38   Procedures as Persistent Data Objects (context) - Atkinson, Morrison - 1985  ACM   DBLP
29   The Functional Abstract Machine (context) - Cardelli - 1983
27   Scheme: An Interpreter for extended Lambda Calculus (context) - Sussman, Steele - 1975
18   Algol 60 implementation (context) - Randell, Russell - 1964
17   An Optimizing Compiler for lexically Scoped Lisp (context) - Brooks, Gabriel et al. - 1982  ACM   DBLP
16   LAMBDA: The Ultimate Software Tool (context) - Rees, Adams - 1982
13   Recursive Programming (context) - Dijkstra - 1967
11   Computer Science Department (context) - Rees, Adams et al. - 1984
11   A Parallel Virtual Machine for Efficient Scheme Compilation - Feeley, Miller - 1990  ACM   DBLP
7   An efficient Environment Allocation Scheme in an Interpreter.. (context) - McDermott - 1980
5   Using Closures for Code Generation (context) - Feeley, Lapalme - 1987  ACM   DBLP
3   on du langage Scheme. Document de travail no 183, D'eparteme.. (context) - Feeley, Deux - 1986
2   MIT Artificial Intelligence Memo (context) - Steele - 1976
2   MIT Artificial Intelligence Memo (context) - Steele, Rabbit - 1978
1   A Portable Lisp Compiler (context) - Griss, Hearn - 1981
1   Annals of Mathematics Studies Number (context) - Church - 1941



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


Documents on the same site (http://www.iro.umontreal.ca/~feeley/):   More
Benchmarking Implementations of Functional.. - Hartel, Feeley.. (1993)   (Correct)
An Efficient and General Implementation of Futures on Large Scale .. - Feeley (1993)   (Correct)
A Message Passing Implementation of Lazy Task Creation - Feeley (1993)   (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