From 6b561ea68eab3d0a1f09ef587a37b70f81b637ba Mon Sep 17 00:00:00 2001
From: Daniel Fischer <daniel.is.fischer@googlemail.com>
Date: Tue, 31 May 2011 12:38:54 +0200
Subject: [PATCH 2/3] One more in glasgow_exts.xml

---
 docs/users_guide/glasgow_exts.xml |    2 +-
 1 files changed, 1 insertions(+), 1 deletions(-)

diff --git a/docs/users_guide/glasgow_exts.xml b/docs/users_guide/glasgow_exts.xml
index 803d64e..3d9496a 100644
--- a/docs/users_guide/glasgow_exts.xml
+++ b/docs/users_guide/glasgow_exts.xml
@@ -7518,7 +7518,7 @@ That leaves let expressions, whose translation is given in
 of the Haskell Report.
 In the translation box, first apply
 the following transformation:  for each pattern <literal>pi</literal> that is of
-form <literal>!qi = ei</literal>, transform it to <literal>(xi,!qi) = ((),ei)</literal>, and and replace <literal>e0</literal>
+form <literal>!qi = ei</literal>, transform it to <literal>(xi,!qi) = ((),ei)</literal>, and replace <literal>e0</literal>
 by <literal>(xi `seq` e0)</literal>.  Then, when none of the left-hand-side patterns
 have a bang at the top, apply the rules in the existing box.
 </para>
-- 
1.7.1