diff options
| author | Ian Lynagh <igloo@earth.li> | 2007-11-26 19:41:48 +0000 |
|---|---|---|
| committer | Ian Lynagh <igloo@earth.li> | 2007-11-26 19:41:48 +0000 |
| commit | 137f52f48d24fa580ed38c6c923644b3f2daabbf (patch) | |
| tree | e10c2498a89f779523243f4708df2dd101611358 /docs | |
| parent | 3454afa0f32053cf4b06e25f93c36c0612a9d944 (diff) | |
| download | haskell-137f52f48d24fa580ed38c6c923644b3f2daabbf.tar.gz | |
Tweak some URLs
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/index.html | 2 | ||||
| -rw-r--r-- | docs/users_guide/glasgow_exts.xml | 8 |
2 files changed, 5 insertions, 5 deletions
diff --git a/docs/index.html b/docs/index.html index 0fb8c6d66d..4cc4d827b0 100644 --- a/docs/index.html +++ b/docs/index.html @@ -48,7 +48,7 @@ <P>For more information, see the following:</p> <ul> - <li><p><a href="http://www.haskell.org/ghc">GHC Home Page</a></p></li> + <li><p><a href="http://www.haskell.org/ghc/">GHC Home Page</a></p></li> <li><p><a href="http://hackage.haskell.org/trac/ghc/"> GHC Developers Home</a></p></li> </ul> diff --git a/docs/users_guide/glasgow_exts.xml b/docs/users_guide/glasgow_exts.xml index a27a9185c0..0cd97c2326 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). </para> <para> -The web page: <ulink url="http://www.cse.ogi.edu/PacSoft/projects/rmb">http://www.cse.ogi.edu/PacSoft/projects/rmb</ulink> +The web page: <ulink url="http://www.cse.ogi.edu/PacSoft/projects/rmb/">http://www.cse.ogi.edu/PacSoft/projects/rmb/</ulink> contains up to date information on recursive monadic bindings. </para> @@ -2214,7 +2214,7 @@ the type <literal>a</literal> is refined to <literal>Int</literal>. 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 <ulink -url="http://research.microsoft.com/%7Esimonpj/papers/gadt/index.htm">Simple +url="http://research.microsoft.com/%7Esimonpj/papers/gadt/">Simple unification-based type inference for GADTs</ulink>, (ICFP 2006). The general principle is this: <emphasis>type refinement is only carried out @@ -4354,7 +4354,7 @@ Notice here that the <literal>Maybe</literal> type is parameterised by the [a])</literal>. </para> <para>The technical details of this extension are described in the paper -<ulink url="http://research.microsoft.com/%7Esimonpj/papers/boxy">Boxy types: +<ulink url="http://research.microsoft.com/%7Esimonpj/papers/boxy/">Boxy types: type inference for higher-rank types and impredicativity</ulink>, which appeared at ICFP 2006. </para> @@ -4730,7 +4730,7 @@ Type families are enabled by the flag <option>-XTypeFamilies</option>. Haskell. The background to the main technical innovations is discussed in "<ulink -url="http://research.microsoft.com/~simonpj/papers/meta-haskell"> +url="http://research.microsoft.com/~simonpj/papers/meta-haskell/"> Template Meta-programming for Haskell</ulink>" (Proc Haskell Workshop 2002). </para> <para> |