Selective memoization

ACM SIGPLAN Notices

Volumn 38, Issue 1, 2003, Pages 14-25

  Acar, Umut A ^a   Blelloch, Guy E ^a   Harper, Robert ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Memoization; Performance; Programmer controlled; Selective

Indexed keywords

ALGORITHMS; BUFFER STORAGE; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; DIGITAL LIBRARIES; DYNAMIC PROGRAMMING; FORMAL LANGUAGES; SEMANTICS;

APPLICATION-SPECIFIC SUPPORT CODE; FUNCTIONAL LANGUAGE; QUICKSORT; RUN-TIME CHECKS;

SGML;

EID: 1442314607     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/640128.604133     Document Type: Article

References (37)

1. M. Abadi, B. W. Lampson, and J.-J. Levy. Analysis and caching of dependencies. In International Conference on Functional Programming, pages 83-91, 1996.
2. U. A. Acar, G. E. Blelloch, and R. Harper. Adaptive functional programming. In Proceedings of the Twenty-ninth Annual ACM-SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Jan. 2002.
3. U. A. Acar, G. E. Blelloch, and R. Harper. Selective memorization. Technical Report CMU-CS-02-194, Carnegie Mellon University, Computer Science Department, Dec. 2002.
4. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
5. J. Allen. Anatomy of LISP. McGraw-Hill, 1978.
6. A. W. Appel and J. R. Gonçalves. Hash-consing garbage collection. Technical Report CS-TR-412-93, Princeton University, Computer Science Department, 1993.
7. R. Bellman. Dynamic Programming. Princeton University Press, 1957.
8. R. S. Bird. Tabulation techniques for recursive programs. ACM Computing Surveys, 12(4): 403-417, Dec. 2002.
9. N. H. Cohen. Eliminating redundant recursive calls. ACM Transactions on Programming Languages and Systems, 5(3):265-299, July 1983.
10. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press/McGraw-Hill, 1990.
11. A. Demers, T. Reps, and T. Teitelbaum. Incremental evaluation of attribute grammars with application to syntax directed editors. In Conference Record of the 8th Annual ACM Symposium on POPL, pages 105-116, Jan. 1981.
12. J. Field and T. Teitelbaum. Incremental reduction in the lambda calculus. In Proceedings of the ACM '90 Conference on LISP and Functional Programming, pages 307-322, June 1990.
13. E. Goto and Y. Kanada. Hashing lemmas on time complexities with applications to formula manipulation. In Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, pages 154-158, 1976.
14. A. Heydon, R. Levin, and Y. Yu. Caching function calls using precise dependencies. ACM SIGPLAN Notices, 35(5):311-320, 2000.
15. J. Hilden. Elimination of recursive calls using a small table of randomly selected function values. BIT, 16(1):60-73, 1976.
16. R. Hoover. Alphonse: incremental computation as a programming abstraction. In Proceedings of the 5th ACM SIGPLAN conference on Programming language design and implementation, pages 261-272. ACM Press, 1992.
17. R. J. M. Hughes. Lazy memo-functions. In Proceedings 1985 Conference on Functional Programming Languages and Computer Architecture, 1985.
18. S. P. Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987.
19. Y. A. Liu and S. D. Stoller. Dynamic programming via static incrementalization. In European Symposium on Programming, pages 288-305, 1999.
20. Y. A. Liu, S. D. Stoller, and T. Teitelbaum. Static caching for incremental computation. ACM Transactions on Programming Languages and Systems, 20(3):546-585, 1 May 1998.
21. J. McCarthy. A Basis for a Mathematical Theory of Computation. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems, pages 33 70. North-Holland, Amsterdam, 1963.
22. D. Mitchie. 'memo' functions and machine learning. Nature, 218, 19-22, 1968.
23. J. Mostov and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 165-172, Aug. 1985.
24. T. Murphy, R. Harper, and K. Crary. The wizard of TILT: Efficient(?), convenient and abstract type representations. Technical Report CMU-CS-02-120, School of Computer Science, Carnegie Mellon University, Mar. 2002.
25. P. Norvig. Techniques for automatic memoization with applications to context-free parsing. Computational Linguistics, pages 91-98, 1991.
26. H. A. Partsch. Specification and Transformation of Programs - A Formal Approach to Software Development. Springer-Verlag, 1990.
27. M. Pennings. Generating Incremental Attribute Evaluators. PhD thesis, University of Utrecht, Nov. 1994.
28. M. Pennings, S. D. Swierstra, and H. Vogt. Using cached functions and constructors for incremental attribute evaluation. In Seventh International Symposium on Programming Languages, Implementations, Logics and Programs, pages 130-144, 1992.
29. E. Pfenning. Structural cut elimination. In D. Kozen, editor, Proceedings of the Tenth Annual Symposium on Logic in Computer Science, pages 156-166. Computer Society Press, 1995.
30. F. Pfenning and R. Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
31. J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-cumulative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 130-144. Springer-Verlag LNCS 1581, 1999.
32. W. Pugh. Incremental computation via function caching. PhD thesis, Department of Computer Science, Cornell University, 1987.
33. W. Pugh. An improved replacement strategy for function caching. In Proceedings of the 1998 ACM conference on LISP and functional programming, pages 269-276. ACM Press, 1988.
34. W. Pugh and T. Teitelbaum. Incremental computation via function caching. In Conference Record of the 16th Annual Symposium on POPL, pages 315-328, Jan. 1989.
35. J. M. Spitzen and K. N. Levitt. An example of hierarchical design and proof. Communications of the ACM, 21(12):1064-1075, 1978.
36. R. S. Sundaresh and P. Hudak. Incremental compilation via partial evaluation. In Conference Record of the 18th Annual ACM Symposium on POPL, pages 1-13, Jan. 1991.
37. Y. Zhang and Y. A. Liu. Automating derivation of incremental programs. In Proceedings of the Third ACM SIGPLAN international conference on Functional programming, page 350, ACM Press, 1998.