Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in / Register
Toggle navigation
Menu
Open sidebar
Glasgow Haskell Compiler
GHC
Commits
3a826182
Commit
3a826182
authored
Nov 26, 2012
by
Gabor Greif
💬
Browse files
typos in note
parent
69605562
Changes
1
Hide whitespace changes
Inline
Side-by-side
compiler/types/Kind.lhs
View file @
3a826182
%
% (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
How
e
ver, 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 gen
r
eate a newtype, which in turn
For this single-method class we may gene
r
ate 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 *.
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment