Signed-off-by: Arash Rouhani
---
docs/users_guide/glasgow_exts.xml | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/docs/users_guide/glasgow_exts.xml b/docs/users_guide/glasgow_exts.xml
index a8057a6..43fa155 100644
--- a/docs/users_guide/glasgow_exts.xml
+++ b/docs/users_guide/glasgow_exts.xml
@@ -272,7 +272,7 @@ If the types of <literal>p</literal> and <literal>q</literal> are not unboxed,
the resulting binding is lazy like any other Haskell pattern binding. The
above example desugars like this:
<programlisting>
- f x = let t = case h x o f{ (# p,q #) -> (p,q)
+ f x = let t = case h x of { (# p,q #) -> (p,q) }
p = fst t
q = snd t
in ..body..
--
1.8.1.2
