Selective memoization (2003)
Cached
Download Links
- [ttic.uchicago.edu]
- [ttic.uchicago.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [www.aladdin.cs.cmu.edu]
- [pag.lcs.mit.edu]
- [pag.csail.mit.edu]
- [www-2.cs.cmu.edu]
- [www-2.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www-2.cs.cmu.edu]
- [www.cs.cmu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 30th Annual ACM Symposium on Principles of Programming Languages |
| Citations: | 40 - 18 self |
BibTeX
@INPROCEEDINGS{Acar03selectivememoization,
author = {Umut A. Acar and Guy E. Blelloch and Robert Harper},
title = {Selective memoization},
booktitle = {In Proceedings of the 30th Annual ACM Symposium on Principles of Programming Languages},
year = {2003},
pages = {14--25},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. The language is based on a modal type system and allows the programmer to express programs that reveal their true data dependences when executed. The SML implementation cannot support this modal type system statically, but instead employs run-time checks to ensure correct usage of primitives.
