Commit f6772feb authored by simonpj's avatar simonpj
Browse files

[project @ 2000-03-30 13:46:54 by simonpj]

Document hoisting foralls
parent 9a3395bd
......@@ -2078,6 +2078,53 @@ rank-2 types as applied to data constructors.
<Sect2 id="hoist">
<Title>Type synonyms and hoisting
GHC also allows you to write a <Literal>forall</Literal> in a type synonym, thus:
type Discard a = forall b. a -> b -> a
f :: Discard a
f x y = x
However, it is often convenient to use these sort of synonyms at the right hand
end of an arrow, thus:
type Discard a = forall b. a -> b -> a
g :: Int -> Discard Int
g x y z = x+y
Simply expanding the type synonym would give
g :: Int -> (forall b. Int -> b -> Int)
but GHC "hoists" the <Literal>forall</Literal> to give the isomorphic type
g :: forall b. Int -> Int -> b -> Int
In general, the rule is this: <Emphasis>to determine the type specified by any explicit
user-written type (e.g. in a type signature), GHC expands type synonyms and then repeatedly
performs the transformation:</Emphasis>
<Emphasis>type1</Emphasis> -> forall a. <Emphasis>type2</Emphasis>
forall a. <Emphasis>type1</Emphasis> -> <Emphasis>type2</Emphasis>
(In fact, GHC tries to retain as much synonym information as possible for use in
error messages, but that is a usability issue.) This rule applies, of course, whether
or not the <Literal>forall</Literal> comes from a synonym. For example, here is another
valid way to write <Literal>g</Literal>'s type signature:
g :: Int -> Int -> forall b. b -> Int
<Sect1 id="existential-quantification">
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment