Incremental computation via function caching
William Pugh, Tim Teitelbaum · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1989
Article Free Access Share on Incremental computation via function caching Authors: W. Pugh Dept. of Computer Science, Cornell University, Ithaca, NY and Dept. of Comp. Sci., Univ. of Maryland, College Park, Md. Dept. of Computer Science, Cornell University, Ithaca, NY and Dept. of Comp. Sci., Univ. of Maryland, College Park, Md.View Profile , T. Teitelbaum Dept. of Computer Science, Cornell University, Ithaca, NY Dept. of Computer Science, Cornell University, Ithaca, NYView Profile Authors Info & Claims POPL '89: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 1989 Pages 315–328https://doi.org/10.1145/75277.75305Published:03 January 1989Publication History 138citation969DownloadsMetricsTotal Citations138Total Downloads969Last 12 Months130Last 6 weeks25 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cited by 195 works. doi:10.1145/75277.75305
Authors
References
- Sorting and Searching
- An Introduction to Stochastic Modeling
- “Memo” Functions and Machine Learning
- Data Structures and Algorithms 1: Sorting and Searching
- Generating Language-Based Environments
- Anatomy of LISP
- Incremental evaluation for attribute grammars with application to syntax-directed editors
- Optimal-time incremental semantic analysis for syntax-directed editors
- Generating editing environments based on relations and attributes
- A hashing method for fast set operations