W. Pugh
T. Teitelbaum
- ACR+87.B. All~.~m, A. Carle, B.Rosen, P. Sweeney, and K. Zadeck. lncr~tal evalaution of attributed graphs. Technical Report RC 13205, IBM, Thomas J. Watson Research Center, Yorktown Heights, New York 10598, October 1987.Google Scholar
- All78.John Allen, Anatomy of LISP, McGraw Hill Book Company, NY, 1978. Google ScholarDigital Library
- DRT81.Alan Demers, Thomas Reps and Tim Teitelbaum. Incremental evaluation of attribute gramraars with application to syntax-directed editor.~. PROC of the Eighth POPL, pages 105-116, 1981. Google ScholarDigital Library
- Hoo86.Roger Hoover, Dynamically bypassing copy rules in attribute grammar. PROC of Thirteenth POPL~. pages 14-25, 1986. Google ScholarDigital Library
- Hoo87.Roger Hoover, Incremental Graph Evaluation. Ph.D. Thesis, Cornell University, 1987. Google ScholarDigital Library
- HT86.Susan Horowitz and Tim Teitelbaum, Generating editing environments based on relations and attributes. TOPLAS, pages 577-608, 1986. Google ScholarDigital Library
- Kat84.Takuya Katayama. Translation of attribute grammars into procedures. TOPLAS, 6(3):345- 369, July 1984. Google ScholarDigital Library
- Knu73.Donald Knuth, Sorting and Searching, The Art of Computer Programming, Vol. 3,1973.Google Scholar
- Meh84.Kurt Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. Springer-Verlag, 1984.Google Scholar
- Mic68.D. Michie. "Memo" functions and machine learniing. Nature, (218):19-22, April 1968.Google Scholar
- Par78.Luis {sidoro Trabb Pardo, Set Representation and Set Intersection, Ph.D. thesis, Stanford University, 1978Google Scholar
- Pug88a.William Pugh. An improved Cache Replacement Strategy for Function Caching. PROC of the ACM Conf on LisF and Functional Programming, pages 269-~76, 1988. Google ScholarDigital Library
- Pug88b.William Pugh, Incremental Computation and the Incremental Evaluation of Functional Programming. Ph.D. Thesis, Cornell University, 1988. Google ScholarDigital Library
- RA84.Thomas W. Reps and Bowen AIpern. Interactive proof checking. PROC of the Eleventh POPL, pages 36-45, 1984. Google ScholarDigital Library
- Rep82.Thomas Reps, Optimal-time incremental semantic analysis for syntax-directed editors. PROC of the Ninth POPL, pages 169-176,1982. Google ScholarDigital Library
- Rep84.Thomas W. Reps. Generating Language-Based Environments. The MIT Press, Cambridge Massachusetts, I984. Google ScholarDigital Library
- SG76.M. Sassa and E. Goto, A hashing method for fast set operations. Inf. Proc. l.~t. 5(2):31-34, June 1976.Google ScholarCross Ref
- TK84.H. Taylor and S. Karlin. An Introduction to Stochastic Modeling, Academic Press, Orlando, Florida, 1984.Google Scholar
- YS88.D. YeUin and R. Strom. INC: a Language for Incremental Computations. SIGPLAN "88 Conference on Programming Language Design and Implmentation, pages 115-124, 1988. Google ScholarDigital Library
Index Terms
- Incremental computation via function caching
Recommendations
Incremental computation with names
OOPSLA 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and ApplicationsOver the past thirty years, there has been significant progress in developing general-purpose, language-based approaches to incremental computation, which aims to efficiently update the result of a computation when an input is changed. A key design ...
Static caching for incremental computation
A systematic approach is given for deriving incremental programs that exploit caching. The cache-and-prune method presented in the article consists of three stages: (I) the original program is extended to cache the results of all its intermediate ...
Selective Victim Caching: A Method to Improve the Performance of Direct-Mapped Caches
Although direct-mapped caches suffer from higher miss ratios as compared to set-associative caches, they are attractive for today's high-speed pipelined processors that require very low access times. Victim caching was proposed by Jouppi [1] as an ...
Comments