Stretching the storage manager: weak pointers and stable names in Haskell (1999)
Cached
Download Links
- [www.haskell.org]
- [research.microsoft.com]
- [research.microsoft.com]
- [www.research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Citations: | 34 - 2 self |
BibTeX
@MISC{Jones99stretchingthe,
author = {Simon Peyton Jones and Simon Marlow and Conal Elliott},
title = {Stretching the storage manager: weak pointers and stable names in Haskell},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. Every now and then, a user of the Glasgow Haskell Compiler asks for a feature that requires specialised support from the storage manager. Memo functions, pointer equality, external pointers, nalizers, and weak pointers, are all examples. We take memo functions as our exemplar because they turn out to be the trickiest to support. We present no fewer than four distinct mechanisms that are needed to support memo tables, and that (in various combinations) satisfy a variety of other needs. The resulting set of primitives is undoubtedly powerful and useful. Whether they are too powerful is not yet clear. While the focus of our discussion is on Haskell, there is nothing Haskell-specic about most of the primitives, which could readily be used in other settings. 1 Introduction \Given an arbitrary function f, construct a memoised version of f; that is, construct a new function with the property that it returns exactly the same results as f, but if it is applied a second time to ...
