X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=docs%2Fusers_guide%2Fglasgow_exts.xml;h=0cd97c23261bad4d42179468150c856fa0404d9f;hb=137f52f48d24fa580ed38c6c923644b3f2daabbf;hp=a27a9185c02ba09becdfc3dfefaca8efc09bdf08;hpb=d322953f9d4d57faf533227c79ec029d4174e904;p=ghc-hetmet.git
diff --git a/docs/users_guide/glasgow_exts.xml b/docs/users_guide/glasgow_exts.xml
index a27a918..0cd97c2 100644
--- a/docs/users_guide/glasgow_exts.xml
+++ b/docs/users_guide/glasgow_exts.xml
@@ -993,7 +993,7 @@ and improve termination (Section 3.2 of the paper).
-The web page: http://www.cse.ogi.edu/PacSoft/projects/rmb
+The web page: http://www.cse.ogi.edu/PacSoft/projects/rmb/
contains up to date information on recursive monadic bindings.
@@ -2214,7 +2214,7 @@ the type a is refined to Int. That's the
A precise specification of the type rules is beyond what this user manual aspires to,
but the design closely follows that described in
the paper Simple
+url="http://research.microsoft.com/%7Esimonpj/papers/gadt/">Simple
unification-based type inference for GADTs,
(ICFP 2006).
The general principle is this: type refinement is only carried out
@@ -4354,7 +4354,7 @@ Notice here that the Maybe type is parameterised by the
[a]).
The technical details of this extension are described in the paper
-Boxy types:
+Boxy types:
type inference for higher-rank types and impredicativity,
which appeared at ICFP 2006.
@@ -4730,7 +4730,7 @@ Type families are enabled by the flag .
Haskell.
The background to
the main technical innovations is discussed in "
+url="http://research.microsoft.com/~simonpj/papers/meta-haskell/">
Template Meta-programming for Haskell" (Proc Haskell Workshop 2002).