Jonathan Sobel, Daniel P. Friedman  Home/Search
Context Related
Links: ACM DBLP | indiana.edu/~jsobel/Recy...recycling.ps 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: indiana.edu/~jsobel/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: If the continuations in functional data-structure-generating programs are made explicit and represented as records, they can be "recycled." Once they have served their purpose as temporary, intermediate structures for managing program control, the space they occupy can be reused for the structures that the programs produce as their output. To effect this immediate memory reclamation, we use a sequence of correctness-preserving program transformations, demonstrated through a series of simple... (Update)
Context of citations to this paper: More
...space available for storing control information, so minimizing the overhead of the traversal is a must. Recent work by Sobel and Friedman [37] has shown how to automatically transform certain continuation passing style programs, those generated by anamorphisms [23] into link...
...for the applications in which the list represents a computation. The Schorr Waite algorithm [14] has numerous applications; see e.g. [15, 16, 3]. It would be interesting to explore to what extent these applications could bene t from the non intrusive nature of our algorithm....
Cited by: More
Alias Types for Recursive Data Structures - Walker, Morrisett (2000) (Correct)
Efficient Pebbling for List Traversal Synopses - Matias, Porat (2002) (Correct)
Similar documents (at the sentence level):
64.1%: Recycling Continuations - Sobel, Friedman (1998) (Correct)
Active bibliography (related documents): More All
0.3: Earliest Eligible Virtual Deadline First: A Flexible and.. - Stoica, Abdel-Wahab (1995) (Correct)
0.3: Multidigit Multiplication For Mathematicians - Bernstein (Correct)
0.2: the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
Related documents from co-citation: More All
6: Typed memory management in a calculus of capabilities - Crary, Walker et al. - 1999
6: to typed assembly language (context) - Morrisett, Walker et al. - 1998
6: Typed closure conversion - Minamide, Morrisett et al. - 1996
BibTeX entry: (Update)
Jonathan Sobel and Daniel P. Friedman. Recycling continuations. In International Conference on Functional Programming '98, Baltimore, September 1998. To appear. 13 http://citeseer.ist.psu.edu/sobel98recycling.html More
@inproceedings{ sobel99recycling,
author = "Jonathan Sobel and Daniel P. Friedman",
title = "Recycling Continuations",
booktitle = "Proceedings of the {ACM} {SIGPLAN} International Conference on Functional Programming ({ICFP} '98)",
volume = "34(1)",
pages = "251--260",
year = "1999",
url = "citeseer.ist.psu.edu/sobel98recycling.html" }
Citations (may not include all citations):369 Information and Computation (context) - Moggi, computation - 1991
333 An Introduction to Functional Programming (context) - Bird, Wadler - 1988
184 Definitional interpreters for higherorder programming langua.. (context) - Reynolds - 1972
85 Abstract models of memory management (context) - Morrisett, Felleisen et al. - 1995
63 Algebraic data types and program transformation (context) - Malcolm - 1990
55 Bananas in space: Extending fold and unfold to exponential t.. - Meijer, Hutton - 1995 DBLP
52 Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
47 Continuation-based program transformation strategies (context) - Wand - 1980 ACM DBLP
31 An efficient machineindependent procedure for garbage collec.. (context) - Schorr, Waite - 1967
12 Data Structures and Their Algorithms (context) - Lewis, Denenburg - 1991 ACM
8 Recursive definition of syntax and semantics (context) - Van Wijngaarden - 1964
7 A functional representation of data structures with a hole - Minamide - 1998 ACM DBLP
6 Rolling your own mutable ADT: A connection between linear ty.. (context) - Chen, Hudak - 1997
5 A space-efficient list structure tracing algorithm (context) - Wegbreit - 1972
3 Design and Analysis of Algorithms (context) - Smith - 1989 ACM
1 Three Implmentation Models for Scheme (context) - Dybvig - 1987
1 Bell Labs Technical Memorandum TM (context) - Cardelli, abstract et al. - 1983
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/~jsobel/): More
A Datatype Macro for Scheme - Sobel, hilsdale (Correct)
Abstraction and Performance from Explicit Monadic.. - Sobel, Hilsdale, Dybvig, .. (Correct)
Recycling Continuations - Sobel, Friedman (1998) (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