(Enter summary)
Abstract: We present a framework for applying memoization selectively. The
framework provides programmer control over equality, space usage,
and identification of precise dependences so that memoization
can be applied according to the needs of an application. Two
key properties of the framework are that it is efficient and yields
programs whose performance can be analyzed using standard techniques.
We describe the framework in the context of a functional language
and an implementation as an SML library.... (Update)
Cited by: More
Self-Adjusting Programming - Umut Acar Guy
(Correct)
A Monadic Approach for Avoiding Code Duplication when .. - Swadi, Taha.. (2006)
(Correct)
A Programming Language for Probabilistic Computation - Park (2005)
(Correct)
Similar documents (at the sentence level):
5.0%: Selective Memoization - Acar, Blelloch, Harper (2003)
(Correct)
Active bibliography (related documents): More All
0.4: Adaptive Memoization - Acar, Blelloch, Harper (2003)
(Correct)
0.4: Adaptive Functional Programming - Umut Acar Guy (2001)
(Correct)
0.3: Efficient Computation via Incremental Computation - Liu (1999)
(Correct)
Similar documents based on text: More All
0.7: The Data Locality of Work Stealing - Acar, Blelloch, Blumofe (2000)
(Correct)
Related documents from co-citation: More All
3: The essence of functional programming
- Wadler - 1992
3: Adaptive functional programming
- Acar, Blelloch et al. - 2001
3: Lisp and Symbolic Computation (context) - Launchbury, Jones et al. - 1995
BibTeX entry: (Update)
U. A. Acar, G. E. Blelloch, and R. Harper. Selective memoization. In Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 14--25. ACM Press, 2003. http://citeseer.ist.psu.edu/article/acar03selective.html More
@misc{ acar03selective,
author = "U. Acar and G. Blelloch and R. Harper",
title = "Selective memoization",
text = "U. A. Acar, G. E. Blelloch, and R. Harper. Selective memoization. In Proceedings
of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages,
pages 14--25. ACM Press, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/acar03selective.html" }
Citations (may not include all citations):
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1450
The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
408
Princeton University Press (context) - Bellman - 1957
359
The Implementation of Functional Programming Languages (context) - Jones - 1987
95
A Basis for a Mathematical Theory of Computation
- McCarthy - 1963
84
Mathematical Structures in Computer Science (context) - Pfenning, Davies et al. - 2001
81
Specification and Transformation of Programs--A Formal Appro.. (context) - Partsch - 1990
74
memo' functions and machine learning (context) - Michie - 1968
68
Incremental computation via function caching (context) - Pugh - 1987
68
Incremental computation via function caching (context) - Pugh, Teitelbaum - 1989
64
Tabulation techniques for recursive programs (context) - Bird - 2002
59
Lazy memo-functions (context) - Hughes - 1985
43
Natural deduction for intuitionistic non-commutative linear ..
- Polakow, Pfenning - 1999
38
Analysis and caching of dependencies
- Abadi, Lampson et al. - 1996
38
Structural cut elimination
- Pfenning - 1995
33
Dynamic programming via static incrementalization
- Liu, Stoller - 1999
30
ACM Transactions on Programming Languages and Systems (context) - Cohen, recursive - 1983
29
Incremental reduction in the lambda calculus (context) - Field, Teitelbaum - 1990
26
Incremental evaluation of attribute grammars with applicatio.. (context) - Demers, Reps et al. - 1981
23
Adaptive functional programming
- Acar, Blelloch et al. - 2002
21
Alphonse: incremental computation as a programming abstracti.. (context) - Hoover - 1992
16
ACM Transactions on Programming Languages and Systems (context) - Liu, Stoller et al. - 1998
16
Anatomy of LISP (context) - Allen - 1978
16
Caching function calls using precise dependencies
- Heydon, Levin et al. - 2000
15
Hash-consing garbage collection
- Appel, Goncalves - 1993
15
Using cached functions and constructors for incremental attr.. (context) - Pennings, Swierstra et al. - 1992
14
Automating program speedup by deciding what to cache (context) - Mostov, Cohen - 1985
11
Techniques for automatic memoization with applications to co.. (context) - Norvig - 1991
11
Incremental compilation via partial evaluation (context) - Sundaresh, Hudak - 1991
10
Technical Report CMU-CS (context) - Murphy, Harper et al. - 2002
10
An example of hierarchical design and proof (context) - Spitzen, Levitt - 1978
9
Generating Incremental Attribute Evaluators (context) - Pennings - 1994
8
An improved replacement strategy for function caching (context) - Pugh - 1988
8
Automating derivation of incremental programs (context) - Zhang, Liu - 1998
6
Hashing lemmas on time complexities with applications to for.. (context) - Goto, Kanada - 1976
5
Elimination of recursive calls using a small table of random.. (context) - Hilden - 1976
5
Computer Science Department (context) - Acar, Blelloch et al. - 2002
Documents on the same site (http://www-2.cs.cmu.edu/afs/cs.cmu.edu/user/guyb/www/pubs.html): More
Space-Efficient Finger Search on Degree-Balanced Search.. - Blelloch, Maggs, Leung, Woo (2003)
(Correct)
Compact Representations of Separable Graphs - Blandford, Blelloch, Kash (2003)
(Correct)
A Provably Time-Efficient Parallel Implementation of Full.. - Greiner, Blelloch (1996)
(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