diff options
| author | Brian Wignall <brianwignall@gmail.com> | 2019-12-19 09:11:42 -0500 |
|---|---|---|
| committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2020-01-04 15:55:06 -0500 |
| commit | 3c9dc06ba2034e867c9169e60e854539875654fd (patch) | |
| tree | f06e599ca380ee9ad599918b2ae4c78cd4afce2b /libraries/base/GHC/List.hs | |
| parent | b2e0323f318959c879629ef277f6433b44473c4b (diff) | |
| download | haskell-3c9dc06ba2034e867c9169e60e854539875654fd.tar.gz | |
Fix typos, via a Levenshtein-style corrector
Diffstat (limited to 'libraries/base/GHC/List.hs')
| -rw-r--r-- | libraries/base/GHC/List.hs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/libraries/base/GHC/List.hs b/libraries/base/GHC/List.hs index 65fa4f54a5..ba5229f9cb 100644 --- a/libraries/base/GHC/List.hs +++ b/libraries/base/GHC/List.hs @@ -425,7 +425,7 @@ The type of (g :: (a -> b -> b) -> b -> b) allows us to apply parametricity: Either the tuple is returned (trivial), or scanrFB is called: g (scanrFB f c) (q0,n) = scanrFB ... (g' (scanrFB f c) (q0,n)) Notice that thanks to the strictness of scanrFB, the expression -g' (scanrFB f c) (q0,n) gets evaluated aswell. In particular, if g' is a +g' (scanrFB f c) (q0,n) gets evaluated as well. In particular, if g' is a recursive case of g, parametricity applies again and we will again have a possible call to scanrFB. In short, g (scanrFB f c) (q0,n) will end up being completely evaluated. This is resource consuming for large lists and if the |