diff options
author | Ömer Sinan Ağacan <omeragacan@gmail.com> | 2017-04-10 18:38:31 +0300 |
---|---|---|
committer | Ömer Sinan Ağacan <omeragacan@gmail.com> | 2017-04-10 18:38:31 +0300 |
commit | b1acb167b93f62eefab3f8cb24518eb0ce410d8c (patch) | |
tree | 1c854076400b07876d37f847ec04cb5154764658 | |
parent | ddc05912565aedd6ef46236906fa06cdb3e5e06c (diff) | |
download | haskell-b1acb167b93f62eefab3f8cb24518eb0ce410d8c.tar.gz |
Typos in bang patterns user manual [skip ci]
-rw-r--r-- | docs/users_guide/glasgow_exts.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/docs/users_guide/glasgow_exts.rst b/docs/users_guide/glasgow_exts.rst index e411c8855e..9d1ca195cc 100644 --- a/docs/users_guide/glasgow_exts.rst +++ b/docs/users_guide/glasgow_exts.rst @@ -12102,7 +12102,7 @@ Replace the "Translation" there with the following one. Given Replace any binding ``p = e``, where ``p`` is not a variable, with ``v = e; x1 = case v of p -> x1; ...; xn = case v of p -> xn``, where ``v`` is fresh and ``x1``.. ``xn`` are the bound variables of ``p``. - Again if ``e`` is a variable, you can optimised his by not introducing a + Again if ``e`` is a variable, this can be optimised by not introducing a fresh variable. The result will be a (possibly) recursive set of bindings, binding @@ -12112,7 +12112,7 @@ non-recursive using ``fix``, but we do not do so in Core, and it only obfuscates matters, so we do not do so here.) The translation is carefully crafted to make bang patterns meaningful -for reursive and polymorphic bindings as well as straightforward +for recursive and polymorphic bindings as well as straightforward non-recursive bindings. Here are some examples of how this translation works. The first |