summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorBen Gamari <ben@smart-cactus.org>2015-11-26 00:21:13 +0100
committerBen Gamari <ben@smart-cactus.org>2015-11-26 00:33:52 +0100
commit2ee1e694b63846b179712ecd3aa019aea0a8b5cd (patch)
tree8a093decd9b0dc5f8304b4eb0bafb446dc57059d
parentbc977c220eb5f25958bed58a0d4d7146e1208abb (diff)
downloadhaskell-2ee1e694b63846b179712ecd3aa019aea0a8b5cd.tar.gz
users guide: Add note about #11108 to bugs section
-rw-r--r--docs/users_guide/bugs.xml8
1 files changed, 8 insertions, 0 deletions
diff --git a/docs/users_guide/bugs.xml b/docs/users_guide/bugs.xml
index 3eb5304221..858291ffc5 100644
--- a/docs/users_guide/bugs.xml
+++ b/docs/users_guide/bugs.xml
@@ -564,6 +564,14 @@ checking for duplicates. The reason for this is efficiency, pure and simple.
</para>
</listitem>
+ <listitem>
+ <para>There is known to be maleficent interactions between weak
+ references and laziness. Particularly, it has been observed that placing a thunk
+ containing a reference to a weak reference inside of another weak reference may
+ cause runtime crashes. See <ulink
+ href="https://ghc.haskell.org/trac/ghc/ticket/11108">Trac #11108</ulink>
+ for details.</para>
+ </listitem>
</itemizedlist>
</sect2>