Title
Applicative caching: Programmer control of object sharing and lifetime in. distributed implementations of applicative languages
Abstract
The “referential transparency” of applicative language expressions demands that all occurrences of an expression in a given context yield the same value. In principle, that value therefore needs to be computed only once. However, in recursive programming, a context usually unfolds dynamically, precluding textual recognition of multiple occurrences, so that such occurrences are recomputed. To remedy the lack, in applicative languages, of an ability to store and retrieve a computed value under programmer control, “caching functionals” are proposed which allow the programmer to selectively avoid recomputation without overt use of assignment. The uses and implementation of such mechanisms are discussed, including reasons and techniques for purging the underlying cache. Our approach is an extension of the early notion of “memo function”, enabling improved space utilization and a “building-block” approach.
Year
DOI
Venue
1981
10.1145/800223.806772
FPCA
Field
DocType
ISBN
Programming language,Programmer,Program transformation,Functional programming,Expression (mathematics),Computer science,Cache,Theoretical computer science,Implementation,Animation,Object sharing
Conference
0-89791-060-5
Citations 
PageRank 
References 
9
2.94
7
Authors
2
Name
Order
Citations
PageRank
Robert M. Keller1576216.07
M. Ronan Sleep217831.24