summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorLeif Metcalf <me@leif.nz>2019-10-26 09:31:51 +1300
committerMarge Bot <ben+marge-bot@smart-cactus.org>2019-11-04 03:41:09 -0500
commit5d4f16eed151caddf4624ff0a1fc23d5a4475957 (patch)
tree004f0afd297945c1134a825e2dc5fd09f9d39453
parent3b65655c4cef5407829ed41707c48be2f8b3b340 (diff)
downloadhaskell-5d4f16eed151caddf4624ff0a1fc23d5a4475957.tar.gz
Rephrase note on full-laziness
-rw-r--r--docs/users_guide/using-optimisation.rst13
1 files changed, 6 insertions, 7 deletions
diff --git a/docs/users_guide/using-optimisation.rst b/docs/users_guide/using-optimisation.rst
index a8fd5e2d39..758bae39e0 100644
--- a/docs/users_guide/using-optimisation.rst
+++ b/docs/users_guide/using-optimisation.rst
@@ -459,13 +459,12 @@ by saying ``-fno-wombat``.
residency.
.. note::
- GHC doesn't implement complete full-laziness. When
- optimisation in on, and ``-fno-full-laziness`` is not given, some
- transformations that increase sharing are performed, such as
- extracting repeated computations from a loop. These are the same
- transformations that a fully lazy implementation would do, the
- difference is that GHC doesn't consistently apply full-laziness, so
- don't rely on it.
+ GHC doesn't implement complete full laziness. Although GHC's
+ full-laziness optimisation does enable some transformations
+ which would be performed by a fully lazy implementation (such as
+ extracting repeated computations from loops), these
+ transformations are not applied consistently, so don't rely on
+ them.
.. ghc-flag:: -ffun-to-thunk
:shortdesc: Allow worker-wrapper to convert a function closure into a thunk