Repository : ssh://darcs.haskell.org//srv/darcs/ghc

On branch  : master

http://hackage.haskell.org/trac/ghc/changeset/3a8261827fd9e66251a4a8bf91a22ae075bfdcb9

>---------------------------------------------------------------

commit 3a8261827fd9e66251a4a8bf91a22ae075bfdcb9
Author: Gabor Greif <ggr...@gmail.com>
Date:   Mon Nov 26 16:04:33 2012 +0100

    typos in note

>---------------------------------------------------------------

 compiler/types/Kind.lhs |    6 +++---
 1 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/compiler/types/Kind.lhs b/compiler/types/Kind.lhs
index 6ce2dd9..2041508 100644
--- a/compiler/types/Kind.lhs
+++ b/compiler/types/Kind.lhs
@@ -1,5 +1,5 @@
 %
-% (c) The University of Glasgow 2006
+% (c) The University of Glasgow 2006-2012
 %
 
 \begin{code}
@@ -80,11 +80,11 @@ The special thing about types of kind Constraint is that
    engine inserts an extra argument of type (Ord a) at every call site
    to f.
 
-Howver, once type inference is over, there is *no* distinction between 
+However, once type inference is over, there is *no* distinction between 
 Constraint and *.  Indeed we can have coercions between the two. Consider
    class C a where
      op :: a -> a
-For this single-method class we may genreate a newtype, which in turn 
+For this single-method class we may generate a newtype, which in turn 
 generates an axiom witnessing
     Ord a ~ (a -> a)
 so on the left we have Constraint, and on the right we have *.



_______________________________________________
Cvs-ghc mailing list
Cvs-ghc@haskell.org
http://www.haskell.org/mailman/listinfo/cvs-ghc

Reply via email to