File tree Expand file tree Collapse file tree 2 files changed +14
-0
lines changed
libraries/base/System/Mem Expand file tree Collapse file tree 2 files changed +14
-0
lines changed Original file line number Diff line number Diff line change 22
22
-- collector, meaning a re-hash would be necessary after every garbage
23
23
-- collection.
24
24
--
25
+ -- See [Stretching the storage manager: weak pointers and stable names in
26
+ -- Haskell](https://www.microsoft.com/en-us/research/publication/stretching-the-storage-manager-weak-pointers-and-stable-names-in-haskell/)
27
+ -- by Simon Peyton Jones, Simon Marlow and Conal Elliott for detailed discussion
28
+ -- of stable names. An implementation of a memo table with stable names
29
+ -- can be found in [@stable-memo@](https://hackage.haskell.org/package/stable-memo)
30
+ -- package.
31
+ --
25
32
-------------------------------------------------------------------------------
26
33
27
34
module System.Mem.StableName (
Original file line number Diff line number Diff line change 47
47
-- generalisation of the basic weak-pointer idea, in which each
48
48
-- weak pointer actually contains both a key and a value.
49
49
--
50
+ -- See [Stretching the storage manager: weak pointers and stable names in
51
+ -- Haskell](https://www.microsoft.com/en-us/research/publication/stretching-the-storage-manager-weak-pointers-and-stable-names-in-haskell/)
52
+ -- by Simon Peyton Jones, Simon Marlow and Conal Elliott for detailed discussion
53
+ -- of weak pointers. An implementation of a memo table with weak pointers
54
+ -- can be found in [@stable-memo@](https://hackage.haskell.org/package/stable-memo)
55
+ -- package.
56
+ --
50
57
-----------------------------------------------------------------------------
51
58
52
59
module System.Mem.Weak (
You can’t perform that action at this time.
0 commit comments