1 <?xml version="1.0" encoding="iso-8859-1"?>
3 <indexterm><primary>language, GHC</primary></indexterm>
4 <indexterm><primary>extensions, GHC</primary></indexterm>
5 As with all known Haskell systems, GHC implements some extensions to
6 the language. They are all enabled by options; by default GHC
7 understands only plain Haskell 98.
11 Some of the Glasgow extensions serve to give you access to the
12 underlying facilities with which we implement Haskell. Thus, you can
13 get at the Raw Iron, if you are willing to write some non-portable
14 code at a more primitive level. You need not be “stuck”
15 on performance because of the implementation costs of Haskell's
16 “high-level” features—you can always code
17 “under” them. In an extreme case, you can write all your
18 time-critical code in C, and then just glue it together with Haskell!
22 Before you get too carried away working at the lowest level (e.g.,
23 sloshing <literal>MutableByteArray#</literal>s around your
24 program), you may wish to check if there are libraries that provide a
25 “Haskellised veneer” over the features you want. The
26 separate <ulink url="../libraries/index.html">libraries
27 documentation</ulink> describes all the libraries that come with GHC.
30 <!-- LANGUAGE OPTIONS -->
31 <sect1 id="options-language">
32 <title>Language options</title>
34 <indexterm><primary>language</primary><secondary>option</secondary>
36 <indexterm><primary>options</primary><secondary>language</secondary>
38 <indexterm><primary>extensions</primary><secondary>options controlling</secondary>
41 <para>The language option flag control what variation of the language are
42 permitted. Leaving out all of them gives you standard Haskell
45 <para>Generally speaking, all the language options are introduced by "<option>-X</option>",
46 e.g. <option>-XTemplateHaskell</option>.
49 <para> All the language options can be turned off by using the prefix "<option>No</option>";
50 e.g. "<option>-XNoTemplateHaskell</option>".</para>
52 <para> Language options recognised by Cabal can also be enabled using the <literal>LANGUAGE</literal> pragma,
53 thus <literal>{-# LANGUAGE TemplateHaskell #-}</literal> (see <xref linkend="language-pragma"/>>). </para>
55 <para>Turning on an option that enables special syntax
56 <emphasis>might</emphasis> cause working Haskell 98 code to fail
57 to compile, perhaps because it uses a variable name which has
58 become a reserved word. So, together with each option below, we
59 list the special syntax which is enabled by this option. We use
60 notation and nonterminal names from the Haskell 98 lexical syntax
61 (see the Haskell 98 Report). There are two classes of special
66 <para>New reserved words and symbols: character sequences
67 which are no longer available for use as identifiers in the
71 <para>Other special syntax: sequences of characters that have
72 a different meaning when this particular option is turned
77 <para>We are only listing syntax changes here that might affect
78 existing working programs (i.e. "stolen" syntax). Many of these
79 extensions will also enable new context-free syntax, but in all
80 cases programs written to use the new syntax would not be
81 compilable without the option enabled.</para>
87 <option>-fglasgow-exts</option>:
88 <indexterm><primary><option>-fglasgow-exts</option></primary></indexterm>
91 <para>This simultaneously enables all of the extensions to
92 Haskell 98 described in <xref
93 linkend="ghc-language-features"/>, except where otherwise
94 noted. We are trying to move away from this portmanteau flag,
95 and towards enabling features individaully.</para>
97 <para>New reserved words: <literal>forall</literal> (only in
98 types), <literal>mdo</literal>.</para>
100 <para>Other syntax stolen:
101 <replaceable>varid</replaceable>{<literal>#</literal>},
102 <replaceable>char</replaceable><literal>#</literal>,
103 <replaceable>string</replaceable><literal>#</literal>,
104 <replaceable>integer</replaceable><literal>#</literal>,
105 <replaceable>float</replaceable><literal>#</literal>,
106 <replaceable>float</replaceable><literal>##</literal>,
107 <literal>(#</literal>, <literal>#)</literal>,
108 <literal>|)</literal>, <literal>{|</literal>.</para>
110 <para>Implies these specific language options:
111 <option>-XForeignFunctionInterface</option>,
112 <option>-XImplicitParams</option>,
113 <option>-XScopedTypeVariables</option>,
114 <option>-XGADTs</option>,
115 <option>-XTypeFamilies</option>. </para>
121 <option>-XForeignFunctionInterface</option>:
122 <indexterm><primary><option>-XForeignFunctionInterface</option></primary></indexterm>
125 <para>This option enables the language extension defined in the
126 Haskell 98 Foreign Function Interface Addendum.</para>
128 <para>New reserved words: <literal>foreign</literal>.</para>
134 <option>-XMonomorphismRestriction</option>,<option>-XMonoPatBinds</option>:
137 <para> These two flags control how generalisation is done.
138 See <xref linkend="monomorphism"/>.
145 <option>-XExtendedDefaultRules</option>:
146 <indexterm><primary><option>-XExtendedDefaultRules</option></primary></indexterm>
149 <para> Use GHCi's extended default rules in a regular module (<xref linkend="extended-default-rules"/>).
150 Independent of the <option>-fglasgow-exts</option>
157 <option>-XOverlappingInstances</option>
158 <indexterm><primary><option>-XOverlappingInstances</option></primary></indexterm>
161 <option>-XUndecidableInstances</option>
162 <indexterm><primary><option>-XUndecidableInstances</option></primary></indexterm>
165 <option>-XIncoherentInstances</option>
166 <indexterm><primary><option>-XIncoherentInstances</option></primary></indexterm>
169 <option>-fcontext-stack=N</option>
170 <indexterm><primary><option>-fcontext-stack</option></primary></indexterm>
173 <para> See <xref linkend="instance-decls"/>. Only relevant
174 if you also use <option>-fglasgow-exts</option>.</para>
180 <option>-finline-phase</option>
181 <indexterm><primary><option>-finline-phase</option></primary></indexterm>
184 <para>See <xref linkend="rewrite-rules"/>. Only relevant if
185 you also use <option>-fglasgow-exts</option>.</para>
191 <option>-XArrows</option>
192 <indexterm><primary><option>-XArrows</option></primary></indexterm>
195 <para>See <xref linkend="arrow-notation"/>. Independent of
196 <option>-fglasgow-exts</option>.</para>
198 <para>New reserved words/symbols: <literal>rec</literal>,
199 <literal>proc</literal>, <literal>-<</literal>,
200 <literal>>-</literal>, <literal>-<<</literal>,
201 <literal>>>-</literal>.</para>
203 <para>Other syntax stolen: <literal>(|</literal>,
204 <literal>|)</literal>.</para>
210 <option>-XGenerics</option>
211 <indexterm><primary><option>-XGenerics</option></primary></indexterm>
214 <para>See <xref linkend="generic-classes"/>. Independent of
215 <option>-fglasgow-exts</option>.</para>
220 <term><option>-XNoImplicitPrelude</option></term>
222 <para><indexterm><primary>-XNoImplicitPrelude
223 option</primary></indexterm> GHC normally imports
224 <filename>Prelude.hi</filename> files for you. If you'd
225 rather it didn't, then give it a
226 <option>-XNoImplicitPrelude</option> option. The idea is
227 that you can then import a Prelude of your own. (But don't
228 call it <literal>Prelude</literal>; the Haskell module
229 namespace is flat, and you must not conflict with any
230 Prelude module.)</para>
232 <para>Even though you have not imported the Prelude, most of
233 the built-in syntax still refers to the built-in Haskell
234 Prelude types and values, as specified by the Haskell
235 Report. For example, the type <literal>[Int]</literal>
236 still means <literal>Prelude.[] Int</literal>; tuples
237 continue to refer to the standard Prelude tuples; the
238 translation for list comprehensions continues to use
239 <literal>Prelude.map</literal> etc.</para>
241 <para>However, <option>-XNoImplicitPrelude</option> does
242 change the handling of certain built-in syntax: see <xref
243 linkend="rebindable-syntax"/>.</para>
248 <term><option>-XImplicitParams</option></term>
250 <para>Enables implicit parameters (see <xref
251 linkend="implicit-parameters"/>). Currently also implied by
252 <option>-fglasgow-exts</option>.</para>
255 <literal>?<replaceable>varid</replaceable></literal>,
256 <literal>%<replaceable>varid</replaceable></literal>.</para>
261 <term><option>-XOverloadedStrings</option></term>
263 <para>Enables overloaded string literals (see <xref
264 linkend="overloaded-strings"/>).</para>
269 <term><option>-XScopedTypeVariables</option></term>
271 <para>Enables lexically-scoped type variables (see <xref
272 linkend="scoped-type-variables"/>). Implied by
273 <option>-fglasgow-exts</option>.</para>
278 <term><option>-XTemplateHaskell</option></term>
280 <para>Enables Template Haskell (see <xref
281 linkend="template-haskell"/>). This flag must
282 be given explicitly; it is no longer implied by
283 <option>-fglasgow-exts</option>.</para>
285 <para>Syntax stolen: <literal>[|</literal>,
286 <literal>[e|</literal>, <literal>[p|</literal>,
287 <literal>[d|</literal>, <literal>[t|</literal>,
288 <literal>$(</literal>,
289 <literal>$<replaceable>varid</replaceable></literal>.</para>
296 <!-- UNBOXED TYPES AND PRIMITIVE OPERATIONS -->
297 <sect1 id="primitives">
298 <title>Unboxed types and primitive operations</title>
300 <para>GHC is built on a raft of primitive data types and operations.
301 While you really can use this stuff to write fast code,
302 we generally find it a lot less painful, and more satisfying in the
303 long run, to use higher-level language features and libraries. With
304 any luck, the code you write will be optimised to the efficient
305 unboxed version in any case. And if it isn't, we'd like to know
308 <para>We do not currently have good, up-to-date documentation about the
309 primitives, perhaps because they are mainly intended for internal use.
310 There used to be a long section about them here in the User Guide, but it
311 became out of date, and wrong information is worse than none.</para>
313 <para>The Real Truth about what primitive types there are, and what operations
314 work over those types, is held in the file
315 <filename>fptools/ghc/compiler/prelude/primops.txt.pp</filename>.
316 This file is used directly to generate GHC's primitive-operation definitions, so
317 it is always correct! It is also intended for processing into text.</para>
320 the result of such processing is part of the description of the
322 url="http://haskell.cs.yale.edu/ghc/docs/papers/core.ps.gz">External
323 Core language</ulink>.
324 So that document is a good place to look for a type-set version.
325 We would be very happy if someone wanted to volunteer to produce an SGML
326 back end to the program that processes <filename>primops.txt</filename> so that
327 we could include the results here in the User Guide.</para>
329 <para>What follows here is a brief summary of some main points.</para>
331 <sect2 id="glasgow-unboxed">
336 <indexterm><primary>Unboxed types (Glasgow extension)</primary></indexterm>
339 <para>Most types in GHC are <firstterm>boxed</firstterm>, which means
340 that values of that type are represented by a pointer to a heap
341 object. The representation of a Haskell <literal>Int</literal>, for
342 example, is a two-word heap object. An <firstterm>unboxed</firstterm>
343 type, however, is represented by the value itself, no pointers or heap
344 allocation are involved.
348 Unboxed types correspond to the “raw machine” types you
349 would use in C: <literal>Int#</literal> (long int),
350 <literal>Double#</literal> (double), <literal>Addr#</literal>
351 (void *), etc. The <emphasis>primitive operations</emphasis>
352 (PrimOps) on these types are what you might expect; e.g.,
353 <literal>(+#)</literal> is addition on
354 <literal>Int#</literal>s, and is the machine-addition that we all
355 know and love—usually one instruction.
359 Primitive (unboxed) types cannot be defined in Haskell, and are
360 therefore built into the language and compiler. Primitive types are
361 always unlifted; that is, a value of a primitive type cannot be
362 bottom. We use the convention that primitive types, values, and
363 operations have a <literal>#</literal> suffix.
367 Primitive values are often represented by a simple bit-pattern, such
368 as <literal>Int#</literal>, <literal>Float#</literal>,
369 <literal>Double#</literal>. But this is not necessarily the case:
370 a primitive value might be represented by a pointer to a
371 heap-allocated object. Examples include
372 <literal>Array#</literal>, the type of primitive arrays. A
373 primitive array is heap-allocated because it is too big a value to fit
374 in a register, and would be too expensive to copy around; in a sense,
375 it is accidental that it is represented by a pointer. If a pointer
376 represents a primitive value, then it really does point to that value:
377 no unevaluated thunks, no indirections…nothing can be at the
378 other end of the pointer than the primitive value.
379 A numerically-intensive program using unboxed types can
380 go a <emphasis>lot</emphasis> faster than its “standard”
381 counterpart—we saw a threefold speedup on one example.
385 There are some restrictions on the use of primitive types:
387 <listitem><para>The main restriction
388 is that you can't pass a primitive value to a polymorphic
389 function or store one in a polymorphic data type. This rules out
390 things like <literal>[Int#]</literal> (i.e. lists of primitive
391 integers). The reason for this restriction is that polymorphic
392 arguments and constructor fields are assumed to be pointers: if an
393 unboxed integer is stored in one of these, the garbage collector would
394 attempt to follow it, leading to unpredictable space leaks. Or a
395 <function>seq</function> operation on the polymorphic component may
396 attempt to dereference the pointer, with disastrous results. Even
397 worse, the unboxed value might be larger than a pointer
398 (<literal>Double#</literal> for instance).
401 <listitem><para> You cannot define a newtype whose representation type
402 (the argument type of the data constructor) is an unboxed type. Thus,
408 <listitem><para> You cannot bind a variable with an unboxed type
409 in a <emphasis>top-level</emphasis> binding.
411 <listitem><para> You cannot bind a variable with an unboxed type
412 in a <emphasis>recursive</emphasis> binding.
414 <listitem><para> You may bind unboxed variables in a (non-recursive,
415 non-top-level) pattern binding, but any such variable causes the entire
417 to become strict. For example:
419 data Foo = Foo Int Int#
421 f x = let (Foo a b, w) = ..rhs.. in ..body..
423 Since <literal>b</literal> has type <literal>Int#</literal>, the entire pattern
425 is strict, and the program behaves as if you had written
427 data Foo = Foo Int Int#
429 f x = case ..rhs.. of { (Foo a b, w) -> ..body.. }
438 <sect2 id="unboxed-tuples">
439 <title>Unboxed Tuples
443 Unboxed tuples aren't really exported by <literal>GHC.Exts</literal>,
444 they're available by default with <option>-fglasgow-exts</option>. An
445 unboxed tuple looks like this:
457 where <literal>e_1..e_n</literal> are expressions of any
458 type (primitive or non-primitive). The type of an unboxed tuple looks
463 Unboxed tuples are used for functions that need to return multiple
464 values, but they avoid the heap allocation normally associated with
465 using fully-fledged tuples. When an unboxed tuple is returned, the
466 components are put directly into registers or on the stack; the
467 unboxed tuple itself does not have a composite representation. Many
468 of the primitive operations listed in <literal>primops.txt.pp</literal> return unboxed
470 In particular, the <literal>IO</literal> and <literal>ST</literal> monads use unboxed
471 tuples to avoid unnecessary allocation during sequences of operations.
475 There are some pretty stringent restrictions on the use of unboxed tuples:
480 Values of unboxed tuple types are subject to the same restrictions as
481 other unboxed types; i.e. they may not be stored in polymorphic data
482 structures or passed to polymorphic functions.
489 No variable can have an unboxed tuple type, nor may a constructor or function
490 argument have an unboxed tuple type. The following are all illegal:
494 data Foo = Foo (# Int, Int #)
496 f :: (# Int, Int #) -> (# Int, Int #)
499 g :: (# Int, Int #) -> Int
502 h x = let y = (# x,x #) in ...
509 The typical use of unboxed tuples is simply to return multiple values,
510 binding those multiple results with a <literal>case</literal> expression, thus:
512 f x y = (# x+1, y-1 #)
513 g x = case f x x of { (# a, b #) -> a + b }
515 You can have an unboxed tuple in a pattern binding, thus
517 f x = let (# p,q #) = h x in ..body..
519 If the types of <literal>p</literal> and <literal>q</literal> are not unboxed,
520 the resulting binding is lazy like any other Haskell pattern binding. The
521 above example desugars like this:
523 f x = let t = case h x o f{ (# p,q #) -> (p,q)
528 Indeed, the bindings can even be recursive.
535 <!-- ====================== SYNTACTIC EXTENSIONS ======================= -->
537 <sect1 id="syntax-extns">
538 <title>Syntactic extensions</title>
540 <!-- ====================== HIERARCHICAL MODULES ======================= -->
542 <sect2 id="hierarchical-modules">
543 <title>Hierarchical Modules</title>
545 <para>GHC supports a small extension to the syntax of module
546 names: a module name is allowed to contain a dot
547 <literal>‘.’</literal>. This is also known as the
548 “hierarchical module namespace” extension, because
549 it extends the normally flat Haskell module namespace into a
550 more flexible hierarchy of modules.</para>
552 <para>This extension has very little impact on the language
553 itself; modules names are <emphasis>always</emphasis> fully
554 qualified, so you can just think of the fully qualified module
555 name as <quote>the module name</quote>. In particular, this
556 means that the full module name must be given after the
557 <literal>module</literal> keyword at the beginning of the
558 module; for example, the module <literal>A.B.C</literal> must
561 <programlisting>module A.B.C</programlisting>
564 <para>It is a common strategy to use the <literal>as</literal>
565 keyword to save some typing when using qualified names with
566 hierarchical modules. For example:</para>
569 import qualified Control.Monad.ST.Strict as ST
572 <para>For details on how GHC searches for source and interface
573 files in the presence of hierarchical modules, see <xref
574 linkend="search-path"/>.</para>
576 <para>GHC comes with a large collection of libraries arranged
577 hierarchically; see the accompanying <ulink
578 url="../libraries/index.html">library
579 documentation</ulink>. More libraries to install are available
581 url="http://hackage.haskell.org/packages/hackage.html">HackageDB</ulink>.</para>
584 <!-- ====================== PATTERN GUARDS ======================= -->
586 <sect2 id="pattern-guards">
587 <title>Pattern guards</title>
590 <indexterm><primary>Pattern guards (Glasgow extension)</primary></indexterm>
591 The discussion that follows is an abbreviated version of Simon Peyton Jones's original <ulink url="http://research.microsoft.com/~simonpj/Haskell/guards.html">proposal</ulink>. (Note that the proposal was written before pattern guards were implemented, so refers to them as unimplemented.)
595 Suppose we have an abstract data type of finite maps, with a
599 lookup :: FiniteMap -> Int -> Maybe Int
602 The lookup returns <function>Nothing</function> if the supplied key is not in the domain of the mapping, and <function>(Just v)</function> otherwise,
603 where <varname>v</varname> is the value that the key maps to. Now consider the following definition:
607 clunky env var1 var2 | ok1 && ok2 = val1 + val2
608 | otherwise = var1 + var2
619 The auxiliary functions are
623 maybeToBool :: Maybe a -> Bool
624 maybeToBool (Just x) = True
625 maybeToBool Nothing = False
627 expectJust :: Maybe a -> a
628 expectJust (Just x) = x
629 expectJust Nothing = error "Unexpected Nothing"
633 What is <function>clunky</function> doing? The guard <literal>ok1 &&
634 ok2</literal> checks that both lookups succeed, using
635 <function>maybeToBool</function> to convert the <function>Maybe</function>
636 types to booleans. The (lazily evaluated) <function>expectJust</function>
637 calls extract the values from the results of the lookups, and binds the
638 returned values to <varname>val1</varname> and <varname>val2</varname>
639 respectively. If either lookup fails, then clunky takes the
640 <literal>otherwise</literal> case and returns the sum of its arguments.
644 This is certainly legal Haskell, but it is a tremendously verbose and
645 un-obvious way to achieve the desired effect. Arguably, a more direct way
646 to write clunky would be to use case expressions:
650 clunky env var1 var2 = case lookup env var1 of
652 Just val1 -> case lookup env var2 of
654 Just val2 -> val1 + val2
660 This is a bit shorter, but hardly better. Of course, we can rewrite any set
661 of pattern-matching, guarded equations as case expressions; that is
662 precisely what the compiler does when compiling equations! The reason that
663 Haskell provides guarded equations is because they allow us to write down
664 the cases we want to consider, one at a time, independently of each other.
665 This structure is hidden in the case version. Two of the right-hand sides
666 are really the same (<function>fail</function>), and the whole expression
667 tends to become more and more indented.
671 Here is how I would write clunky:
676 | Just val1 <- lookup env var1
677 , Just val2 <- lookup env var2
679 ...other equations for clunky...
683 The semantics should be clear enough. The qualifiers are matched in order.
684 For a <literal><-</literal> qualifier, which I call a pattern guard, the
685 right hand side is evaluated and matched against the pattern on the left.
686 If the match fails then the whole guard fails and the next equation is
687 tried. If it succeeds, then the appropriate binding takes place, and the
688 next qualifier is matched, in the augmented environment. Unlike list
689 comprehensions, however, the type of the expression to the right of the
690 <literal><-</literal> is the same as the type of the pattern to its
691 left. The bindings introduced by pattern guards scope over all the
692 remaining guard qualifiers, and over the right hand side of the equation.
696 Just as with list comprehensions, boolean expressions can be freely mixed
697 with among the pattern guards. For example:
708 Haskell's current guards therefore emerge as a special case, in which the
709 qualifier list has just one element, a boolean expression.
713 <!-- ===================== Recursive do-notation =================== -->
715 <sect2 id="mdo-notation">
716 <title>The recursive do-notation
719 <para> The recursive do-notation (also known as mdo-notation) is implemented as described in
720 <ulink url="http://citeseer.ist.psu.edu/erk02recursive.html">A recursive do for Haskell</ulink>,
721 by Levent Erkok, John Launchbury,
722 Haskell Workshop 2002, pages: 29-37. Pittsburgh, Pennsylvania.
723 This paper is essential reading for anyone making non-trivial use of mdo-notation,
724 and we do not repeat it here.
727 The do-notation of Haskell does not allow <emphasis>recursive bindings</emphasis>,
728 that is, the variables bound in a do-expression are visible only in the textually following
729 code block. Compare this to a let-expression, where bound variables are visible in the entire binding
730 group. It turns out that several applications can benefit from recursive bindings in
731 the do-notation, and this extension provides the necessary syntactic support.
734 Here is a simple (yet contrived) example:
737 import Control.Monad.Fix
739 justOnes = mdo xs <- Just (1:xs)
743 As you can guess <literal>justOnes</literal> will evaluate to <literal>Just [1,1,1,...</literal>.
747 The Control.Monad.Fix library introduces the <literal>MonadFix</literal> class. It's definition is:
750 class Monad m => MonadFix m where
751 mfix :: (a -> m a) -> m a
754 The function <literal>mfix</literal>
755 dictates how the required recursion operation should be performed. For example,
756 <literal>justOnes</literal> desugars as follows:
758 justOnes = mfix (\xs' -> do { xs <- Just (1:xs'); return xs }
760 For full details of the way in which mdo is typechecked and desugared, see
761 the paper <ulink url="http://citeseer.ist.psu.edu/erk02recursive.html">A recursive do for Haskell</ulink>.
762 In particular, GHC implements the segmentation technique described in Section 3.2 of the paper.
765 If recursive bindings are required for a monad,
766 then that monad must be declared an instance of the <literal>MonadFix</literal> class.
767 The following instances of <literal>MonadFix</literal> are automatically provided: List, Maybe, IO.
768 Furthermore, the Control.Monad.ST and Control.Monad.ST.Lazy modules provide the instances of the MonadFix class
769 for Haskell's internal state monad (strict and lazy, respectively).
772 Here are some important points in using the recursive-do notation:
775 The recursive version of the do-notation uses the keyword <literal>mdo</literal> (rather
776 than <literal>do</literal>).
780 It is enabled with the flag <literal>-XRecursiveDo</literal>, which is in turn implied by
781 <literal>-fglasgow-exts</literal>.
785 Unlike ordinary do-notation, but like <literal>let</literal> and <literal>where</literal> bindings,
786 name shadowing is not allowed; that is, all the names bound in a single <literal>mdo</literal> must
787 be distinct (Section 3.3 of the paper).
791 Variables bound by a <literal>let</literal> statement in an <literal>mdo</literal>
792 are monomorphic in the <literal>mdo</literal> (Section 3.1 of the paper). However
793 GHC breaks the <literal>mdo</literal> into segments to enhance polymorphism,
794 and improve termination (Section 3.2 of the paper).
800 The web page: <ulink url="http://www.cse.ogi.edu/PacSoft/projects/rmb">http://www.cse.ogi.edu/PacSoft/projects/rmb</ulink>
801 contains up to date information on recursive monadic bindings.
805 Historical note: The old implementation of the mdo-notation (and most
806 of the existing documents) used the name
807 <literal>MonadRec</literal> for the class and the corresponding library.
808 This name is not supported by GHC.
814 <!-- ===================== PARALLEL LIST COMPREHENSIONS =================== -->
816 <sect2 id="parallel-list-comprehensions">
817 <title>Parallel List Comprehensions</title>
818 <indexterm><primary>list comprehensions</primary><secondary>parallel</secondary>
820 <indexterm><primary>parallel list comprehensions</primary>
823 <para>Parallel list comprehensions are a natural extension to list
824 comprehensions. List comprehensions can be thought of as a nice
825 syntax for writing maps and filters. Parallel comprehensions
826 extend this to include the zipWith family.</para>
828 <para>A parallel list comprehension has multiple independent
829 branches of qualifier lists, each separated by a `|' symbol. For
830 example, the following zips together two lists:</para>
833 [ (x, y) | x <- xs | y <- ys ]
836 <para>The behavior of parallel list comprehensions follows that of
837 zip, in that the resulting list will have the same length as the
838 shortest branch.</para>
840 <para>We can define parallel list comprehensions by translation to
841 regular comprehensions. Here's the basic idea:</para>
843 <para>Given a parallel comprehension of the form: </para>
846 [ e | p1 <- e11, p2 <- e12, ...
847 | q1 <- e21, q2 <- e22, ...
852 <para>This will be translated to: </para>
855 [ e | ((p1,p2), (q1,q2), ...) <- zipN [(p1,p2) | p1 <- e11, p2 <- e12, ...]
856 [(q1,q2) | q1 <- e21, q2 <- e22, ...]
861 <para>where `zipN' is the appropriate zip for the given number of
866 <sect2 id="rebindable-syntax">
867 <title>Rebindable syntax</title>
870 <para>GHC allows most kinds of built-in syntax to be rebound by
871 the user, to facilitate replacing the <literal>Prelude</literal>
872 with a home-grown version, for example.</para>
874 <para>You may want to define your own numeric class
875 hierarchy. It completely defeats that purpose if the
876 literal "1" means "<literal>Prelude.fromInteger
877 1</literal>", which is what the Haskell Report specifies.
878 So the <option>-XNoImplicitPrelude</option> flag causes
879 the following pieces of built-in syntax to refer to
880 <emphasis>whatever is in scope</emphasis>, not the Prelude
885 <para>An integer literal <literal>368</literal> means
886 "<literal>fromInteger (368::Integer)</literal>", rather than
887 "<literal>Prelude.fromInteger (368::Integer)</literal>".
890 <listitem><para>Fractional literals are handed in just the same way,
891 except that the translation is
892 <literal>fromRational (3.68::Rational)</literal>.
895 <listitem><para>The equality test in an overloaded numeric pattern
896 uses whatever <literal>(==)</literal> is in scope.
899 <listitem><para>The subtraction operation, and the
900 greater-than-or-equal test, in <literal>n+k</literal> patterns
901 use whatever <literal>(-)</literal> and <literal>(>=)</literal> are in scope.
905 <para>Negation (e.g. "<literal>- (f x)</literal>")
906 means "<literal>negate (f x)</literal>", both in numeric
907 patterns, and expressions.
911 <para>"Do" notation is translated using whatever
912 functions <literal>(>>=)</literal>,
913 <literal>(>>)</literal>, and <literal>fail</literal>,
914 are in scope (not the Prelude
915 versions). List comprehensions, mdo (<xref linkend="mdo-notation"/>), and parallel array
916 comprehensions, are unaffected. </para></listitem>
920 notation (see <xref linkend="arrow-notation"/>)
921 uses whatever <literal>arr</literal>,
922 <literal>(>>>)</literal>, <literal>first</literal>,
923 <literal>app</literal>, <literal>(|||)</literal> and
924 <literal>loop</literal> functions are in scope. But unlike the
925 other constructs, the types of these functions must match the
926 Prelude types very closely. Details are in flux; if you want
930 In all cases (apart from arrow notation), the static semantics should be that of the desugared form,
931 even if that is a little unexpected. For emample, the
932 static semantics of the literal <literal>368</literal>
933 is exactly that of <literal>fromInteger (368::Integer)</literal>; it's fine for
934 <literal>fromInteger</literal> to have any of the types:
936 fromInteger :: Integer -> Integer
937 fromInteger :: forall a. Foo a => Integer -> a
938 fromInteger :: Num a => a -> Integer
939 fromInteger :: Integer -> Bool -> Bool
943 <para>Be warned: this is an experimental facility, with
944 fewer checks than usual. Use <literal>-dcore-lint</literal>
945 to typecheck the desugared program. If Core Lint is happy
946 you should be all right.</para>
950 <sect2 id="postfix-operators">
951 <title>Postfix operators</title>
954 GHC allows a small extension to the syntax of left operator sections, which
955 allows you to define postfix operators. The extension is this: the left section
959 is equivalent (from the point of view of both type checking and execution) to the expression
963 (for any expression <literal>e</literal> and operator <literal>(!)</literal>.
964 The strict Haskell 98 interpretation is that the section is equivalent to
968 That is, the operator must be a function of two arguments. GHC allows it to
969 take only one argument, and that in turn allows you to write the function
972 <para>Since this extension goes beyond Haskell 98, it should really be enabled
973 by a flag; but in fact it is enabled all the time. (No Haskell 98 programs
974 change their behaviour, of course.)
976 <para>The extension does not extend to the left-hand side of function
977 definitions; you must define such a function in prefix form.</para>
981 <sect2 id="disambiguate-fields">
982 <title>Record field disambiguation</title>
984 In record construction and record pattern matching
985 it is entirely unambiguous which field is referred to, even if there are two different
986 data types in scope with a common field name. For example:
989 data S = MkS { x :: Int, y :: Bool }
994 data T = MkT { x :: Int }
996 ok1 (MkS { x = n }) = n+1 -- Unambiguous
998 ok2 n = MkT { x = n+1 } -- Unambiguous
1000 bad1 k = k { x = 3 } -- Ambiguous
1001 bad2 k = x k -- Ambiguous
1003 Even though there are two <literal>x</literal>'s in scope,
1004 it is clear that the <literal>x</literal> in the pattern in the
1005 definition of <literal>ok1</literal> can only mean the field
1006 <literal>x</literal> from type <literal>S</literal>. Similarly for
1007 the function <literal>ok2</literal>. However, in the record update
1008 in <literal>bad1</literal> and the record selection in <literal>bad2</literal>
1009 it is not clear which of the two types is intended.
1012 Haskell 98 regards all four as ambiguous, but with the
1013 <option>-fdisambiguate-record-fields</option> flag, GHC will accept
1014 the former two. The rules are precisely the same as those for instance
1015 declarations in Haskell 98, where the method names on the left-hand side
1016 of the method bindings in an instance declaration refer unambiguously
1017 to the method of that class (provided they are in scope at all), even
1018 if there are other variables in scope with the same name.
1019 This reduces the clutter of qualified names when you import two
1020 records from different modules that use the same field name.
1026 <!-- TYPE SYSTEM EXTENSIONS -->
1027 <sect1 id="data-type-extensions">
1028 <title>Extensions to data types and type synonyms</title>
1030 <sect2 id="nullary-types">
1031 <title>Data types with no constructors</title>
1033 <para>With the <option>-fglasgow-exts</option> flag, GHC lets you declare
1034 a data type with no constructors. For example:</para>
1038 data T a -- T :: * -> *
1041 <para>Syntactically, the declaration lacks the "= constrs" part. The
1042 type can be parameterised over types of any kind, but if the kind is
1043 not <literal>*</literal> then an explicit kind annotation must be used
1044 (see <xref linkend="kinding"/>).</para>
1046 <para>Such data types have only one value, namely bottom.
1047 Nevertheless, they can be useful when defining "phantom types".</para>
1050 <sect2 id="infix-tycons">
1051 <title>Infix type constructors, classes, and type variables</title>
1054 GHC allows type constructors, classes, and type variables to be operators, and
1055 to be written infix, very much like expressions. More specifically:
1058 A type constructor or class can be an operator, beginning with a colon; e.g. <literal>:*:</literal>.
1059 The lexical syntax is the same as that for data constructors.
1062 Data type and type-synonym declarations can be written infix, parenthesised
1063 if you want further arguments. E.g.
1065 data a :*: b = Foo a b
1066 type a :+: b = Either a b
1067 class a :=: b where ...
1069 data (a :**: b) x = Baz a b x
1070 type (a :++: b) y = Either (a,b) y
1074 Types, and class constraints, can be written infix. For example
1077 f :: (a :=: b) => a -> b
1081 A type variable can be an (unqualified) operator e.g. <literal>+</literal>.
1082 The lexical syntax is the same as that for variable operators, excluding "(.)",
1083 "(!)", and "(*)". In a binding position, the operator must be
1084 parenthesised. For example:
1086 type T (+) = Int + Int
1090 liftA2 :: Arrow (~>)
1091 => (a -> b -> c) -> (e ~> a) -> (e ~> b) -> (e ~> c)
1097 as for expressions, both for type constructors and type variables; e.g. <literal>Int `Either` Bool</literal>, or
1098 <literal>Int `a` Bool</literal>. Similarly, parentheses work the same; e.g. <literal>(:*:) Int Bool</literal>.
1101 Fixities may be declared for type constructors, or classes, just as for data constructors. However,
1102 one cannot distinguish between the two in a fixity declaration; a fixity declaration
1103 sets the fixity for a data constructor and the corresponding type constructor. For example:
1107 sets the fixity for both type constructor <literal>T</literal> and data constructor <literal>T</literal>,
1108 and similarly for <literal>:*:</literal>.
1109 <literal>Int `a` Bool</literal>.
1112 Function arrow is <literal>infixr</literal> with fixity 0. (This might change; I'm not sure what it should be.)
1119 <sect2 id="type-synonyms">
1120 <title>Liberalised type synonyms</title>
1123 Type synonyms are like macros at the type level, and
1124 GHC does validity checking on types <emphasis>only after expanding type synonyms</emphasis>.
1125 That means that GHC can be very much more liberal about type synonyms than Haskell 98:
1127 <listitem> <para>You can write a <literal>forall</literal> (including overloading)
1128 in a type synonym, thus:
1130 type Discard a = forall b. Show b => a -> b -> (a, String)
1135 g :: Discard Int -> (Int,String) -- A rank-2 type
1142 You can write an unboxed tuple in a type synonym:
1144 type Pr = (# Int, Int #)
1152 You can apply a type synonym to a forall type:
1154 type Foo a = a -> a -> Bool
1156 f :: Foo (forall b. b->b)
1158 After expanding the synonym, <literal>f</literal> has the legal (in GHC) type:
1160 f :: (forall b. b->b) -> (forall b. b->b) -> Bool
1165 You can apply a type synonym to a partially applied type synonym:
1167 type Generic i o = forall x. i x -> o x
1170 foo :: Generic Id []
1172 After expanding the synonym, <literal>foo</literal> has the legal (in GHC) type:
1174 foo :: forall x. x -> [x]
1182 GHC currently does kind checking before expanding synonyms (though even that
1186 After expanding type synonyms, GHC does validity checking on types, looking for
1187 the following mal-formedness which isn't detected simply by kind checking:
1190 Type constructor applied to a type involving for-alls.
1193 Unboxed tuple on left of an arrow.
1196 Partially-applied type synonym.
1200 this will be rejected:
1202 type Pr = (# Int, Int #)
1207 because GHC does not allow unboxed tuples on the left of a function arrow.
1212 <sect2 id="existential-quantification">
1213 <title>Existentially quantified data constructors
1217 The idea of using existential quantification in data type declarations
1218 was suggested by Perry, and implemented in Hope+ (Nigel Perry, <emphasis>The Implementation
1219 of Practical Functional Programming Languages</emphasis>, PhD Thesis, University of
1220 London, 1991). It was later formalised by Laufer and Odersky
1221 (<emphasis>Polymorphic type inference and abstract data types</emphasis>,
1222 TOPLAS, 16(5), pp1411-1430, 1994).
1223 It's been in Lennart
1224 Augustsson's <command>hbc</command> Haskell compiler for several years, and
1225 proved very useful. Here's the idea. Consider the declaration:
1231 data Foo = forall a. MkFoo a (a -> Bool)
1238 The data type <literal>Foo</literal> has two constructors with types:
1244 MkFoo :: forall a. a -> (a -> Bool) -> Foo
1251 Notice that the type variable <literal>a</literal> in the type of <function>MkFoo</function>
1252 does not appear in the data type itself, which is plain <literal>Foo</literal>.
1253 For example, the following expression is fine:
1259 [MkFoo 3 even, MkFoo 'c' isUpper] :: [Foo]
1265 Here, <literal>(MkFoo 3 even)</literal> packages an integer with a function
1266 <function>even</function> that maps an integer to <literal>Bool</literal>; and <function>MkFoo 'c'
1267 isUpper</function> packages a character with a compatible function. These
1268 two things are each of type <literal>Foo</literal> and can be put in a list.
1272 What can we do with a value of type <literal>Foo</literal>?. In particular,
1273 what happens when we pattern-match on <function>MkFoo</function>?
1279 f (MkFoo val fn) = ???
1285 Since all we know about <literal>val</literal> and <function>fn</function> is that they
1286 are compatible, the only (useful) thing we can do with them is to
1287 apply <function>fn</function> to <literal>val</literal> to get a boolean. For example:
1294 f (MkFoo val fn) = fn val
1300 What this allows us to do is to package heterogenous values
1301 together with a bunch of functions that manipulate them, and then treat
1302 that collection of packages in a uniform manner. You can express
1303 quite a bit of object-oriented-like programming this way.
1306 <sect3 id="existential">
1307 <title>Why existential?
1311 What has this to do with <emphasis>existential</emphasis> quantification?
1312 Simply that <function>MkFoo</function> has the (nearly) isomorphic type
1318 MkFoo :: (exists a . (a, a -> Bool)) -> Foo
1324 But Haskell programmers can safely think of the ordinary
1325 <emphasis>universally</emphasis> quantified type given above, thereby avoiding
1326 adding a new existential quantification construct.
1332 <title>Type classes</title>
1335 An easy extension is to allow
1336 arbitrary contexts before the constructor. For example:
1342 data Baz = forall a. Eq a => Baz1 a a
1343 | forall b. Show b => Baz2 b (b -> b)
1349 The two constructors have the types you'd expect:
1355 Baz1 :: forall a. Eq a => a -> a -> Baz
1356 Baz2 :: forall b. Show b => b -> (b -> b) -> Baz
1362 But when pattern matching on <function>Baz1</function> the matched values can be compared
1363 for equality, and when pattern matching on <function>Baz2</function> the first matched
1364 value can be converted to a string (as well as applying the function to it).
1365 So this program is legal:
1372 f (Baz1 p q) | p == q = "Yes"
1374 f (Baz2 v fn) = show (fn v)
1380 Operationally, in a dictionary-passing implementation, the
1381 constructors <function>Baz1</function> and <function>Baz2</function> must store the
1382 dictionaries for <literal>Eq</literal> and <literal>Show</literal> respectively, and
1383 extract it on pattern matching.
1387 Notice the way that the syntax fits smoothly with that used for
1388 universal quantification earlier.
1393 <sect3 id="existential-records">
1394 <title>Record Constructors</title>
1397 GHC allows existentials to be used with records syntax as well. For example:
1400 data Counter a = forall self. NewCounter
1402 , _inc :: self -> self
1403 , _display :: self -> IO ()
1407 Here <literal>tag</literal> is a public field, with a well-typed selector
1408 function <literal>tag :: Counter a -> a</literal>. The <literal>self</literal>
1409 type is hidden from the outside; any attempt to apply <literal>_this</literal>,
1410 <literal>_inc</literal> or <literal>_display</literal> as functions will raise a
1411 compile-time error. In other words, <emphasis>GHC defines a record selector function
1412 only for fields whose type does not mention the existentially-quantified variables</emphasis>.
1413 (This example used an underscore in the fields for which record selectors
1414 will not be defined, but that is only programming style; GHC ignores them.)
1418 To make use of these hidden fields, we need to create some helper functions:
1421 inc :: Counter a -> Counter a
1422 inc (NewCounter x i d t) = NewCounter
1423 { _this = i x, _inc = i, _display = d, tag = t }
1425 display :: Counter a -> IO ()
1426 display NewCounter{ _this = x, _display = d } = d x
1429 Now we can define counters with different underlying implementations:
1432 counterA :: Counter String
1433 counterA = NewCounter
1434 { _this = 0, _inc = (1+), _display = print, tag = "A" }
1436 counterB :: Counter String
1437 counterB = NewCounter
1438 { _this = "", _inc = ('#':), _display = putStrLn, tag = "B" }
1441 display (inc counterA) -- prints "1"
1442 display (inc (inc counterB)) -- prints "##"
1445 At the moment, record update syntax is only supported for Haskell 98 data types,
1446 so the following function does <emphasis>not</emphasis> work:
1449 -- This is invalid; use explicit NewCounter instead for now
1450 setTag :: Counter a -> a -> Counter a
1451 setTag obj t = obj{ tag = t }
1460 <title>Restrictions</title>
1463 There are several restrictions on the ways in which existentially-quantified
1464 constructors can be use.
1473 When pattern matching, each pattern match introduces a new,
1474 distinct, type for each existential type variable. These types cannot
1475 be unified with any other type, nor can they escape from the scope of
1476 the pattern match. For example, these fragments are incorrect:
1484 Here, the type bound by <function>MkFoo</function> "escapes", because <literal>a</literal>
1485 is the result of <function>f1</function>. One way to see why this is wrong is to
1486 ask what type <function>f1</function> has:
1490 f1 :: Foo -> a -- Weird!
1494 What is this "<literal>a</literal>" in the result type? Clearly we don't mean
1499 f1 :: forall a. Foo -> a -- Wrong!
1503 The original program is just plain wrong. Here's another sort of error
1507 f2 (Baz1 a b) (Baz1 p q) = a==q
1511 It's ok to say <literal>a==b</literal> or <literal>p==q</literal>, but
1512 <literal>a==q</literal> is wrong because it equates the two distinct types arising
1513 from the two <function>Baz1</function> constructors.
1521 You can't pattern-match on an existentially quantified
1522 constructor in a <literal>let</literal> or <literal>where</literal> group of
1523 bindings. So this is illegal:
1527 f3 x = a==b where { Baz1 a b = x }
1530 Instead, use a <literal>case</literal> expression:
1533 f3 x = case x of Baz1 a b -> a==b
1536 In general, you can only pattern-match
1537 on an existentially-quantified constructor in a <literal>case</literal> expression or
1538 in the patterns of a function definition.
1540 The reason for this restriction is really an implementation one.
1541 Type-checking binding groups is already a nightmare without
1542 existentials complicating the picture. Also an existential pattern
1543 binding at the top level of a module doesn't make sense, because it's
1544 not clear how to prevent the existentially-quantified type "escaping".
1545 So for now, there's a simple-to-state restriction. We'll see how
1553 You can't use existential quantification for <literal>newtype</literal>
1554 declarations. So this is illegal:
1558 newtype T = forall a. Ord a => MkT a
1562 Reason: a value of type <literal>T</literal> must be represented as a
1563 pair of a dictionary for <literal>Ord t</literal> and a value of type
1564 <literal>t</literal>. That contradicts the idea that
1565 <literal>newtype</literal> should have no concrete representation.
1566 You can get just the same efficiency and effect by using
1567 <literal>data</literal> instead of <literal>newtype</literal>. If
1568 there is no overloading involved, then there is more of a case for
1569 allowing an existentially-quantified <literal>newtype</literal>,
1570 because the <literal>data</literal> version does carry an
1571 implementation cost, but single-field existentially quantified
1572 constructors aren't much use. So the simple restriction (no
1573 existential stuff on <literal>newtype</literal>) stands, unless there
1574 are convincing reasons to change it.
1582 You can't use <literal>deriving</literal> to define instances of a
1583 data type with existentially quantified data constructors.
1585 Reason: in most cases it would not make sense. For example:;
1588 data T = forall a. MkT [a] deriving( Eq )
1591 To derive <literal>Eq</literal> in the standard way we would need to have equality
1592 between the single component of two <function>MkT</function> constructors:
1596 (MkT a) == (MkT b) = ???
1599 But <varname>a</varname> and <varname>b</varname> have distinct types, and so can't be compared.
1600 It's just about possible to imagine examples in which the derived instance
1601 would make sense, but it seems altogether simpler simply to prohibit such
1602 declarations. Define your own instances!
1613 <!-- ====================== Generalised algebraic data types ======================= -->
1615 <sect2 id="gadt-style">
1616 <title>Declaring data types with explicit constructor signatures</title>
1618 <para>GHC allows you to declare an algebraic data type by
1619 giving the type signatures of constructors explicitly. For example:
1623 Just :: a -> Maybe a
1625 The form is called a "GADT-style declaration"
1626 because Generalised Algebraic Data Types, described in <xref linkend="gadt"/>,
1627 can only be declared using this form.</para>
1628 <para>Notice that GADT-style syntax generalises existential types (<xref linkend="existential-quantification"/>).
1629 For example, these two declarations are equivalent:
1631 data Foo = forall a. MkFoo a (a -> Bool)
1632 data Foo' where { MKFoo :: a -> (a->Bool) -> Foo' }
1635 <para>Any data type that can be declared in standard Haskell-98 syntax
1636 can also be declared using GADT-style syntax.
1637 The choice is largely stylistic, but GADT-style declarations differ in one important respect:
1638 they treat class constraints on the data constructors differently.
1639 Specifically, if the constructor is given a type-class context, that
1640 context is made available by pattern matching. For example:
1643 MkSet :: Eq a => [a] -> Set a
1645 makeSet :: Eq a => [a] -> Set a
1646 makeSet xs = MkSet (nub xs)
1648 insert :: a -> Set a -> Set a
1649 insert a (MkSet as) | a `elem` as = MkSet as
1650 | otherwise = MkSet (a:as)
1652 A use of <literal>MkSet</literal> as a constructor (e.g. in the definition of <literal>makeSet</literal>)
1653 gives rise to a <literal>(Eq a)</literal>
1654 constraint, as you would expect. The new feature is that pattern-matching on <literal>MkSet</literal>
1655 (as in the definition of <literal>insert</literal>) makes <emphasis>available</emphasis> an <literal>(Eq a)</literal>
1656 context. In implementation terms, the <literal>MkSet</literal> constructor has a hidden field that stores
1657 the <literal>(Eq a)</literal> dictionary that is passed to <literal>MkSet</literal>; so
1658 when pattern-matching that dictionary becomes available for the right-hand side of the match.
1659 In the example, the equality dictionary is used to satisfy the equality constraint
1660 generated by the call to <literal>elem</literal>, so that the type of
1661 <literal>insert</literal> itself has no <literal>Eq</literal> constraint.
1663 <para>This behaviour contrasts with Haskell 98's peculiar treament of
1664 contexts on a data type declaration (Section 4.2.1 of the Haskell 98 Report).
1665 In Haskell 98 the defintion
1667 data Eq a => Set' a = MkSet' [a]
1669 gives <literal>MkSet'</literal> the same type as <literal>MkSet</literal> above. But instead of
1670 <emphasis>making available</emphasis> an <literal>(Eq a)</literal> constraint, pattern-matching
1671 on <literal>MkSet'</literal> <emphasis>requires</emphasis> an <literal>(Eq a)</literal> constraint!
1672 GHC faithfully implements this behaviour, odd though it is. But for GADT-style declarations,
1673 GHC's behaviour is much more useful, as well as much more intuitive.</para>
1675 For example, a possible application of GHC's behaviour is to reify dictionaries:
1677 data NumInst a where
1678 MkNumInst :: Num a => NumInst a
1680 intInst :: NumInst Int
1683 plus :: NumInst a -> a -> a -> a
1684 plus MkNumInst p q = p + q
1686 Here, a value of type <literal>NumInst a</literal> is equivalent
1687 to an explicit <literal>(Num a)</literal> dictionary.
1691 The rest of this section gives further details about GADT-style data
1696 The result type of each data constructor must begin with the type constructor being defined.
1697 If the result type of all constructors
1698 has the form <literal>T a1 ... an</literal>, where <literal>a1 ... an</literal>
1699 are distinct type variables, then the data type is <emphasis>ordinary</emphasis>;
1700 otherwise is a <emphasis>generalised</emphasis> data type (<xref linkend="gadt"/>).
1704 The type signature of
1705 each constructor is independent, and is implicitly universally quantified as usual.
1706 Different constructors may have different universally-quantified type variables
1707 and different type-class constraints.
1708 For example, this is fine:
1711 T1 :: Eq b => b -> T b
1712 T2 :: (Show c, Ix c) => c -> [c] -> T c
1717 Unlike a Haskell-98-style
1718 data type declaration, the type variable(s) in the "<literal>data Set a where</literal>" header
1719 have no scope. Indeed, one can write a kind signature instead:
1721 data Set :: * -> * where ...
1723 or even a mixture of the two:
1725 data Foo a :: (* -> *) -> * where ...
1727 The type variables (if given) may be explicitly kinded, so we could also write the header for <literal>Foo</literal>
1730 data Foo a (b :: * -> *) where ...
1736 You can use strictness annotations, in the obvious places
1737 in the constructor type:
1740 Lit :: !Int -> Term Int
1741 If :: Term Bool -> !(Term a) -> !(Term a) -> Term a
1742 Pair :: Term a -> Term b -> Term (a,b)
1747 You can use a <literal>deriving</literal> clause on a GADT-style data type
1748 declaration. For example, these two declarations are equivalent
1750 data Maybe1 a where {
1751 Nothing1 :: Maybe1 a ;
1752 Just1 :: a -> Maybe1 a
1753 } deriving( Eq, Ord )
1755 data Maybe2 a = Nothing2 | Just2 a
1761 You can use record syntax on a GADT-style data type declaration:
1765 Adult { name :: String, children :: [Person] } :: Person
1766 Child { name :: String } :: Person
1768 As usual, for every constructor that has a field <literal>f</literal>, the type of
1769 field <literal>f</literal> must be the same (modulo alpha conversion).
1772 At the moment, record updates are not yet possible with GADT-style declarations,
1773 so support is limited to record construction, selection and pattern matching.
1776 aPerson = Adult { name = "Fred", children = [] }
1778 shortName :: Person -> Bool
1779 hasChildren (Adult { children = kids }) = not (null kids)
1780 hasChildren (Child {}) = False
1785 As in the case of existentials declared using the Haskell-98-like record syntax
1786 (<xref linkend="existential-records"/>),
1787 record-selector functions are generated only for those fields that have well-typed
1789 Here is the example of that section, in GADT-style syntax:
1791 data Counter a where
1792 NewCounter { _this :: self
1793 , _inc :: self -> self
1794 , _display :: self -> IO ()
1799 As before, only one selector function is generated here, that for <literal>tag</literal>.
1800 Nevertheless, you can still use all the field names in pattern matching and record construction.
1802 </itemizedlist></para>
1806 <title>Generalised Algebraic Data Types (GADTs)</title>
1808 <para>Generalised Algebraic Data Types generalise ordinary algebraic data types
1809 by allowing constructors to have richer return types. Here is an example:
1812 Lit :: Int -> Term Int
1813 Succ :: Term Int -> Term Int
1814 IsZero :: Term Int -> Term Bool
1815 If :: Term Bool -> Term a -> Term a -> Term a
1816 Pair :: Term a -> Term b -> Term (a,b)
1818 Notice that the return type of the constructors is not always <literal>Term a</literal>, as is the
1819 case with ordinary data types. This generality allows us to
1820 write a well-typed <literal>eval</literal> function
1821 for these <literal>Terms</literal>:
1825 eval (Succ t) = 1 + eval t
1826 eval (IsZero t) = eval t == 0
1827 eval (If b e1 e2) = if eval b then eval e1 else eval e2
1828 eval (Pair e1 e2) = (eval e1, eval e2)
1830 The key point about GADTs is that <emphasis>pattern matching causes type refinement</emphasis>.
1831 For example, in the right hand side of the equation
1836 the type <literal>a</literal> is refined to <literal>Int</literal>. That's the whole point!
1837 A precise specification of the type rules is beyond what this user manual aspires to,
1838 but the design closely follows that described in
1840 url="http://research.microsoft.com/%7Esimonpj/papers/gadt/index.htm">Simple
1841 unification-based type inference for GADTs</ulink>,
1843 The general principle is this: <emphasis>type refinement is only carried out
1844 based on user-supplied type annotations</emphasis>.
1845 So if no type signature is supplied for <literal>eval</literal>, no type refinement happens,
1846 and lots of obscure error messages will
1847 occur. However, the refinement is quite general. For example, if we had:
1849 eval :: Term a -> a -> a
1850 eval (Lit i) j = i+j
1852 the pattern match causes the type <literal>a</literal> to be refined to <literal>Int</literal> (because of the type
1853 of the constructor <literal>Lit</literal>), and that refinement also applies to the type of <literal>j</literal>, and
1854 the result type of the <literal>case</literal> expression. Hence the addition <literal>i+j</literal> is legal.
1857 These and many other examples are given in papers by Hongwei Xi, and
1858 Tim Sheard. There is a longer introduction
1859 <ulink url="http://haskell.org/haskellwiki/GADT">on the wiki</ulink>,
1861 <ulink url="http://www.informatik.uni-bonn.de/~ralf/publications/With.pdf">Fun with phantom types</ulink> also has a number of examples. Note that papers
1862 may use different notation to that implemented in GHC.
1865 The rest of this section outlines the extensions to GHC that support GADTs. The extension is enabled with
1866 <option>-XGADTs</option>.
1869 A GADT can only be declared using GADT-style syntax (<xref linkend="gadt-style"/>);
1870 the old Haskell-98 syntax for data declarations always declares an ordinary data type.
1871 The result type of each constructor must begin with the type constructor being defined,
1872 but for a GADT the arguments to the type constructor can be arbitrary monotypes.
1873 For example, in the <literal>Term</literal> data
1874 type above, the type of each constructor must end with <literal>Term ty</literal>, but
1875 the <literal>ty</literal> may not be a type variable (e.g. the <literal>Lit</literal>
1880 You cannot use a <literal>deriving</literal> clause for a GADT; only for
1881 an ordianary data type.
1885 As mentioned in <xref linkend="gadt-style"/>, record syntax is supported.
1889 Lit { val :: Int } :: Term Int
1890 Succ { num :: Term Int } :: Term Int
1891 Pred { num :: Term Int } :: Term Int
1892 IsZero { arg :: Term Int } :: Term Bool
1893 Pair { arg1 :: Term a
1896 If { cnd :: Term Bool
1901 However, for GADTs there is the following additional constraint:
1902 every constructor that has a field <literal>f</literal> must have
1903 the same result type (modulo alpha conversion)
1904 Hence, in the above example, we cannot merge the <literal>num</literal>
1905 and <literal>arg</literal> fields above into a
1906 single name. Although their field types are both <literal>Term Int</literal>,
1907 their selector functions actually have different types:
1910 num :: Term Int -> Term Int
1911 arg :: Term Bool -> Term Int
1921 <!-- ====================== End of Generalised algebraic data types ======================= -->
1923 <sect1 id="deriving">
1924 <title>Extensions to the "deriving" mechanism</title>
1926 <sect2 id="deriving-inferred">
1927 <title>Inferred context for deriving clauses</title>
1930 The Haskell Report is vague about exactly when a <literal>deriving</literal> clause is
1933 data T0 f a = MkT0 a deriving( Eq )
1934 data T1 f a = MkT1 (f a) deriving( Eq )
1935 data T2 f a = MkT2 (f (f a)) deriving( Eq )
1937 The natural generated <literal>Eq</literal> code would result in these instance declarations:
1939 instance Eq a => Eq (T0 f a) where ...
1940 instance Eq (f a) => Eq (T1 f a) where ...
1941 instance Eq (f (f a)) => Eq (T2 f a) where ...
1943 The first of these is obviously fine. The second is still fine, although less obviously.
1944 The third is not Haskell 98, and risks losing termination of instances.
1947 GHC takes a conservative position: it accepts the first two, but not the third. The rule is this:
1948 each constraint in the inferred instance context must consist only of type variables,
1949 with no repititions.
1952 This rule is applied regardless of flags. If you want a more exotic context, you can write
1953 it yourself, using the <link linkend="stand-alone-deriving">standalone deriving mechanism</link>.
1957 <sect2 id="stand-alone-deriving">
1958 <title>Stand-alone deriving declarations</title>
1961 GHC now allows stand-alone <literal>deriving</literal> declarations, enabled by <literal>-XStandaloneDeriving</literal>:
1963 data Foo a = Bar a | Baz String
1965 deriving instance Eq a => Eq (Foo a)
1967 The syntax is identical to that of an ordinary instance declaration apart from (a) the keyword
1968 <literal>deriving</literal>, and (b) the absence of the <literal>where</literal> part.
1969 You must supply a context (in the example the context is <literal>(Eq a)</literal>),
1970 exactly as you would in an ordinary instance declaration.
1971 (In contrast the context is inferred in a <literal>deriving</literal> clause
1972 attached to a data type declaration.) These <literal>deriving instance</literal>
1973 rules obey the same rules concerning form and termination as ordinary instance declarations,
1974 controlled by the same flags; see <xref linkend="instance-decls"/>. </para>
1976 <para>The stand-alone syntax is generalised for newtypes in exactly the same
1977 way that ordinary <literal>deriving</literal> clauses are generalised (<xref linkend="newtype-deriving"/>).
1980 newtype Foo a = MkFoo (State Int a)
1982 deriving instance MonadState Int Foo
1984 GHC always treats the <emphasis>last</emphasis> parameter of the instance
1985 (<literal>Foo</literal> in this exmample) as the type whose instance is being derived.
1991 <sect2 id="deriving-typeable">
1992 <title>Deriving clause for classes <literal>Typeable</literal> and <literal>Data</literal></title>
1995 Haskell 98 allows the programmer to add "<literal>deriving( Eq, Ord )</literal>" to a data type
1996 declaration, to generate a standard instance declaration for classes specified in the <literal>deriving</literal> clause.
1997 In Haskell 98, the only classes that may appear in the <literal>deriving</literal> clause are the standard
1998 classes <literal>Eq</literal>, <literal>Ord</literal>,
1999 <literal>Enum</literal>, <literal>Ix</literal>, <literal>Bounded</literal>, <literal>Read</literal>, and <literal>Show</literal>.
2002 GHC extends this list with two more classes that may be automatically derived
2003 (provided the <option>-XDeriveDataTypeable</option> flag is specified):
2004 <literal>Typeable</literal>, and <literal>Data</literal>. These classes are defined in the library
2005 modules <literal>Data.Typeable</literal> and <literal>Data.Generics</literal> respectively, and the
2006 appropriate class must be in scope before it can be mentioned in the <literal>deriving</literal> clause.
2008 <para>An instance of <literal>Typeable</literal> can only be derived if the
2009 data type has seven or fewer type parameters, all of kind <literal>*</literal>.
2010 The reason for this is that the <literal>Typeable</literal> class is derived using the scheme
2012 <ulink url="http://research.microsoft.com/%7Esimonpj/papers/hmap/gmap2.ps">
2013 Scrap More Boilerplate: Reflection, Zips, and Generalised Casts
2015 (Section 7.4 of the paper describes the multiple <literal>Typeable</literal> classes that
2016 are used, and only <literal>Typeable1</literal> up to
2017 <literal>Typeable7</literal> are provided in the library.)
2018 In other cases, there is nothing to stop the programmer writing a <literal>TypableX</literal>
2019 class, whose kind suits that of the data type constructor, and
2020 then writing the data type instance by hand.
2024 <sect2 id="newtype-deriving">
2025 <title>Generalised derived instances for newtypes</title>
2028 When you define an abstract type using <literal>newtype</literal>, you may want
2029 the new type to inherit some instances from its representation. In
2030 Haskell 98, you can inherit instances of <literal>Eq</literal>, <literal>Ord</literal>,
2031 <literal>Enum</literal> and <literal>Bounded</literal> by deriving them, but for any
2032 other classes you have to write an explicit instance declaration. For
2033 example, if you define
2036 newtype Dollars = Dollars Int
2039 and you want to use arithmetic on <literal>Dollars</literal>, you have to
2040 explicitly define an instance of <literal>Num</literal>:
2043 instance Num Dollars where
2044 Dollars a + Dollars b = Dollars (a+b)
2047 All the instance does is apply and remove the <literal>newtype</literal>
2048 constructor. It is particularly galling that, since the constructor
2049 doesn't appear at run-time, this instance declaration defines a
2050 dictionary which is <emphasis>wholly equivalent</emphasis> to the <literal>Int</literal>
2051 dictionary, only slower!
2055 <sect3> <title> Generalising the deriving clause </title>
2057 GHC now permits such instances to be derived instead,
2058 using the flag <option>-XGeneralizedNewtypeDeriving</option>,
2061 newtype Dollars = Dollars Int deriving (Eq,Show,Num)
2064 and the implementation uses the <emphasis>same</emphasis> <literal>Num</literal> dictionary
2065 for <literal>Dollars</literal> as for <literal>Int</literal>. Notionally, the compiler
2066 derives an instance declaration of the form
2069 instance Num Int => Num Dollars
2072 which just adds or removes the <literal>newtype</literal> constructor according to the type.
2076 We can also derive instances of constructor classes in a similar
2077 way. For example, suppose we have implemented state and failure monad
2078 transformers, such that
2081 instance Monad m => Monad (State s m)
2082 instance Monad m => Monad (Failure m)
2084 In Haskell 98, we can define a parsing monad by
2086 type Parser tok m a = State [tok] (Failure m) a
2089 which is automatically a monad thanks to the instance declarations
2090 above. With the extension, we can make the parser type abstract,
2091 without needing to write an instance of class <literal>Monad</literal>, via
2094 newtype Parser tok m a = Parser (State [tok] (Failure m) a)
2097 In this case the derived instance declaration is of the form
2099 instance Monad (State [tok] (Failure m)) => Monad (Parser tok m)
2102 Notice that, since <literal>Monad</literal> is a constructor class, the
2103 instance is a <emphasis>partial application</emphasis> of the new type, not the
2104 entire left hand side. We can imagine that the type declaration is
2105 "eta-converted" to generate the context of the instance
2110 We can even derive instances of multi-parameter classes, provided the
2111 newtype is the last class parameter. In this case, a ``partial
2112 application'' of the class appears in the <literal>deriving</literal>
2113 clause. For example, given the class
2116 class StateMonad s m | m -> s where ...
2117 instance Monad m => StateMonad s (State s m) where ...
2119 then we can derive an instance of <literal>StateMonad</literal> for <literal>Parser</literal>s by
2121 newtype Parser tok m a = Parser (State [tok] (Failure m) a)
2122 deriving (Monad, StateMonad [tok])
2125 The derived instance is obtained by completing the application of the
2126 class to the new type:
2129 instance StateMonad [tok] (State [tok] (Failure m)) =>
2130 StateMonad [tok] (Parser tok m)
2135 As a result of this extension, all derived instances in newtype
2136 declarations are treated uniformly (and implemented just by reusing
2137 the dictionary for the representation type), <emphasis>except</emphasis>
2138 <literal>Show</literal> and <literal>Read</literal>, which really behave differently for
2139 the newtype and its representation.
2143 <sect3> <title> A more precise specification </title>
2145 Derived instance declarations are constructed as follows. Consider the
2146 declaration (after expansion of any type synonyms)
2149 newtype T v1...vn = T' (t vk+1...vn) deriving (c1...cm)
2155 The <literal>ci</literal> are partial applications of
2156 classes of the form <literal>C t1'...tj'</literal>, where the arity of <literal>C</literal>
2157 is exactly <literal>j+1</literal>. That is, <literal>C</literal> lacks exactly one type argument.
2160 The <literal>k</literal> is chosen so that <literal>ci (T v1...vk)</literal> is well-kinded.
2163 The type <literal>t</literal> is an arbitrary type.
2166 The type variables <literal>vk+1...vn</literal> do not occur in <literal>t</literal>,
2167 nor in the <literal>ci</literal>, and
2170 None of the <literal>ci</literal> is <literal>Read</literal>, <literal>Show</literal>,
2171 <literal>Typeable</literal>, or <literal>Data</literal>. These classes
2172 should not "look through" the type or its constructor. You can still
2173 derive these classes for a newtype, but it happens in the usual way, not
2174 via this new mechanism.
2177 Then, for each <literal>ci</literal>, the derived instance
2180 instance ci t => ci (T v1...vk)
2182 As an example which does <emphasis>not</emphasis> work, consider
2184 newtype NonMonad m s = NonMonad (State s m s) deriving Monad
2186 Here we cannot derive the instance
2188 instance Monad (State s m) => Monad (NonMonad m)
2191 because the type variable <literal>s</literal> occurs in <literal>State s m</literal>,
2192 and so cannot be "eta-converted" away. It is a good thing that this
2193 <literal>deriving</literal> clause is rejected, because <literal>NonMonad m</literal> is
2194 not, in fact, a monad --- for the same reason. Try defining
2195 <literal>>>=</literal> with the correct type: you won't be able to.
2199 Notice also that the <emphasis>order</emphasis> of class parameters becomes
2200 important, since we can only derive instances for the last one. If the
2201 <literal>StateMonad</literal> class above were instead defined as
2204 class StateMonad m s | m -> s where ...
2207 then we would not have been able to derive an instance for the
2208 <literal>Parser</literal> type above. We hypothesise that multi-parameter
2209 classes usually have one "main" parameter for which deriving new
2210 instances is most interesting.
2212 <para>Lastly, all of this applies only for classes other than
2213 <literal>Read</literal>, <literal>Show</literal>, <literal>Typeable</literal>,
2214 and <literal>Data</literal>, for which the built-in derivation applies (section
2215 4.3.3. of the Haskell Report).
2216 (For the standard classes <literal>Eq</literal>, <literal>Ord</literal>,
2217 <literal>Ix</literal>, and <literal>Bounded</literal> it is immaterial whether
2218 the standard method is used or the one described here.)
2225 <!-- TYPE SYSTEM EXTENSIONS -->
2226 <sect1 id="type-class-extensions">
2227 <title>Class and instances declarations</title>
2229 <sect2 id="multi-param-type-classes">
2230 <title>Class declarations</title>
2233 This section, and the next one, documents GHC's type-class extensions.
2234 There's lots of background in the paper <ulink
2235 url="http://research.microsoft.com/~simonpj/Papers/type-class-design-space" >Type
2236 classes: exploring the design space</ulink > (Simon Peyton Jones, Mark
2237 Jones, Erik Meijer).
2240 All the extensions are enabled by the <option>-fglasgow-exts</option> flag.
2244 <title>Multi-parameter type classes</title>
2246 Multi-parameter type classes are permitted. For example:
2250 class Collection c a where
2251 union :: c a -> c a -> c a
2259 <title>The superclasses of a class declaration</title>
2262 There are no restrictions on the context in a class declaration
2263 (which introduces superclasses), except that the class hierarchy must
2264 be acyclic. So these class declarations are OK:
2268 class Functor (m k) => FiniteMap m k where
2271 class (Monad m, Monad (t m)) => Transform t m where
2272 lift :: m a -> (t m) a
2278 As in Haskell 98, The class hierarchy must be acyclic. However, the definition
2279 of "acyclic" involves only the superclass relationships. For example,
2285 op :: D b => a -> b -> b
2288 class C a => D a where { ... }
2292 Here, <literal>C</literal> is a superclass of <literal>D</literal>, but it's OK for a
2293 class operation <literal>op</literal> of <literal>C</literal> to mention <literal>D</literal>. (It
2294 would not be OK for <literal>D</literal> to be a superclass of <literal>C</literal>.)
2301 <sect3 id="class-method-types">
2302 <title>Class method types</title>
2305 Haskell 98 prohibits class method types to mention constraints on the
2306 class type variable, thus:
2309 fromList :: [a] -> s a
2310 elem :: Eq a => a -> s a -> Bool
2312 The type of <literal>elem</literal> is illegal in Haskell 98, because it
2313 contains the constraint <literal>Eq a</literal>, constrains only the
2314 class type variable (in this case <literal>a</literal>).
2315 GHC lifts this restriction.
2322 <sect2 id="functional-dependencies">
2323 <title>Functional dependencies
2326 <para> Functional dependencies are implemented as described by Mark Jones
2327 in “<ulink url="http://www.cse.ogi.edu/~mpj/pubs/fundeps.html">Type Classes with Functional Dependencies</ulink>”, Mark P. Jones,
2328 In Proceedings of the 9th European Symposium on Programming,
2329 ESOP 2000, Berlin, Germany, March 2000, Springer-Verlag LNCS 1782,
2333 Functional dependencies are introduced by a vertical bar in the syntax of a
2334 class declaration; e.g.
2336 class (Monad m) => MonadState s m | m -> s where ...
2338 class Foo a b c | a b -> c where ...
2340 There should be more documentation, but there isn't (yet). Yell if you need it.
2343 <sect3><title>Rules for functional dependencies </title>
2345 In a class declaration, all of the class type variables must be reachable (in the sense
2346 mentioned in <xref linkend="type-restrictions"/>)
2347 from the free variables of each method type.
2351 class Coll s a where
2353 insert :: s -> a -> s
2356 is not OK, because the type of <literal>empty</literal> doesn't mention
2357 <literal>a</literal>. Functional dependencies can make the type variable
2360 class Coll s a | s -> a where
2362 insert :: s -> a -> s
2365 Alternatively <literal>Coll</literal> might be rewritten
2368 class Coll s a where
2370 insert :: s a -> a -> s a
2374 which makes the connection between the type of a collection of
2375 <literal>a</literal>'s (namely <literal>(s a)</literal>) and the element type <literal>a</literal>.
2376 Occasionally this really doesn't work, in which case you can split the
2384 class CollE s => Coll s a where
2385 insert :: s -> a -> s
2392 <title>Background on functional dependencies</title>
2394 <para>The following description of the motivation and use of functional dependencies is taken
2395 from the Hugs user manual, reproduced here (with minor changes) by kind
2396 permission of Mark Jones.
2399 Consider the following class, intended as part of a
2400 library for collection types:
2402 class Collects e ce where
2404 insert :: e -> ce -> ce
2405 member :: e -> ce -> Bool
2407 The type variable e used here represents the element type, while ce is the type
2408 of the container itself. Within this framework, we might want to define
2409 instances of this class for lists or characteristic functions (both of which
2410 can be used to represent collections of any equality type), bit sets (which can
2411 be used to represent collections of characters), or hash tables (which can be
2412 used to represent any collection whose elements have a hash function). Omitting
2413 standard implementation details, this would lead to the following declarations:
2415 instance Eq e => Collects e [e] where ...
2416 instance Eq e => Collects e (e -> Bool) where ...
2417 instance Collects Char BitSet where ...
2418 instance (Hashable e, Collects a ce)
2419 => Collects e (Array Int ce) where ...
2421 All this looks quite promising; we have a class and a range of interesting
2422 implementations. Unfortunately, there are some serious problems with the class
2423 declaration. First, the empty function has an ambiguous type:
2425 empty :: Collects e ce => ce
2427 By "ambiguous" we mean that there is a type variable e that appears on the left
2428 of the <literal>=></literal> symbol, but not on the right. The problem with
2429 this is that, according to the theoretical foundations of Haskell overloading,
2430 we cannot guarantee a well-defined semantics for any term with an ambiguous
2434 We can sidestep this specific problem by removing the empty member from the
2435 class declaration. However, although the remaining members, insert and member,
2436 do not have ambiguous types, we still run into problems when we try to use
2437 them. For example, consider the following two functions:
2439 f x y = insert x . insert y
2442 for which GHC infers the following types:
2444 f :: (Collects a c, Collects b c) => a -> b -> c -> c
2445 g :: (Collects Bool c, Collects Char c) => c -> c
2447 Notice that the type for f allows the two parameters x and y to be assigned
2448 different types, even though it attempts to insert each of the two values, one
2449 after the other, into the same collection. If we're trying to model collections
2450 that contain only one type of value, then this is clearly an inaccurate
2451 type. Worse still, the definition for g is accepted, without causing a type
2452 error. As a result, the error in this code will not be flagged at the point
2453 where it appears. Instead, it will show up only when we try to use g, which
2454 might even be in a different module.
2457 <sect4><title>An attempt to use constructor classes</title>
2460 Faced with the problems described above, some Haskell programmers might be
2461 tempted to use something like the following version of the class declaration:
2463 class Collects e c where
2465 insert :: e -> c e -> c e
2466 member :: e -> c e -> Bool
2468 The key difference here is that we abstract over the type constructor c that is
2469 used to form the collection type c e, and not over that collection type itself,
2470 represented by ce in the original class declaration. This avoids the immediate
2471 problems that we mentioned above: empty has type <literal>Collects e c => c
2472 e</literal>, which is not ambiguous.
2475 The function f from the previous section has a more accurate type:
2477 f :: (Collects e c) => e -> e -> c e -> c e
2479 The function g from the previous section is now rejected with a type error as
2480 we would hope because the type of f does not allow the two arguments to have
2482 This, then, is an example of a multiple parameter class that does actually work
2483 quite well in practice, without ambiguity problems.
2484 There is, however, a catch. This version of the Collects class is nowhere near
2485 as general as the original class seemed to be: only one of the four instances
2486 for <literal>Collects</literal>
2487 given above can be used with this version of Collects because only one of
2488 them---the instance for lists---has a collection type that can be written in
2489 the form c e, for some type constructor c, and element type e.
2493 <sect4><title>Adding functional dependencies</title>
2496 To get a more useful version of the Collects class, Hugs provides a mechanism
2497 that allows programmers to specify dependencies between the parameters of a
2498 multiple parameter class (For readers with an interest in theoretical
2499 foundations and previous work: The use of dependency information can be seen
2500 both as a generalization of the proposal for `parametric type classes' that was
2501 put forward by Chen, Hudak, and Odersky, or as a special case of Mark Jones's
2502 later framework for "improvement" of qualified types. The
2503 underlying ideas are also discussed in a more theoretical and abstract setting
2504 in a manuscript [implparam], where they are identified as one point in a
2505 general design space for systems of implicit parameterization.).
2507 To start with an abstract example, consider a declaration such as:
2509 class C a b where ...
2511 which tells us simply that C can be thought of as a binary relation on types
2512 (or type constructors, depending on the kinds of a and b). Extra clauses can be
2513 included in the definition of classes to add information about dependencies
2514 between parameters, as in the following examples:
2516 class D a b | a -> b where ...
2517 class E a b | a -> b, b -> a where ...
2519 The notation <literal>a -> b</literal> used here between the | and where
2520 symbols --- not to be
2521 confused with a function type --- indicates that the a parameter uniquely
2522 determines the b parameter, and might be read as "a determines b." Thus D is
2523 not just a relation, but actually a (partial) function. Similarly, from the two
2524 dependencies that are included in the definition of E, we can see that E
2525 represents a (partial) one-one mapping between types.
2528 More generally, dependencies take the form <literal>x1 ... xn -> y1 ... ym</literal>,
2529 where x1, ..., xn, and y1, ..., yn are type variables with n>0 and
2530 m>=0, meaning that the y parameters are uniquely determined by the x
2531 parameters. Spaces can be used as separators if more than one variable appears
2532 on any single side of a dependency, as in <literal>t -> a b</literal>. Note that a class may be
2533 annotated with multiple dependencies using commas as separators, as in the
2534 definition of E above. Some dependencies that we can write in this notation are
2535 redundant, and will be rejected because they don't serve any useful
2536 purpose, and may instead indicate an error in the program. Examples of
2537 dependencies like this include <literal>a -> a </literal>,
2538 <literal>a -> a a </literal>,
2539 <literal>a -> </literal>, etc. There can also be
2540 some redundancy if multiple dependencies are given, as in
2541 <literal>a->b</literal>,
2542 <literal>b->c </literal>, <literal>a->c </literal>, and
2543 in which some subset implies the remaining dependencies. Examples like this are
2544 not treated as errors. Note that dependencies appear only in class
2545 declarations, and not in any other part of the language. In particular, the
2546 syntax for instance declarations, class constraints, and types is completely
2550 By including dependencies in a class declaration, we provide a mechanism for
2551 the programmer to specify each multiple parameter class more precisely. The
2552 compiler, on the other hand, is responsible for ensuring that the set of
2553 instances that are in scope at any given point in the program is consistent
2554 with any declared dependencies. For example, the following pair of instance
2555 declarations cannot appear together in the same scope because they violate the
2556 dependency for D, even though either one on its own would be acceptable:
2558 instance D Bool Int where ...
2559 instance D Bool Char where ...
2561 Note also that the following declaration is not allowed, even by itself:
2563 instance D [a] b where ...
2565 The problem here is that this instance would allow one particular choice of [a]
2566 to be associated with more than one choice for b, which contradicts the
2567 dependency specified in the definition of D. More generally, this means that,
2568 in any instance of the form:
2570 instance D t s where ...
2572 for some particular types t and s, the only variables that can appear in s are
2573 the ones that appear in t, and hence, if the type t is known, then s will be
2574 uniquely determined.
2577 The benefit of including dependency information is that it allows us to define
2578 more general multiple parameter classes, without ambiguity problems, and with
2579 the benefit of more accurate types. To illustrate this, we return to the
2580 collection class example, and annotate the original definition of <literal>Collects</literal>
2581 with a simple dependency:
2583 class Collects e ce | ce -> e where
2585 insert :: e -> ce -> ce
2586 member :: e -> ce -> Bool
2588 The dependency <literal>ce -> e</literal> here specifies that the type e of elements is uniquely
2589 determined by the type of the collection ce. Note that both parameters of
2590 Collects are of kind *; there are no constructor classes here. Note too that
2591 all of the instances of Collects that we gave earlier can be used
2592 together with this new definition.
2595 What about the ambiguity problems that we encountered with the original
2596 definition? The empty function still has type Collects e ce => ce, but it is no
2597 longer necessary to regard that as an ambiguous type: Although the variable e
2598 does not appear on the right of the => symbol, the dependency for class
2599 Collects tells us that it is uniquely determined by ce, which does appear on
2600 the right of the => symbol. Hence the context in which empty is used can still
2601 give enough information to determine types for both ce and e, without
2602 ambiguity. More generally, we need only regard a type as ambiguous if it
2603 contains a variable on the left of the => that is not uniquely determined
2604 (either directly or indirectly) by the variables on the right.
2607 Dependencies also help to produce more accurate types for user defined
2608 functions, and hence to provide earlier detection of errors, and less cluttered
2609 types for programmers to work with. Recall the previous definition for a
2612 f x y = insert x y = insert x . insert y
2614 for which we originally obtained a type:
2616 f :: (Collects a c, Collects b c) => a -> b -> c -> c
2618 Given the dependency information that we have for Collects, however, we can
2619 deduce that a and b must be equal because they both appear as the second
2620 parameter in a Collects constraint with the same first parameter c. Hence we
2621 can infer a shorter and more accurate type for f:
2623 f :: (Collects a c) => a -> a -> c -> c
2625 In a similar way, the earlier definition of g will now be flagged as a type error.
2628 Although we have given only a few examples here, it should be clear that the
2629 addition of dependency information can help to make multiple parameter classes
2630 more useful in practice, avoiding ambiguity problems, and allowing more general
2631 sets of instance declarations.
2637 <sect2 id="instance-decls">
2638 <title>Instance declarations</title>
2640 <sect3 id="instance-rules">
2641 <title>Relaxed rules for instance declarations</title>
2643 <para>An instance declaration has the form
2645 instance ( <replaceable>assertion</replaceable><subscript>1</subscript>, ..., <replaceable>assertion</replaceable><subscript>n</subscript>) => <replaceable>class</replaceable> <replaceable>type</replaceable><subscript>1</subscript> ... <replaceable>type</replaceable><subscript>m</subscript> where ...
2647 The part before the "<literal>=></literal>" is the
2648 <emphasis>context</emphasis>, while the part after the
2649 "<literal>=></literal>" is the <emphasis>head</emphasis> of the instance declaration.
2653 In Haskell 98 the head of an instance declaration
2654 must be of the form <literal>C (T a1 ... an)</literal>, where
2655 <literal>C</literal> is the class, <literal>T</literal> is a type constructor,
2656 and the <literal>a1 ... an</literal> are distinct type variables.
2657 Furthermore, the assertions in the context of the instance declaration
2658 must be of the form <literal>C a</literal> where <literal>a</literal>
2659 is a type variable that occurs in the head.
2662 The <option>-fglasgow-exts</option> flag loosens these restrictions
2663 considerably. Firstly, multi-parameter type classes are permitted. Secondly,
2664 the context and head of the instance declaration can each consist of arbitrary
2665 (well-kinded) assertions <literal>(C t1 ... tn)</literal> subject only to the
2669 The Paterson Conditions: for each assertion in the context
2671 <listitem><para>No type variable has more occurrences in the assertion than in the head</para></listitem>
2672 <listitem><para>The assertion has fewer constructors and variables (taken together
2673 and counting repetitions) than the head</para></listitem>
2677 <listitem><para>The Coverage Condition. For each functional dependency,
2678 <replaceable>tvs</replaceable><subscript>left</subscript> <literal>-></literal>
2679 <replaceable>tvs</replaceable><subscript>right</subscript>, of the class,
2680 every type variable in
2681 S(<replaceable>tvs</replaceable><subscript>right</subscript>) must appear in
2682 S(<replaceable>tvs</replaceable><subscript>left</subscript>), where S is the
2683 substitution mapping each type variable in the class declaration to the
2684 corresponding type in the instance declaration.
2687 These restrictions ensure that context reduction terminates: each reduction
2688 step makes the problem smaller by at least one
2689 constructor. Both the Paterson Conditions and the Coverage Condition are lifted
2690 if you give the <option>-fallow-undecidable-instances</option>
2691 flag (<xref linkend="undecidable-instances"/>).
2692 You can find lots of background material about the reason for these
2693 restrictions in the paper <ulink
2694 url="http://research.microsoft.com/%7Esimonpj/papers/fd%2Dchr/">
2695 Understanding functional dependencies via Constraint Handling Rules</ulink>.
2698 For example, these are OK:
2700 instance C Int [a] -- Multiple parameters
2701 instance Eq (S [a]) -- Structured type in head
2703 -- Repeated type variable in head
2704 instance C4 a a => C4 [a] [a]
2705 instance Stateful (ST s) (MutVar s)
2707 -- Head can consist of type variables only
2709 instance (Eq a, Show b) => C2 a b
2711 -- Non-type variables in context
2712 instance Show (s a) => Show (Sized s a)
2713 instance C2 Int a => C3 Bool [a]
2714 instance C2 Int a => C3 [a] b
2718 -- Context assertion no smaller than head
2719 instance C a => C a where ...
2720 -- (C b b) has more more occurrences of b than the head
2721 instance C b b => Foo [b] where ...
2726 The same restrictions apply to instances generated by
2727 <literal>deriving</literal> clauses. Thus the following is accepted:
2729 data MinHeap h a = H a (h a)
2732 because the derived instance
2734 instance (Show a, Show (h a)) => Show (MinHeap h a)
2736 conforms to the above rules.
2740 A useful idiom permitted by the above rules is as follows.
2741 If one allows overlapping instance declarations then it's quite
2742 convenient to have a "default instance" declaration that applies if
2743 something more specific does not:
2751 <sect3 id="undecidable-instances">
2752 <title>Undecidable instances</title>
2755 Sometimes even the rules of <xref linkend="instance-rules"/> are too onerous.
2756 For example, sometimes you might want to use the following to get the
2757 effect of a "class synonym":
2759 class (C1 a, C2 a, C3 a) => C a where { }
2761 instance (C1 a, C2 a, C3 a) => C a where { }
2763 This allows you to write shorter signatures:
2769 f :: (C1 a, C2 a, C3 a) => ...
2771 The restrictions on functional dependencies (<xref
2772 linkend="functional-dependencies"/>) are particularly troublesome.
2773 It is tempting to introduce type variables in the context that do not appear in
2774 the head, something that is excluded by the normal rules. For example:
2776 class HasConverter a b | a -> b where
2779 data Foo a = MkFoo a
2781 instance (HasConverter a b,Show b) => Show (Foo a) where
2782 show (MkFoo value) = show (convert value)
2784 This is dangerous territory, however. Here, for example, is a program that would make the
2789 instance F [a] [[a]]
2790 instance (D c, F a c) => D [a] -- 'c' is not mentioned in the head
2792 Similarly, it can be tempting to lift the coverage condition:
2794 class Mul a b c | a b -> c where
2795 (.*.) :: a -> b -> c
2797 instance Mul Int Int Int where (.*.) = (*)
2798 instance Mul Int Float Float where x .*. y = fromIntegral x * y
2799 instance Mul a b c => Mul a [b] [c] where x .*. v = map (x.*.) v
2801 The third instance declaration does not obey the coverage condition;
2802 and indeed the (somewhat strange) definition:
2804 f = \ b x y -> if b then x .*. [y] else y
2806 makes instance inference go into a loop, because it requires the constraint
2807 <literal>(Mul a [b] b)</literal>.
2810 Nevertheless, GHC allows you to experiment with more liberal rules. If you use
2811 the experimental flag <option>-XUndecidableInstances</option>
2812 <indexterm><primary>-XUndecidableInstances</primary></indexterm>,
2813 both the Paterson Conditions and the Coverage Condition
2814 (described in <xref linkend="instance-rules"/>) are lifted. Termination is ensured by having a
2815 fixed-depth recursion stack. If you exceed the stack depth you get a
2816 sort of backtrace, and the opportunity to increase the stack depth
2817 with <option>-fcontext-stack=</option><emphasis>N</emphasis>.
2823 <sect3 id="instance-overlap">
2824 <title>Overlapping instances</title>
2826 In general, <emphasis>GHC requires that that it be unambiguous which instance
2828 should be used to resolve a type-class constraint</emphasis>. This behaviour
2829 can be modified by two flags: <option>-XOverlappingInstances</option>
2830 <indexterm><primary>-XOverlappingInstances
2831 </primary></indexterm>
2832 and <option>-XIncoherentInstances</option>
2833 <indexterm><primary>-XIncoherentInstances
2834 </primary></indexterm>, as this section discusses. Both these
2835 flags are dynamic flags, and can be set on a per-module basis, using
2836 an <literal>OPTIONS_GHC</literal> pragma if desired (<xref linkend="source-file-options"/>).</para>
2838 When GHC tries to resolve, say, the constraint <literal>C Int Bool</literal>,
2839 it tries to match every instance declaration against the
2841 by instantiating the head of the instance declaration. For example, consider
2844 instance context1 => C Int a where ... -- (A)
2845 instance context2 => C a Bool where ... -- (B)
2846 instance context3 => C Int [a] where ... -- (C)
2847 instance context4 => C Int [Int] where ... -- (D)
2849 The instances (A) and (B) match the constraint <literal>C Int Bool</literal>,
2850 but (C) and (D) do not. When matching, GHC takes
2851 no account of the context of the instance declaration
2852 (<literal>context1</literal> etc).
2853 GHC's default behaviour is that <emphasis>exactly one instance must match the
2854 constraint it is trying to resolve</emphasis>.
2855 It is fine for there to be a <emphasis>potential</emphasis> of overlap (by
2856 including both declarations (A) and (B), say); an error is only reported if a
2857 particular constraint matches more than one.
2861 The <option>-XOverlappingInstances</option> flag instructs GHC to allow
2862 more than one instance to match, provided there is a most specific one. For
2863 example, the constraint <literal>C Int [Int]</literal> matches instances (A),
2864 (C) and (D), but the last is more specific, and hence is chosen. If there is no
2865 most-specific match, the program is rejected.
2868 However, GHC is conservative about committing to an overlapping instance. For example:
2873 Suppose that from the RHS of <literal>f</literal> we get the constraint
2874 <literal>C Int [b]</literal>. But
2875 GHC does not commit to instance (C), because in a particular
2876 call of <literal>f</literal>, <literal>b</literal> might be instantiate
2877 to <literal>Int</literal>, in which case instance (D) would be more specific still.
2878 So GHC rejects the program.
2879 (If you add the flag <option>-XIncoherentInstances</option>,
2880 GHC will instead pick (C), without complaining about
2881 the problem of subsequent instantiations.)
2884 Notice that we gave a type signature to <literal>f</literal>, so GHC had to
2885 <emphasis>check</emphasis> that <literal>f</literal> has the specified type.
2886 Suppose instead we do not give a type signature, asking GHC to <emphasis>infer</emphasis>
2887 it instead. In this case, GHC will refrain from
2888 simplifying the constraint <literal>C Int [Int]</literal> (for the same reason
2889 as before) but, rather than rejecting the program, it will infer the type
2891 f :: C Int b => [b] -> [b]
2893 That postpones the question of which instance to pick to the
2894 call site for <literal>f</literal>
2895 by which time more is known about the type <literal>b</literal>.
2898 The willingness to be overlapped or incoherent is a property of
2899 the <emphasis>instance declaration</emphasis> itself, controlled by the
2900 presence or otherwise of the <option>-XOverlappingInstances</option>
2901 and <option>-XIncoherentInstances</option> flags when that mdodule is
2902 being defined. Neither flag is required in a module that imports and uses the
2903 instance declaration. Specifically, during the lookup process:
2906 An instance declaration is ignored during the lookup process if (a) a more specific
2907 match is found, and (b) the instance declaration was compiled with
2908 <option>-XOverlappingInstances</option>. The flag setting for the
2909 more-specific instance does not matter.
2912 Suppose an instance declaration does not match the constraint being looked up, but
2913 does unify with it, so that it might match when the constraint is further
2914 instantiated. Usually GHC will regard this as a reason for not committing to
2915 some other constraint. But if the instance declaration was compiled with
2916 <option>-XIncoherentInstances</option>, GHC will skip the "does-it-unify?"
2917 check for that declaration.
2920 These rules make it possible for a library author to design a library that relies on
2921 overlapping instances without the library client having to know.
2924 If an instance declaration is compiled without
2925 <option>-XOverlappingInstances</option>,
2926 then that instance can never be overlapped. This could perhaps be
2927 inconvenient. Perhaps the rule should instead say that the
2928 <emphasis>overlapping</emphasis> instance declaration should be compiled in
2929 this way, rather than the <emphasis>overlapped</emphasis> one. Perhaps overlap
2930 at a usage site should be permitted regardless of how the instance declarations
2931 are compiled, if the <option>-XOverlappingInstances</option> flag is
2932 used at the usage site. (Mind you, the exact usage site can occasionally be
2933 hard to pin down.) We are interested to receive feedback on these points.
2935 <para>The <option>-XIncoherentInstances</option> flag implies the
2936 <option>-XOverlappingInstances</option> flag, but not vice versa.
2941 <title>Type synonyms in the instance head</title>
2944 <emphasis>Unlike Haskell 98, instance heads may use type
2945 synonyms</emphasis>. (The instance "head" is the bit after the "=>" in an instance decl.)
2946 As always, using a type synonym is just shorthand for
2947 writing the RHS of the type synonym definition. For example:
2951 type Point = (Int,Int)
2952 instance C Point where ...
2953 instance C [Point] where ...
2957 is legal. However, if you added
2961 instance C (Int,Int) where ...
2965 as well, then the compiler will complain about the overlapping
2966 (actually, identical) instance declarations. As always, type synonyms
2967 must be fully applied. You cannot, for example, write:
2972 instance Monad P where ...
2976 This design decision is independent of all the others, and easily
2977 reversed, but it makes sense to me.
2985 <sect2 id="overloaded-strings">
2986 <title>Overloaded string literals
2990 GHC supports <emphasis>overloaded string literals</emphasis>. Normally a
2991 string literal has type <literal>String</literal>, but with overloaded string
2992 literals enabled (with <literal>-XOverloadedStrings</literal>)
2993 a string literal has type <literal>(IsString a) => a</literal>.
2996 This means that the usual string syntax can be used, e.g., for packed strings
2997 and other variations of string like types. String literals behave very much
2998 like integer literals, i.e., they can be used in both expressions and patterns.
2999 If used in a pattern the literal with be replaced by an equality test, in the same
3000 way as an integer literal is.
3003 The class <literal>IsString</literal> is defined as:
3005 class IsString a where
3006 fromString :: String -> a
3008 The only predefined instance is the obvious one to make strings work as usual:
3010 instance IsString [Char] where
3013 The class <literal>IsString</literal> is not in scope by default. If you want to mention
3014 it explicitly (for exmaple, to give an instance declaration for it), you can import it
3015 from module <literal>GHC.Exts</literal>.
3018 Haskell's defaulting mechanism is extended to cover string literals, when <option>-XOverloadedStrings</option> is specified.
3022 Each type in a default declaration must be an
3023 instance of <literal>Num</literal> <emphasis>or</emphasis> of <literal>IsString</literal>.
3027 The standard defaulting rule (<ulink url="http://haskell.org/onlinereport/decls.html#sect4.3.4">Haskell Report, Section 4.3.4</ulink>)
3028 is extended thus: defaulting applies when all the unresolved constraints involve standard classes
3029 <emphasis>or</emphasis> <literal>IsString</literal>; and at least one is a numeric class
3030 <emphasis>or</emphasis> <literal>IsString</literal>.
3039 import GHC.Exts( IsString(..) )
3041 newtype MyString = MyString String deriving (Eq, Show)
3042 instance IsString MyString where
3043 fromString = MyString
3045 greet :: MyString -> MyString
3046 greet "hello" = "world"
3050 print $ greet "hello"
3051 print $ greet "fool"
3055 Note that deriving <literal>Eq</literal> is necessary for the pattern matching
3056 to work since it gets translated into an equality comparison.
3062 <sect1 id="other-type-extensions">
3063 <title>Other type system extensions</title>
3065 <sect2 id="type-restrictions">
3066 <title>Type signatures</title>
3068 <sect3><title>The context of a type signature</title>
3070 Unlike Haskell 98, constraints in types do <emphasis>not</emphasis> have to be of
3071 the form <emphasis>(class type-variable)</emphasis> or
3072 <emphasis>(class (type-variable type-variable ...))</emphasis>. Thus,
3073 these type signatures are perfectly OK
3076 g :: Ord (T a ()) => ...
3080 GHC imposes the following restrictions on the constraints in a type signature.
3084 forall tv1..tvn (c1, ...,cn) => type
3087 (Here, we write the "foralls" explicitly, although the Haskell source
3088 language omits them; in Haskell 98, all the free type variables of an
3089 explicit source-language type signature are universally quantified,
3090 except for the class type variables in a class declaration. However,
3091 in GHC, you can give the foralls if you want. See <xref linkend="universal-quantification"/>).
3100 <emphasis>Each universally quantified type variable
3101 <literal>tvi</literal> must be reachable from <literal>type</literal></emphasis>.
3103 A type variable <literal>a</literal> is "reachable" if it it appears
3104 in the same constraint as either a type variable free in in
3105 <literal>type</literal>, or another reachable type variable.
3106 A value with a type that does not obey
3107 this reachability restriction cannot be used without introducing
3108 ambiguity; that is why the type is rejected.
3109 Here, for example, is an illegal type:
3113 forall a. Eq a => Int
3117 When a value with this type was used, the constraint <literal>Eq tv</literal>
3118 would be introduced where <literal>tv</literal> is a fresh type variable, and
3119 (in the dictionary-translation implementation) the value would be
3120 applied to a dictionary for <literal>Eq tv</literal>. The difficulty is that we
3121 can never know which instance of <literal>Eq</literal> to use because we never
3122 get any more information about <literal>tv</literal>.
3126 that the reachability condition is weaker than saying that <literal>a</literal> is
3127 functionally dependent on a type variable free in
3128 <literal>type</literal> (see <xref
3129 linkend="functional-dependencies"/>). The reason for this is there
3130 might be a "hidden" dependency, in a superclass perhaps. So
3131 "reachable" is a conservative approximation to "functionally dependent".
3132 For example, consider:
3134 class C a b | a -> b where ...
3135 class C a b => D a b where ...
3136 f :: forall a b. D a b => a -> a
3138 This is fine, because in fact <literal>a</literal> does functionally determine <literal>b</literal>
3139 but that is not immediately apparent from <literal>f</literal>'s type.
3145 <emphasis>Every constraint <literal>ci</literal> must mention at least one of the
3146 universally quantified type variables <literal>tvi</literal></emphasis>.
3148 For example, this type is OK because <literal>C a b</literal> mentions the
3149 universally quantified type variable <literal>b</literal>:
3153 forall a. C a b => burble
3157 The next type is illegal because the constraint <literal>Eq b</literal> does not
3158 mention <literal>a</literal>:
3162 forall a. Eq b => burble
3166 The reason for this restriction is milder than the other one. The
3167 excluded types are never useful or necessary (because the offending
3168 context doesn't need to be witnessed at this point; it can be floated
3169 out). Furthermore, floating them out increases sharing. Lastly,
3170 excluding them is a conservative choice; it leaves a patch of
3171 territory free in case we need it later.
3185 <sect2 id="implicit-parameters">
3186 <title>Implicit parameters</title>
3188 <para> Implicit parameters are implemented as described in
3189 "Implicit parameters: dynamic scoping with static types",
3190 J Lewis, MB Shields, E Meijer, J Launchbury,
3191 27th ACM Symposium on Principles of Programming Languages (POPL'00),
3195 <para>(Most of the following, stil rather incomplete, documentation is
3196 due to Jeff Lewis.)</para>
3198 <para>Implicit parameter support is enabled with the option
3199 <option>-XImplicitParams</option>.</para>
3202 A variable is called <emphasis>dynamically bound</emphasis> when it is bound by the calling
3203 context of a function and <emphasis>statically bound</emphasis> when bound by the callee's
3204 context. In Haskell, all variables are statically bound. Dynamic
3205 binding of variables is a notion that goes back to Lisp, but was later
3206 discarded in more modern incarnations, such as Scheme. Dynamic binding
3207 can be very confusing in an untyped language, and unfortunately, typed
3208 languages, in particular Hindley-Milner typed languages like Haskell,
3209 only support static scoping of variables.
3212 However, by a simple extension to the type class system of Haskell, we
3213 can support dynamic binding. Basically, we express the use of a
3214 dynamically bound variable as a constraint on the type. These
3215 constraints lead to types of the form <literal>(?x::t') => t</literal>, which says "this
3216 function uses a dynamically-bound variable <literal>?x</literal>
3217 of type <literal>t'</literal>". For
3218 example, the following expresses the type of a sort function,
3219 implicitly parameterized by a comparison function named <literal>cmp</literal>.
3221 sort :: (?cmp :: a -> a -> Bool) => [a] -> [a]
3223 The dynamic binding constraints are just a new form of predicate in the type class system.
3226 An implicit parameter occurs in an expression using the special form <literal>?x</literal>,
3227 where <literal>x</literal> is
3228 any valid identifier (e.g. <literal>ord ?x</literal> is a valid expression).
3229 Use of this construct also introduces a new
3230 dynamic-binding constraint in the type of the expression.
3231 For example, the following definition
3232 shows how we can define an implicitly parameterized sort function in
3233 terms of an explicitly parameterized <literal>sortBy</literal> function:
3235 sortBy :: (a -> a -> Bool) -> [a] -> [a]
3237 sort :: (?cmp :: a -> a -> Bool) => [a] -> [a]
3243 <title>Implicit-parameter type constraints</title>
3245 Dynamic binding constraints behave just like other type class
3246 constraints in that they are automatically propagated. Thus, when a
3247 function is used, its implicit parameters are inherited by the
3248 function that called it. For example, our <literal>sort</literal> function might be used
3249 to pick out the least value in a list:
3251 least :: (?cmp :: a -> a -> Bool) => [a] -> a
3252 least xs = head (sort xs)
3254 Without lifting a finger, the <literal>?cmp</literal> parameter is
3255 propagated to become a parameter of <literal>least</literal> as well. With explicit
3256 parameters, the default is that parameters must always be explicit
3257 propagated. With implicit parameters, the default is to always
3261 An implicit-parameter type constraint differs from other type class constraints in the
3262 following way: All uses of a particular implicit parameter must have
3263 the same type. This means that the type of <literal>(?x, ?x)</literal>
3264 is <literal>(?x::a) => (a,a)</literal>, and not
3265 <literal>(?x::a, ?x::b) => (a, b)</literal>, as would be the case for type
3269 <para> You can't have an implicit parameter in the context of a class or instance
3270 declaration. For example, both these declarations are illegal:
3272 class (?x::Int) => C a where ...
3273 instance (?x::a) => Foo [a] where ...
3275 Reason: exactly which implicit parameter you pick up depends on exactly where
3276 you invoke a function. But the ``invocation'' of instance declarations is done
3277 behind the scenes by the compiler, so it's hard to figure out exactly where it is done.
3278 Easiest thing is to outlaw the offending types.</para>
3280 Implicit-parameter constraints do not cause ambiguity. For example, consider:
3282 f :: (?x :: [a]) => Int -> Int
3285 g :: (Read a, Show a) => String -> String
3288 Here, <literal>g</literal> has an ambiguous type, and is rejected, but <literal>f</literal>
3289 is fine. The binding for <literal>?x</literal> at <literal>f</literal>'s call site is
3290 quite unambiguous, and fixes the type <literal>a</literal>.
3295 <title>Implicit-parameter bindings</title>
3298 An implicit parameter is <emphasis>bound</emphasis> using the standard
3299 <literal>let</literal> or <literal>where</literal> binding forms.
3300 For example, we define the <literal>min</literal> function by binding
3301 <literal>cmp</literal>.
3304 min = let ?cmp = (<=) in least
3308 A group of implicit-parameter bindings may occur anywhere a normal group of Haskell
3309 bindings can occur, except at top level. That is, they can occur in a <literal>let</literal>
3310 (including in a list comprehension, or do-notation, or pattern guards),
3311 or a <literal>where</literal> clause.
3312 Note the following points:
3315 An implicit-parameter binding group must be a
3316 collection of simple bindings to implicit-style variables (no
3317 function-style bindings, and no type signatures); these bindings are
3318 neither polymorphic or recursive.
3321 You may not mix implicit-parameter bindings with ordinary bindings in a
3322 single <literal>let</literal>
3323 expression; use two nested <literal>let</literal>s instead.
3324 (In the case of <literal>where</literal> you are stuck, since you can't nest <literal>where</literal> clauses.)
3328 You may put multiple implicit-parameter bindings in a
3329 single binding group; but they are <emphasis>not</emphasis> treated
3330 as a mutually recursive group (as ordinary <literal>let</literal> bindings are).
3331 Instead they are treated as a non-recursive group, simultaneously binding all the implicit
3332 parameter. The bindings are not nested, and may be re-ordered without changing
3333 the meaning of the program.
3334 For example, consider:
3336 f t = let { ?x = t; ?y = ?x+(1::Int) } in ?x + ?y
3338 The use of <literal>?x</literal> in the binding for <literal>?y</literal> does not "see"
3339 the binding for <literal>?x</literal>, so the type of <literal>f</literal> is
3341 f :: (?x::Int) => Int -> Int
3349 <sect3><title>Implicit parameters and polymorphic recursion</title>
3352 Consider these two definitions:
3355 len1 xs = let ?acc = 0 in len_acc1 xs
3358 len_acc1 (x:xs) = let ?acc = ?acc + (1::Int) in len_acc1 xs
3363 len2 xs = let ?acc = 0 in len_acc2 xs
3365 len_acc2 :: (?acc :: Int) => [a] -> Int
3367 len_acc2 (x:xs) = let ?acc = ?acc + (1::Int) in len_acc2 xs
3369 The only difference between the two groups is that in the second group
3370 <literal>len_acc</literal> is given a type signature.
3371 In the former case, <literal>len_acc1</literal> is monomorphic in its own
3372 right-hand side, so the implicit parameter <literal>?acc</literal> is not
3373 passed to the recursive call. In the latter case, because <literal>len_acc2</literal>
3374 has a type signature, the recursive call is made to the
3375 <emphasis>polymoprhic</emphasis> version, which takes <literal>?acc</literal>
3376 as an implicit parameter. So we get the following results in GHCi:
3383 Adding a type signature dramatically changes the result! This is a rather
3384 counter-intuitive phenomenon, worth watching out for.
3388 <sect3><title>Implicit parameters and monomorphism</title>
3390 <para>GHC applies the dreaded Monomorphism Restriction (section 4.5.5 of the
3391 Haskell Report) to implicit parameters. For example, consider:
3399 Since the binding for <literal>y</literal> falls under the Monomorphism
3400 Restriction it is not generalised, so the type of <literal>y</literal> is
3401 simply <literal>Int</literal>, not <literal>(?x::Int) => Int</literal>.
3402 Hence, <literal>(f 9)</literal> returns result <literal>9</literal>.
3403 If you add a type signature for <literal>y</literal>, then <literal>y</literal>
3404 will get type <literal>(?x::Int) => Int</literal>, so the occurrence of
3405 <literal>y</literal> in the body of the <literal>let</literal> will see the
3406 inner binding of <literal>?x</literal>, so <literal>(f 9)</literal> will return
3407 <literal>14</literal>.
3412 <!-- ======================= COMMENTED OUT ========================
3414 We intend to remove linear implicit parameters, so I'm at least removing
3415 them from the 6.6 user manual
3417 <sect2 id="linear-implicit-parameters">
3418 <title>Linear implicit parameters</title>
3420 Linear implicit parameters are an idea developed by Koen Claessen,
3421 Mark Shields, and Simon PJ. They address the long-standing
3422 problem that monads seem over-kill for certain sorts of problem, notably:
3425 <listitem> <para> distributing a supply of unique names </para> </listitem>
3426 <listitem> <para> distributing a supply of random numbers </para> </listitem>
3427 <listitem> <para> distributing an oracle (as in QuickCheck) </para> </listitem>
3431 Linear implicit parameters are just like ordinary implicit parameters,
3432 except that they are "linear"; that is, they cannot be copied, and
3433 must be explicitly "split" instead. Linear implicit parameters are
3434 written '<literal>%x</literal>' instead of '<literal>?x</literal>'.
3435 (The '/' in the '%' suggests the split!)
3440 import GHC.Exts( Splittable )
3442 data NameSupply = ...
3444 splitNS :: NameSupply -> (NameSupply, NameSupply)
3445 newName :: NameSupply -> Name
3447 instance Splittable NameSupply where
3451 f :: (%ns :: NameSupply) => Env -> Expr -> Expr
3452 f env (Lam x e) = Lam x' (f env e)
3455 env' = extend env x x'
3456 ...more equations for f...
3458 Notice that the implicit parameter %ns is consumed
3460 <listitem> <para> once by the call to <literal>newName</literal> </para> </listitem>
3461 <listitem> <para> once by the recursive call to <literal>f</literal> </para></listitem>
3465 So the translation done by the type checker makes
3466 the parameter explicit:
3468 f :: NameSupply -> Env -> Expr -> Expr
3469 f ns env (Lam x e) = Lam x' (f ns1 env e)
3471 (ns1,ns2) = splitNS ns
3473 env = extend env x x'
3475 Notice the call to 'split' introduced by the type checker.
3476 How did it know to use 'splitNS'? Because what it really did
3477 was to introduce a call to the overloaded function 'split',
3478 defined by the class <literal>Splittable</literal>:
3480 class Splittable a where
3483 The instance for <literal>Splittable NameSupply</literal> tells GHC how to implement
3484 split for name supplies. But we can simply write
3490 g :: (Splittable a, %ns :: a) => b -> (b,a,a)
3492 The <literal>Splittable</literal> class is built into GHC. It's exported by module
3493 <literal>GHC.Exts</literal>.
3498 <listitem> <para> '<literal>?x</literal>' and '<literal>%x</literal>'
3499 are entirely distinct implicit parameters: you
3500 can use them together and they won't intefere with each other. </para>
3503 <listitem> <para> You can bind linear implicit parameters in 'with' clauses. </para> </listitem>
3505 <listitem> <para>You cannot have implicit parameters (whether linear or not)
3506 in the context of a class or instance declaration. </para></listitem>
3510 <sect3><title>Warnings</title>
3513 The monomorphism restriction is even more important than usual.
3514 Consider the example above:
3516 f :: (%ns :: NameSupply) => Env -> Expr -> Expr
3517 f env (Lam x e) = Lam x' (f env e)
3520 env' = extend env x x'
3522 If we replaced the two occurrences of x' by (newName %ns), which is
3523 usually a harmless thing to do, we get:
3525 f :: (%ns :: NameSupply) => Env -> Expr -> Expr
3526 f env (Lam x e) = Lam (newName %ns) (f env e)
3528 env' = extend env x (newName %ns)
3530 But now the name supply is consumed in <emphasis>three</emphasis> places
3531 (the two calls to newName,and the recursive call to f), so
3532 the result is utterly different. Urk! We don't even have
3536 Well, this is an experimental change. With implicit
3537 parameters we have already lost beta reduction anyway, and
3538 (as John Launchbury puts it) we can't sensibly reason about
3539 Haskell programs without knowing their typing.
3544 <sect3><title>Recursive functions</title>
3545 <para>Linear implicit parameters can be particularly tricky when you have a recursive function
3548 foo :: %x::T => Int -> [Int]
3550 foo n = %x : foo (n-1)
3552 where T is some type in class Splittable.</para>
3554 Do you get a list of all the same T's or all different T's
3555 (assuming that split gives two distinct T's back)?
3557 If you supply the type signature, taking advantage of polymorphic
3558 recursion, you get what you'd probably expect. Here's the
3559 translated term, where the implicit param is made explicit:
3562 foo x n = let (x1,x2) = split x
3563 in x1 : foo x2 (n-1)
3565 But if you don't supply a type signature, GHC uses the Hindley
3566 Milner trick of using a single monomorphic instance of the function
3567 for the recursive calls. That is what makes Hindley Milner type inference
3568 work. So the translation becomes
3572 foom n = x : foom (n-1)
3576 Result: 'x' is not split, and you get a list of identical T's. So the
3577 semantics of the program depends on whether or not foo has a type signature.
3580 You may say that this is a good reason to dislike linear implicit parameters
3581 and you'd be right. That is why they are an experimental feature.
3587 ================ END OF Linear Implicit Parameters commented out -->
3589 <sect2 id="kinding">
3590 <title>Explicitly-kinded quantification</title>
3593 Haskell infers the kind of each type variable. Sometimes it is nice to be able
3594 to give the kind explicitly as (machine-checked) documentation,
3595 just as it is nice to give a type signature for a function. On some occasions,
3596 it is essential to do so. For example, in his paper "Restricted Data Types in Haskell" (Haskell Workshop 1999)
3597 John Hughes had to define the data type:
3599 data Set cxt a = Set [a]
3600 | Unused (cxt a -> ())
3602 The only use for the <literal>Unused</literal> constructor was to force the correct
3603 kind for the type variable <literal>cxt</literal>.
3606 GHC now instead allows you to specify the kind of a type variable directly, wherever
3607 a type variable is explicitly bound. Namely:
3609 <listitem><para><literal>data</literal> declarations:
3611 data Set (cxt :: * -> *) a = Set [a]
3612 </screen></para></listitem>
3613 <listitem><para><literal>type</literal> declarations:
3615 type T (f :: * -> *) = f Int
3616 </screen></para></listitem>
3617 <listitem><para><literal>class</literal> declarations:
3619 class (Eq a) => C (f :: * -> *) a where ...
3620 </screen></para></listitem>
3621 <listitem><para><literal>forall</literal>'s in type signatures:
3623 f :: forall (cxt :: * -> *). Set cxt Int
3624 </screen></para></listitem>
3629 The parentheses are required. Some of the spaces are required too, to
3630 separate the lexemes. If you write <literal>(f::*->*)</literal> you
3631 will get a parse error, because "<literal>::*->*</literal>" is a
3632 single lexeme in Haskell.
3636 As part of the same extension, you can put kind annotations in types
3639 f :: (Int :: *) -> Int
3640 g :: forall a. a -> (a :: *)
3644 atype ::= '(' ctype '::' kind ')
3646 The parentheses are required.
3651 <sect2 id="universal-quantification">
3652 <title>Arbitrary-rank polymorphism
3656 Haskell type signatures are implicitly quantified. The new keyword <literal>forall</literal>
3657 allows us to say exactly what this means. For example:
3665 g :: forall b. (b -> b)
3667 The two are treated identically.
3671 However, GHC's type system supports <emphasis>arbitrary-rank</emphasis>
3672 explicit universal quantification in
3674 For example, all the following types are legal:
3676 f1 :: forall a b. a -> b -> a
3677 g1 :: forall a b. (Ord a, Eq b) => a -> b -> a
3679 f2 :: (forall a. a->a) -> Int -> Int
3680 g2 :: (forall a. Eq a => [a] -> a -> Bool) -> Int -> Int
3682 f3 :: ((forall a. a->a) -> Int) -> Bool -> Bool
3684 f4 :: Int -> (forall a. a -> a)
3686 Here, <literal>f1</literal> and <literal>g1</literal> are rank-1 types, and
3687 can be written in standard Haskell (e.g. <literal>f1 :: a->b->a</literal>).
3688 The <literal>forall</literal> makes explicit the universal quantification that
3689 is implicitly added by Haskell.
3692 The functions <literal>f2</literal> and <literal>g2</literal> have rank-2 types;
3693 the <literal>forall</literal> is on the left of a function arrow. As <literal>g2</literal>
3694 shows, the polymorphic type on the left of the function arrow can be overloaded.
3697 The function <literal>f3</literal> has a rank-3 type;
3698 it has rank-2 types on the left of a function arrow.
3701 GHC allows types of arbitrary rank; you can nest <literal>forall</literal>s
3702 arbitrarily deep in function arrows. (GHC used to be restricted to rank 2, but
3703 that restriction has now been lifted.)
3704 In particular, a forall-type (also called a "type scheme"),
3705 including an operational type class context, is legal:
3707 <listitem> <para> On the left or right (see <literal>f4</literal>, for example)
3708 of a function arrow </para> </listitem>
3709 <listitem> <para> As the argument of a constructor, or type of a field, in a data type declaration. For
3710 example, any of the <literal>f1,f2,f3,g1,g2</literal> above would be valid
3711 field type signatures.</para> </listitem>
3712 <listitem> <para> As the type of an implicit parameter </para> </listitem>
3713 <listitem> <para> In a pattern type signature (see <xref linkend="scoped-type-variables"/>) </para> </listitem>
3715 Of course <literal>forall</literal> becomes a keyword; you can't use <literal>forall</literal> as
3716 a type variable any more!
3725 In a <literal>data</literal> or <literal>newtype</literal> declaration one can quantify
3726 the types of the constructor arguments. Here are several examples:
3732 data T a = T1 (forall b. b -> b -> b) a
3734 data MonadT m = MkMonad { return :: forall a. a -> m a,
3735 bind :: forall a b. m a -> (a -> m b) -> m b
3738 newtype Swizzle = MkSwizzle (Ord a => [a] -> [a])
3744 The constructors have rank-2 types:
3750 T1 :: forall a. (forall b. b -> b -> b) -> a -> T a
3751 MkMonad :: forall m. (forall a. a -> m a)
3752 -> (forall a b. m a -> (a -> m b) -> m b)
3754 MkSwizzle :: (Ord a => [a] -> [a]) -> Swizzle
3760 Notice that you don't need to use a <literal>forall</literal> if there's an
3761 explicit context. For example in the first argument of the
3762 constructor <function>MkSwizzle</function>, an implicit "<literal>forall a.</literal>" is
3763 prefixed to the argument type. The implicit <literal>forall</literal>
3764 quantifies all type variables that are not already in scope, and are
3765 mentioned in the type quantified over.
3769 As for type signatures, implicit quantification happens for non-overloaded
3770 types too. So if you write this:
3773 data T a = MkT (Either a b) (b -> b)
3776 it's just as if you had written this:
3779 data T a = MkT (forall b. Either a b) (forall b. b -> b)
3782 That is, since the type variable <literal>b</literal> isn't in scope, it's
3783 implicitly universally quantified. (Arguably, it would be better
3784 to <emphasis>require</emphasis> explicit quantification on constructor arguments
3785 where that is what is wanted. Feedback welcomed.)
3789 You construct values of types <literal>T1, MonadT, Swizzle</literal> by applying
3790 the constructor to suitable values, just as usual. For example,
3801 a3 = MkSwizzle reverse
3804 a4 = let r x = Just x
3811 mkTs :: (forall b. b -> b -> b) -> a -> [T a]
3812 mkTs f x y = [T1 f x, T1 f y]
3818 The type of the argument can, as usual, be more general than the type
3819 required, as <literal>(MkSwizzle reverse)</literal> shows. (<function>reverse</function>
3820 does not need the <literal>Ord</literal> constraint.)
3824 When you use pattern matching, the bound variables may now have
3825 polymorphic types. For example:
3831 f :: T a -> a -> (a, Char)
3832 f (T1 w k) x = (w k x, w 'c' 'd')
3834 g :: (Ord a, Ord b) => Swizzle -> [a] -> (a -> b) -> [b]
3835 g (MkSwizzle s) xs f = s (map f (s xs))
3837 h :: MonadT m -> [m a] -> m [a]
3838 h m [] = return m []
3839 h m (x:xs) = bind m x $ \y ->
3840 bind m (h m xs) $ \ys ->
3847 In the function <function>h</function> we use the record selectors <literal>return</literal>
3848 and <literal>bind</literal> to extract the polymorphic bind and return functions
3849 from the <literal>MonadT</literal> data structure, rather than using pattern
3855 <title>Type inference</title>
3858 In general, type inference for arbitrary-rank types is undecidable.
3859 GHC uses an algorithm proposed by Odersky and Laufer ("Putting type annotations to work", POPL'96)
3860 to get a decidable algorithm by requiring some help from the programmer.
3861 We do not yet have a formal specification of "some help" but the rule is this:
3864 <emphasis>For a lambda-bound or case-bound variable, x, either the programmer
3865 provides an explicit polymorphic type for x, or GHC's type inference will assume
3866 that x's type has no foralls in it</emphasis>.
3869 What does it mean to "provide" an explicit type for x? You can do that by
3870 giving a type signature for x directly, using a pattern type signature
3871 (<xref linkend="scoped-type-variables"/>), thus:
3873 \ f :: (forall a. a->a) -> (f True, f 'c')
3875 Alternatively, you can give a type signature to the enclosing
3876 context, which GHC can "push down" to find the type for the variable:
3878 (\ f -> (f True, f 'c')) :: (forall a. a->a) -> (Bool,Char)
3880 Here the type signature on the expression can be pushed inwards
3881 to give a type signature for f. Similarly, and more commonly,
3882 one can give a type signature for the function itself:
3884 h :: (forall a. a->a) -> (Bool,Char)
3885 h f = (f True, f 'c')
3887 You don't need to give a type signature if the lambda bound variable
3888 is a constructor argument. Here is an example we saw earlier:
3890 f :: T a -> a -> (a, Char)
3891 f (T1 w k) x = (w k x, w 'c' 'd')
3893 Here we do not need to give a type signature to <literal>w</literal>, because
3894 it is an argument of constructor <literal>T1</literal> and that tells GHC all
3901 <sect3 id="implicit-quant">
3902 <title>Implicit quantification</title>
3905 GHC performs implicit quantification as follows. <emphasis>At the top level (only) of
3906 user-written types, if and only if there is no explicit <literal>forall</literal>,
3907 GHC finds all the type variables mentioned in the type that are not already
3908 in scope, and universally quantifies them.</emphasis> For example, the following pairs are
3912 f :: forall a. a -> a
3919 h :: forall b. a -> b -> b
3925 Notice that GHC does <emphasis>not</emphasis> find the innermost possible quantification
3928 f :: (a -> a) -> Int
3930 f :: forall a. (a -> a) -> Int
3932 f :: (forall a. a -> a) -> Int
3935 g :: (Ord a => a -> a) -> Int
3936 -- MEANS the illegal type
3937 g :: forall a. (Ord a => a -> a) -> Int
3939 g :: (forall a. Ord a => a -> a) -> Int
3941 The latter produces an illegal type, which you might think is silly,
3942 but at least the rule is simple. If you want the latter type, you
3943 can write your for-alls explicitly. Indeed, doing so is strongly advised
3950 <sect2 id="impredicative-polymorphism">
3951 <title>Impredicative polymorphism
3953 <para>GHC supports <emphasis>impredicative polymorphism</emphasis>. This means
3954 that you can call a polymorphic function at a polymorphic type, and
3955 parameterise data structures over polymorphic types. For example:
3957 f :: Maybe (forall a. [a] -> [a]) -> Maybe ([Int], [Char])
3958 f (Just g) = Just (g [3], g "hello")
3961 Notice here that the <literal>Maybe</literal> type is parameterised by the
3962 <emphasis>polymorphic</emphasis> type <literal>(forall a. [a] ->
3965 <para>The technical details of this extension are described in the paper
3966 <ulink url="http://research.microsoft.com/%7Esimonpj/papers/boxy">Boxy types:
3967 type inference for higher-rank types and impredicativity</ulink>,
3968 which appeared at ICFP 2006.
3972 <sect2 id="scoped-type-variables">
3973 <title>Lexically scoped type variables
3977 GHC supports <emphasis>lexically scoped type variables</emphasis>, without
3978 which some type signatures are simply impossible to write. For example:
3980 f :: forall a. [a] -> [a]
3986 The type signature for <literal>f</literal> brings the type variable <literal>a</literal> into scope; it scopes over
3987 the entire definition of <literal>f</literal>.
3988 In particular, it is in scope at the type signature for <varname>ys</varname>.
3989 In Haskell 98 it is not possible to declare
3990 a type for <varname>ys</varname>; a major benefit of scoped type variables is that
3991 it becomes possible to do so.
3993 <para>Lexically-scoped type variables are enabled by
3994 <option>-fglasgow-exts</option>.
3996 <para>Note: GHC 6.6 contains substantial changes to the way that scoped type
3997 variables work, compared to earlier releases. Read this section
4001 <title>Overview</title>
4003 <para>The design follows the following principles
4005 <listitem><para>A scoped type variable stands for a type <emphasis>variable</emphasis>, and not for
4006 a <emphasis>type</emphasis>. (This is a change from GHC's earlier
4007 design.)</para></listitem>
4008 <listitem><para>Furthermore, distinct lexical type variables stand for distinct
4009 type variables. This means that every programmer-written type signature
4010 (includin one that contains free scoped type variables) denotes a
4011 <emphasis>rigid</emphasis> type; that is, the type is fully known to the type
4012 checker, and no inference is involved.</para></listitem>
4013 <listitem><para>Lexical type variables may be alpha-renamed freely, without
4014 changing the program.</para></listitem>
4018 A <emphasis>lexically scoped type variable</emphasis> can be bound by:
4020 <listitem><para>A declaration type signature (<xref linkend="decl-type-sigs"/>)</para></listitem>
4021 <listitem><para>An expression type signature (<xref linkend="exp-type-sigs"/>)</para></listitem>
4022 <listitem><para>A pattern type signature (<xref linkend="pattern-type-sigs"/>)</para></listitem>
4023 <listitem><para>Class and instance declarations (<xref linkend="cls-inst-scoped-tyvars"/>)</para></listitem>
4027 In Haskell, a programmer-written type signature is implicitly quantifed over
4028 its free type variables (<ulink
4029 url="http://haskell.org/onlinereport/decls.html#sect4.1.2">Section
4031 of the Haskel Report).
4032 Lexically scoped type variables affect this implicit quantification rules
4033 as follows: any type variable that is in scope is <emphasis>not</emphasis> universally
4034 quantified. For example, if type variable <literal>a</literal> is in scope,
4037 (e :: a -> a) means (e :: a -> a)
4038 (e :: b -> b) means (e :: forall b. b->b)
4039 (e :: a -> b) means (e :: forall b. a->b)
4047 <sect3 id="decl-type-sigs">
4048 <title>Declaration type signatures</title>
4049 <para>A declaration type signature that has <emphasis>explicit</emphasis>
4050 quantification (using <literal>forall</literal>) brings into scope the
4051 explicitly-quantified
4052 type variables, in the definition of the named function(s). For example:
4054 f :: forall a. [a] -> [a]
4055 f (x:xs) = xs ++ [ x :: a ]
4057 The "<literal>forall a</literal>" brings "<literal>a</literal>" into scope in
4058 the definition of "<literal>f</literal>".
4060 <para>This only happens if the quantification in <literal>f</literal>'s type
4061 signature is explicit. For example:
4064 g (x:xs) = xs ++ [ x :: a ]
4066 This program will be rejected, because "<literal>a</literal>" does not scope
4067 over the definition of "<literal>f</literal>", so "<literal>x::a</literal>"
4068 means "<literal>x::forall a. a</literal>" by Haskell's usual implicit
4069 quantification rules.
4073 <sect3 id="exp-type-sigs">
4074 <title>Expression type signatures</title>
4076 <para>An expression type signature that has <emphasis>explicit</emphasis>
4077 quantification (using <literal>forall</literal>) brings into scope the
4078 explicitly-quantified
4079 type variables, in the annotated expression. For example:
4081 f = runST ( (op >>= \(x :: STRef s Int) -> g x) :: forall s. ST s Bool )
4083 Here, the type signature <literal>forall a. ST s Bool</literal> brings the
4084 type variable <literal>s</literal> into scope, in the annotated expression
4085 <literal>(op >>= \(x :: STRef s Int) -> g x)</literal>.
4090 <sect3 id="pattern-type-sigs">
4091 <title>Pattern type signatures</title>
4093 A type signature may occur in any pattern; this is a <emphasis>pattern type
4094 signature</emphasis>.
4097 -- f and g assume that 'a' is already in scope
4098 f = \(x::Int, y::a) -> x
4100 h ((x,y) :: (Int,Bool)) = (y,x)
4102 In the case where all the type variables in the pattern type sigature are
4103 already in scope (i.e. bound by the enclosing context), matters are simple: the
4104 signature simply constrains the type of the pattern in the obvious way.
4107 There is only one situation in which you can write a pattern type signature that
4108 mentions a type variable that is not already in scope, namely in pattern match
4109 of an existential data constructor. For example:
4111 data T = forall a. MkT [a]
4114 k (MkT [t::a]) = MkT t3
4118 Here, the pattern type signature <literal>(t::a)</literal> mentions a lexical type
4119 variable that is not already in scope. Indeed, it cannot already be in scope,
4120 because it is bound by the pattern match. GHC's rule is that in this situation
4121 (and only then), a pattern type signature can mention a type variable that is
4122 not already in scope; the effect is to bring it into scope, standing for the
4123 existentially-bound type variable.
4126 If this seems a little odd, we think so too. But we must have
4127 <emphasis>some</emphasis> way to bring such type variables into scope, else we
4128 could not name existentially-bound type variables in subequent type signatures.
4131 This is (now) the <emphasis>only</emphasis> situation in which a pattern type
4132 signature is allowed to mention a lexical variable that is not already in
4134 For example, both <literal>f</literal> and <literal>g</literal> would be
4135 illegal if <literal>a</literal> was not already in scope.
4141 <!-- ==================== Commented out part about result type signatures
4143 <sect3 id="result-type-sigs">
4144 <title>Result type signatures</title>
4147 The result type of a function, lambda, or case expression alternative can be given a signature, thus:
4150 {- f assumes that 'a' is already in scope -}
4151 f x y :: [a] = [x,y,x]
4153 g = \ x :: [Int] -> [3,4]
4155 h :: forall a. [a] -> a
4159 The final <literal>:: [a]</literal> after the patterns of <literal>f</literal> gives the type of
4160 the result of the function. Similarly, the body of the lambda in the RHS of
4161 <literal>g</literal> is <literal>[Int]</literal>, and the RHS of the case
4162 alternative in <literal>h</literal> is <literal>a</literal>.
4164 <para> A result type signature never brings new type variables into scope.</para>
4166 There are a couple of syntactic wrinkles. First, notice that all three
4167 examples would parse quite differently with parentheses:
4169 {- f assumes that 'a' is already in scope -}
4170 f x (y :: [a]) = [x,y,x]
4172 g = \ (x :: [Int]) -> [3,4]
4174 h :: forall a. [a] -> a
4178 Now the signature is on the <emphasis>pattern</emphasis>; and
4179 <literal>h</literal> would certainly be ill-typed (since the pattern
4180 <literal>(y:ys)</literal> cannot have the type <literal>a</literal>.
4182 Second, to avoid ambiguity, the type after the “<literal>::</literal>” in a result
4183 pattern signature on a lambda or <literal>case</literal> must be atomic (i.e. a single
4184 token or a parenthesised type of some sort). To see why,
4185 consider how one would parse this:
4194 <sect3 id="cls-inst-scoped-tyvars">
4195 <title>Class and instance declarations</title>
4198 The type variables in the head of a <literal>class</literal> or <literal>instance</literal> declaration
4199 scope over the methods defined in the <literal>where</literal> part. For example:
4217 <sect2 id="typing-binds">
4218 <title>Generalised typing of mutually recursive bindings</title>
4221 The Haskell Report specifies that a group of bindings (at top level, or in a
4222 <literal>let</literal> or <literal>where</literal>) should be sorted into
4223 strongly-connected components, and then type-checked in dependency order
4224 (<ulink url="http://haskell.org/onlinereport/decls.html#sect4.5.1">Haskell
4225 Report, Section 4.5.1</ulink>).
4226 As each group is type-checked, any binders of the group that
4228 an explicit type signature are put in the type environment with the specified
4230 and all others are monomorphic until the group is generalised
4231 (<ulink url="http://haskell.org/onlinereport/decls.html#sect4.5.2">Haskell Report, Section 4.5.2</ulink>).
4234 <para>Following a suggestion of Mark Jones, in his paper
4235 <ulink url="http://www.cse.ogi.edu/~mpj/thih/">Typing Haskell in
4237 GHC implements a more general scheme. If <option>-XRelaxedPolyRec</option> is
4239 <emphasis>the dependency analysis ignores references to variables that have an explicit
4240 type signature</emphasis>.
4241 As a result of this refined dependency analysis, the dependency groups are smaller, and more bindings will
4242 typecheck. For example, consider:
4244 f :: Eq a => a -> Bool
4245 f x = (x == x) || g True || g "Yes"
4247 g y = (y <= y) || f True
4249 This is rejected by Haskell 98, but under Jones's scheme the definition for
4250 <literal>g</literal> is typechecked first, separately from that for
4251 <literal>f</literal>,
4252 because the reference to <literal>f</literal> in <literal>g</literal>'s right
4253 hand side is ingored by the dependency analysis. Then <literal>g</literal>'s
4254 type is generalised, to get
4256 g :: Ord a => a -> Bool
4258 Now, the defintion for <literal>f</literal> is typechecked, with this type for
4259 <literal>g</literal> in the type environment.
4263 The same refined dependency analysis also allows the type signatures of
4264 mutually-recursive functions to have different contexts, something that is illegal in
4265 Haskell 98 (Section 4.5.2, last sentence). With
4266 <option>-XRelaxedPolyRec</option>
4267 GHC only insists that the type signatures of a <emphasis>refined</emphasis> group have identical
4268 type signatures; in practice this means that only variables bound by the same
4269 pattern binding must have the same context. For example, this is fine:
4271 f :: Eq a => a -> Bool
4272 f x = (x == x) || g True
4274 g :: Ord a => a -> Bool
4275 g y = (y <= y) || f True
4280 <sect2 id="type-families">
4281 <title>Type families
4285 GHC supports the definition of type families indexed by types. They may be
4286 seen as an extension of Haskell 98's class-based overloading of values to
4287 types. When type families are declared in classes, they are also known as
4291 There are two forms of type families: data families and type synonym families.
4292 Currently, only the former are fully implemented, while we are still working
4293 on the latter. As a result, the specification of the language extension is
4294 also still to some degree in flux. Hence, a more detailed description of
4295 the language extension and its use is currently available
4296 from <ulink url="http://haskell.org/haskellwiki/GHC/Indexed_types">the Haskell
4297 wiki page on type families</ulink>. The material will be moved to this user's
4298 guide when it has stabilised.
4301 Type families are enabled by the flag <option>-XTypeFamilies</option>.
4308 <!-- ==================== End of type system extensions ================= -->
4310 <!-- ====================== TEMPLATE HASKELL ======================= -->
4312 <sect1 id="template-haskell">
4313 <title>Template Haskell</title>
4315 <para>Template Haskell allows you to do compile-time meta-programming in
4318 the main technical innovations is discussed in "<ulink
4319 url="http://research.microsoft.com/~simonpj/papers/meta-haskell">
4320 Template Meta-programming for Haskell</ulink>" (Proc Haskell Workshop 2002).
4323 There is a Wiki page about
4324 Template Haskell at <ulink url="http://haskell.org/haskellwiki/Template_Haskell">
4325 http://www.haskell.org/haskellwiki/Template_Haskell</ulink>, and that is the best place to look for
4329 url="http://www.haskell.org/ghc/docs/latest/html/libraries/index.html">online
4330 Haskell library reference material</ulink>
4331 (look for module <literal>Language.Haskell.TH</literal>).
4332 Many changes to the original design are described in
4333 <ulink url="http://research.microsoft.com/~simonpj/papers/meta-haskell/notes2.ps">
4334 Notes on Template Haskell version 2</ulink>.
4335 Not all of these changes are in GHC, however.
4338 <para> The first example from that paper is set out below (<xref linkend="th-example"/>)
4339 as a worked example to help get you started.
4343 The documentation here describes the realisation of Template Haskell in GHC. It is not detailed enough to
4344 understand Template Haskell; see the <ulink url="http://haskell.org/haskellwiki/Template_Haskell">
4349 <title>Syntax</title>
4351 <para> Template Haskell has the following new syntactic
4352 constructions. You need to use the flag
4353 <option>-XTemplateHaskell</option>
4354 <indexterm><primary><option>-XTemplateHaskell</option></primary>
4355 </indexterm>to switch these syntactic extensions on
4356 (<option>-XTemplateHaskell</option> is no longer implied by
4357 <option>-fglasgow-exts</option>).</para>
4361 A splice is written <literal>$x</literal>, where <literal>x</literal> is an
4362 identifier, or <literal>$(...)</literal>, where the "..." is an arbitrary expression.
4363 There must be no space between the "$" and the identifier or parenthesis. This use
4364 of "$" overrides its meaning as an infix operator, just as "M.x" overrides the meaning
4365 of "." as an infix operator. If you want the infix operator, put spaces around it.
4367 <para> A splice can occur in place of
4369 <listitem><para> an expression; the spliced expression must
4370 have type <literal>Q Exp</literal></para></listitem>
4371 <listitem><para> a list of top-level declarations; the spliced expression must have type <literal>Q [Dec]</literal></para></listitem>
4374 Inside a splice you can can only call functions defined in imported modules,
4375 not functions defined elsewhere in the same module.</listitem>
4379 A expression quotation is written in Oxford brackets, thus:
4381 <listitem><para> <literal>[| ... |]</literal>, where the "..." is an expression;
4382 the quotation has type <literal>Q Exp</literal>.</para></listitem>
4383 <listitem><para> <literal>[d| ... |]</literal>, where the "..." is a list of top-level declarations;
4384 the quotation has type <literal>Q [Dec]</literal>.</para></listitem>
4385 <listitem><para> <literal>[t| ... |]</literal>, where the "..." is a type;
4386 the quotation has type <literal>Q Typ</literal>.</para></listitem>
4387 </itemizedlist></para></listitem>
4390 A name can be quoted with either one or two prefix single quotes:
4392 <listitem><para> <literal>'f</literal> has type <literal>Name</literal>, and names the function <literal>f</literal>.
4393 Similarly <literal>'C</literal> has type <literal>Name</literal> and names the data constructor <literal>C</literal>.
4394 In general <literal>'</literal><replaceable>thing</replaceable> interprets <replaceable>thing</replaceable> in an expression context.
4396 <listitem><para> <literal>''T</literal> has type <literal>Name</literal>, and names the type constructor <literal>T</literal>.
4397 That is, <literal>''</literal><replaceable>thing</replaceable> interprets <replaceable>thing</replaceable> in a type context.
4400 These <literal>Names</literal> can be used to construct Template Haskell expressions, patterns, delarations etc. They
4401 may also be given as an argument to the <literal>reify</literal> function.
4407 (Compared to the original paper, there are many differnces of detail.
4408 The syntax for a declaration splice uses "<literal>$</literal>" not "<literal>splice</literal>".
4409 The type of the enclosed expression must be <literal>Q [Dec]</literal>, not <literal>[Q Dec]</literal>.
4410 Type splices are not implemented, and neither are pattern splices or quotations.
4414 <sect2> <title> Using Template Haskell </title>
4418 The data types and monadic constructor functions for Template Haskell are in the library
4419 <literal>Language.Haskell.THSyntax</literal>.
4423 You can only run a function at compile time if it is imported from another module. That is,
4424 you can't define a function in a module, and call it from within a splice in the same module.
4425 (It would make sense to do so, but it's hard to implement.)
4429 Furthermore, you can only run a function at compile time if it is imported
4430 from another module <emphasis>that is not part of a mutually-recursive group of modules
4431 that includes the module currently being compiled</emphasis>. For example, when compiling module A,
4432 you can only run Template Haskell functions imported from B if B does not import A (directly or indirectly).
4433 The reason should be clear: to run B we must compile and run A, but we are currently type-checking A.
4437 The flag <literal>-ddump-splices</literal> shows the expansion of all top-level splices as they happen.
4440 If you are building GHC from source, you need at least a stage-2 bootstrap compiler to
4441 run Template Haskell. A stage-1 compiler will reject the TH constructs. Reason: TH
4442 compiles and runs a program, and then looks at the result. So it's important that
4443 the program it compiles produces results whose representations are identical to
4444 those of the compiler itself.
4448 <para> Template Haskell works in any mode (<literal>--make</literal>, <literal>--interactive</literal>,
4449 or file-at-a-time). There used to be a restriction to the former two, but that restriction
4454 <sect2 id="th-example"> <title> A Template Haskell Worked Example </title>
4455 <para>To help you get over the confidence barrier, try out this skeletal worked example.
4456 First cut and paste the two modules below into "Main.hs" and "Printf.hs":</para>
4463 -- Import our template "pr"
4464 import Printf ( pr )
4466 -- The splice operator $ takes the Haskell source code
4467 -- generated at compile time by "pr" and splices it into
4468 -- the argument of "putStrLn".
4469 main = putStrLn ( $(pr "Hello") )
4475 -- Skeletal printf from the paper.
4476 -- It needs to be in a separate module to the one where
4477 -- you intend to use it.
4479 -- Import some Template Haskell syntax
4480 import Language.Haskell.TH
4482 -- Describe a format string
4483 data Format = D | S | L String
4485 -- Parse a format string. This is left largely to you
4486 -- as we are here interested in building our first ever
4487 -- Template Haskell program and not in building printf.
4488 parse :: String -> [Format]
4491 -- Generate Haskell source code from a parsed representation
4492 -- of the format string. This code will be spliced into
4493 -- the module which calls "pr", at compile time.
4494 gen :: [Format] -> Q Exp
4495 gen [D] = [| \n -> show n |]
4496 gen [S] = [| \s -> s |]
4497 gen [L s] = stringE s
4499 -- Here we generate the Haskell code for the splice
4500 -- from an input format string.
4501 pr :: String -> Q Exp
4502 pr s = gen (parse s)
4505 <para>Now run the compiler (here we are a Cygwin prompt on Windows):
4508 $ ghc --make -XTemplateHaskell main.hs -o main.exe
4511 <para>Run "main.exe" and here is your output:</para>
4521 <title>Using Template Haskell with Profiling</title>
4522 <indexterm><primary>profiling</primary><secondary>with Template Haskell</secondary></indexterm>
4524 <para>Template Haskell relies on GHC's built-in bytecode compiler and
4525 interpreter to run the splice expressions. The bytecode interpreter
4526 runs the compiled expression on top of the same runtime on which GHC
4527 itself is running; this means that the compiled code referred to by
4528 the interpreted expression must be compatible with this runtime, and
4529 in particular this means that object code that is compiled for
4530 profiling <emphasis>cannot</emphasis> be loaded and used by a splice
4531 expression, because profiled object code is only compatible with the
4532 profiling version of the runtime.</para>
4534 <para>This causes difficulties if you have a multi-module program
4535 containing Template Haskell code and you need to compile it for
4536 profiling, because GHC cannot load the profiled object code and use it
4537 when executing the splices. Fortunately GHC provides a workaround.
4538 The basic idea is to compile the program twice:</para>
4542 <para>Compile the program or library first the normal way, without
4543 <option>-prof</option><indexterm><primary><option>-prof</option></primary></indexterm>.</para>
4546 <para>Then compile it again with <option>-prof</option>, and
4547 additionally use <option>-osuf
4548 p_o</option><indexterm><primary><option>-osuf</option></primary></indexterm>
4549 to name the object files differentliy (you can choose any suffix
4550 that isn't the normal object suffix here). GHC will automatically
4551 load the object files built in the first step when executing splice
4552 expressions. If you omit the <option>-osuf</option> flag when
4553 building with <option>-prof</option> and Template Haskell is used,
4554 GHC will emit an error message. </para>
4561 <!-- ===================== Arrow notation =================== -->
4563 <sect1 id="arrow-notation">
4564 <title>Arrow notation
4567 <para>Arrows are a generalization of monads introduced by John Hughes.
4568 For more details, see
4573 “Generalising Monads to Arrows”,
4574 John Hughes, in <citetitle>Science of Computer Programming</citetitle> 37,
4575 pp67–111, May 2000.
4581 “<ulink url="http://www.soi.city.ac.uk/~ross/papers/notation.html">A New Notation for Arrows</ulink>”,
4582 Ross Paterson, in <citetitle>ICFP</citetitle>, Sep 2001.
4588 “<ulink url="http://www.soi.city.ac.uk/~ross/papers/fop.html">Arrows and Computation</ulink>”,
4589 Ross Paterson, in <citetitle>The Fun of Programming</citetitle>,
4595 and the arrows web page at
4596 <ulink url="http://www.haskell.org/arrows/"><literal>http://www.haskell.org/arrows/</literal></ulink>.
4597 With the <option>-XArrows</option> flag, GHC supports the arrow
4598 notation described in the second of these papers.
4599 What follows is a brief introduction to the notation;
4600 it won't make much sense unless you've read Hughes's paper.
4601 This notation is translated to ordinary Haskell,
4602 using combinators from the
4603 <ulink url="../libraries/base/Control-Arrow.html"><literal>Control.Arrow</literal></ulink>
4607 <para>The extension adds a new kind of expression for defining arrows:
4609 <replaceable>exp</replaceable><superscript>10</superscript> ::= ...
4610 | proc <replaceable>apat</replaceable> -> <replaceable>cmd</replaceable>
4612 where <literal>proc</literal> is a new keyword.
4613 The variables of the pattern are bound in the body of the
4614 <literal>proc</literal>-expression,
4615 which is a new sort of thing called a <firstterm>command</firstterm>.
4616 The syntax of commands is as follows:
4618 <replaceable>cmd</replaceable> ::= <replaceable>exp</replaceable><superscript>10</superscript> -< <replaceable>exp</replaceable>
4619 | <replaceable>exp</replaceable><superscript>10</superscript> -<< <replaceable>exp</replaceable>
4620 | <replaceable>cmd</replaceable><superscript>0</superscript>
4622 with <replaceable>cmd</replaceable><superscript>0</superscript> up to
4623 <replaceable>cmd</replaceable><superscript>9</superscript> defined using
4624 infix operators as for expressions, and
4626 <replaceable>cmd</replaceable><superscript>10</superscript> ::= \ <replaceable>apat</replaceable> ... <replaceable>apat</replaceable> -> <replaceable>cmd</replaceable>
4627 | let <replaceable>decls</replaceable> in <replaceable>cmd</replaceable>
4628 | if <replaceable>exp</replaceable> then <replaceable>cmd</replaceable> else <replaceable>cmd</replaceable>
4629 | case <replaceable>exp</replaceable> of { <replaceable>calts</replaceable> }
4630 | do { <replaceable>cstmt</replaceable> ; ... <replaceable>cstmt</replaceable> ; <replaceable>cmd</replaceable> }
4631 | <replaceable>fcmd</replaceable>
4633 <replaceable>fcmd</replaceable> ::= <replaceable>fcmd</replaceable> <replaceable>aexp</replaceable>
4634 | ( <replaceable>cmd</replaceable> )
4635 | (| <replaceable>aexp</replaceable> <replaceable>cmd</replaceable> ... <replaceable>cmd</replaceable> |)
4637 <replaceable>cstmt</replaceable> ::= let <replaceable>decls</replaceable>
4638 | <replaceable>pat</replaceable> <- <replaceable>cmd</replaceable>
4639 | rec { <replaceable>cstmt</replaceable> ; ... <replaceable>cstmt</replaceable> [;] }
4640 | <replaceable>cmd</replaceable>
4642 where <replaceable>calts</replaceable> are like <replaceable>alts</replaceable>
4643 except that the bodies are commands instead of expressions.
4647 Commands produce values, but (like monadic computations)
4648 may yield more than one value,
4649 or none, and may do other things as well.
4650 For the most part, familiarity with monadic notation is a good guide to
4652 However the values of expressions, even monadic ones,
4653 are determined by the values of the variables they contain;
4654 this is not necessarily the case for commands.
4658 A simple example of the new notation is the expression
4660 proc x -> f -< x+1
4662 We call this a <firstterm>procedure</firstterm> or
4663 <firstterm>arrow abstraction</firstterm>.
4664 As with a lambda expression, the variable <literal>x</literal>
4665 is a new variable bound within the <literal>proc</literal>-expression.
4666 It refers to the input to the arrow.
4667 In the above example, <literal>-<</literal> is not an identifier but an
4668 new reserved symbol used for building commands from an expression of arrow
4669 type and an expression to be fed as input to that arrow.
4670 (The weird look will make more sense later.)
4671 It may be read as analogue of application for arrows.
4672 The above example is equivalent to the Haskell expression
4674 arr (\ x -> x+1) >>> f
4676 That would make no sense if the expression to the left of
4677 <literal>-<</literal> involves the bound variable <literal>x</literal>.
4678 More generally, the expression to the left of <literal>-<</literal>
4679 may not involve any <firstterm>local variable</firstterm>,
4680 i.e. a variable bound in the current arrow abstraction.
4681 For such a situation there is a variant <literal>-<<</literal>, as in
4683 proc x -> f x -<< x+1
4685 which is equivalent to
4687 arr (\ x -> (f x, x+1)) >>> app
4689 so in this case the arrow must belong to the <literal>ArrowApply</literal>
4691 Such an arrow is equivalent to a monad, so if you're using this form
4692 you may find a monadic formulation more convenient.
4696 <title>do-notation for commands</title>
4699 Another form of command is a form of <literal>do</literal>-notation.
4700 For example, you can write
4709 You can read this much like ordinary <literal>do</literal>-notation,
4710 but with commands in place of monadic expressions.
4711 The first line sends the value of <literal>x+1</literal> as an input to
4712 the arrow <literal>f</literal>, and matches its output against
4713 <literal>y</literal>.
4714 In the next line, the output is discarded.
4715 The arrow <function>returnA</function> is defined in the
4716 <ulink url="../libraries/base/Control-Arrow.html"><literal>Control.Arrow</literal></ulink>
4717 module as <literal>arr id</literal>.
4718 The above example is treated as an abbreviation for
4720 arr (\ x -> (x, x)) >>>
4721 first (arr (\ x -> x+1) >>> f) >>>
4722 arr (\ (y, x) -> (y, (x, y))) >>>
4723 first (arr (\ y -> 2*y) >>> g) >>>
4725 arr (\ (x, y) -> let z = x+y in ((x, z), z)) >>>
4726 first (arr (\ (x, z) -> x*z) >>> h) >>>
4727 arr (\ (t, z) -> t+z) >>>
4730 Note that variables not used later in the composition are projected out.
4731 After simplification using rewrite rules (see <xref linkend="rewrite-rules"/>)
4733 <ulink url="../libraries/base/Control-Arrow.html"><literal>Control.Arrow</literal></ulink>
4734 module, this reduces to
4736 arr (\ x -> (x+1, x)) >>>
4738 arr (\ (y, x) -> (2*y, (x, y))) >>>
4740 arr (\ (_, (x, y)) -> let z = x+y in (x*z, z)) >>>
4742 arr (\ (t, z) -> t+z)
4744 which is what you might have written by hand.
4745 With arrow notation, GHC keeps track of all those tuples of variables for you.
4749 Note that although the above translation suggests that
4750 <literal>let</literal>-bound variables like <literal>z</literal> must be
4751 monomorphic, the actual translation produces Core,
4752 so polymorphic variables are allowed.
4756 It's also possible to have mutually recursive bindings,
4757 using the new <literal>rec</literal> keyword, as in the following example:
4759 counter :: ArrowCircuit a => a Bool Int
4760 counter = proc reset -> do
4761 rec output <- returnA -< if reset then 0 else next
4762 next <- delay 0 -< output+1
4763 returnA -< output
4765 The translation of such forms uses the <function>loop</function> combinator,
4766 so the arrow concerned must belong to the <literal>ArrowLoop</literal> class.
4772 <title>Conditional commands</title>
4775 In the previous example, we used a conditional expression to construct the
4777 Sometimes we want to conditionally execute different commands, as in
4784 which is translated to
4786 arr (\ (x,y) -> if f x y then Left x else Right y) >>>
4787 (arr (\x -> x+1) >>> f) ||| (arr (\y -> y+2) >>> g)
4789 Since the translation uses <function>|||</function>,
4790 the arrow concerned must belong to the <literal>ArrowChoice</literal> class.
4794 There are also <literal>case</literal> commands, like
4800 y <- h -< (x1, x2)
4804 The syntax is the same as for <literal>case</literal> expressions,
4805 except that the bodies of the alternatives are commands rather than expressions.
4806 The translation is similar to that of <literal>if</literal> commands.
4812 <title>Defining your own control structures</title>
4815 As we're seen, arrow notation provides constructs,
4816 modelled on those for expressions,
4817 for sequencing, value recursion and conditionals.
4818 But suitable combinators,
4819 which you can define in ordinary Haskell,
4820 may also be used to build new commands out of existing ones.
4821 The basic idea is that a command defines an arrow from environments to values.
4822 These environments assign values to the free local variables of the command.
4823 Thus combinators that produce arrows from arrows
4824 may also be used to build commands from commands.
4825 For example, the <literal>ArrowChoice</literal> class includes a combinator
4827 ArrowChoice a => (<+>) :: a e c -> a e c -> a e c
4829 so we can use it to build commands:
4831 expr' = proc x -> do
4834 symbol Plus -< ()
4835 y <- term -< ()
4838 symbol Minus -< ()
4839 y <- term -< ()
4842 (The <literal>do</literal> on the first line is needed to prevent the first
4843 <literal><+> ...</literal> from being interpreted as part of the
4844 expression on the previous line.)
4845 This is equivalent to
4847 expr' = (proc x -> returnA -< x)
4848 <+> (proc x -> do
4849 symbol Plus -< ()
4850 y <- term -< ()
4852 <+> (proc x -> do
4853 symbol Minus -< ()
4854 y <- term -< ()
4857 It is essential that this operator be polymorphic in <literal>e</literal>
4858 (representing the environment input to the command
4859 and thence to its subcommands)
4860 and satisfy the corresponding naturality property
4862 arr k >>> (f <+> g) = (arr k >>> f) <+> (arr k >>> g)
4864 at least for strict <literal>k</literal>.
4865 (This should be automatic if you're not using <function>seq</function>.)
4866 This ensures that environments seen by the subcommands are environments
4867 of the whole command,
4868 and also allows the translation to safely trim these environments.
4869 The operator must also not use any variable defined within the current
4874 We could define our own operator
4876 untilA :: ArrowChoice a => a e () -> a e Bool -> a e ()
4877 untilA body cond = proc x ->
4878 if cond x then returnA -< ()
4881 untilA body cond -< x
4883 and use it in the same way.
4884 Of course this infix syntax only makes sense for binary operators;
4885 there is also a more general syntax involving special brackets:
4889 (|untilA (increment -< x+y) (within 0.5 -< x)|)
4896 <title>Primitive constructs</title>
4899 Some operators will need to pass additional inputs to their subcommands.
4900 For example, in an arrow type supporting exceptions,
4901 the operator that attaches an exception handler will wish to pass the
4902 exception that occurred to the handler.
4903 Such an operator might have a type
4905 handleA :: ... => a e c -> a (e,Ex) c -> a e c
4907 where <literal>Ex</literal> is the type of exceptions handled.
4908 You could then use this with arrow notation by writing a command
4910 body `handleA` \ ex -> handler
4912 so that if an exception is raised in the command <literal>body</literal>,
4913 the variable <literal>ex</literal> is bound to the value of the exception
4914 and the command <literal>handler</literal>,
4915 which typically refers to <literal>ex</literal>, is entered.
4916 Though the syntax here looks like a functional lambda,
4917 we are talking about commands, and something different is going on.
4918 The input to the arrow represented by a command consists of values for
4919 the free local variables in the command, plus a stack of anonymous values.
4920 In all the prior examples, this stack was empty.
4921 In the second argument to <function>handleA</function>,
4922 this stack consists of one value, the value of the exception.
4923 The command form of lambda merely gives this value a name.
4928 the values on the stack are paired to the right of the environment.
4929 So operators like <function>handleA</function> that pass
4930 extra inputs to their subcommands can be designed for use with the notation
4931 by pairing the values with the environment in this way.
4932 More precisely, the type of each argument of the operator (and its result)
4933 should have the form
4935 a (...(e,t1), ... tn) t
4937 where <replaceable>e</replaceable> is a polymorphic variable
4938 (representing the environment)
4939 and <replaceable>ti</replaceable> are the types of the values on the stack,
4940 with <replaceable>t1</replaceable> being the <quote>top</quote>.
4941 The polymorphic variable <replaceable>e</replaceable> must not occur in
4942 <replaceable>a</replaceable>, <replaceable>ti</replaceable> or
4943 <replaceable>t</replaceable>.
4944 However the arrows involved need not be the same.
4945 Here are some more examples of suitable operators:
4947 bracketA :: ... => a e b -> a (e,b) c -> a (e,c) d -> a e d
4948 runReader :: ... => a e c -> a' (e,State) c
4949 runState :: ... => a e c -> a' (e,State) (c,State)
4951 We can supply the extra input required by commands built with the last two
4952 by applying them to ordinary expressions, as in
4956 (|runReader (do { ... })|) s
4958 which adds <literal>s</literal> to the stack of inputs to the command
4959 built using <function>runReader</function>.
4963 The command versions of lambda abstraction and application are analogous to
4964 the expression versions.
4965 In particular, the beta and eta rules describe equivalences of commands.
4966 These three features (operators, lambda abstraction and application)
4967 are the core of the notation; everything else can be built using them,
4968 though the results would be somewhat clumsy.
4969 For example, we could simulate <literal>do</literal>-notation by defining
4971 bind :: Arrow a => a e b -> a (e,b) c -> a e c
4972 u `bind` f = returnA &&& u >>> f
4974 bind_ :: Arrow a => a e b -> a e c -> a e c
4975 u `bind_` f = u `bind` (arr fst >>> f)
4977 We could simulate <literal>if</literal> by defining
4979 cond :: ArrowChoice a => a e b -> a e b -> a (e,Bool) b
4980 cond f g = arr (\ (e,b) -> if b then Left e else Right e) >>> f ||| g
4987 <title>Differences with the paper</title>
4992 <para>Instead of a single form of arrow application (arrow tail) with two
4993 translations, the implementation provides two forms
4994 <quote><literal>-<</literal></quote> (first-order)
4995 and <quote><literal>-<<</literal></quote> (higher-order).
5000 <para>User-defined operators are flagged with banana brackets instead of
5001 a new <literal>form</literal> keyword.
5010 <title>Portability</title>
5013 Although only GHC implements arrow notation directly,
5014 there is also a preprocessor
5016 <ulink url="http://www.haskell.org/arrows/">arrows web page</ulink>)
5017 that translates arrow notation into Haskell 98
5018 for use with other Haskell systems.
5019 You would still want to check arrow programs with GHC;
5020 tracing type errors in the preprocessor output is not easy.
5021 Modules intended for both GHC and the preprocessor must observe some
5022 additional restrictions:
5027 The module must import
5028 <ulink url="../libraries/base/Control-Arrow.html"><literal>Control.Arrow</literal></ulink>.
5034 The preprocessor cannot cope with other Haskell extensions.
5035 These would have to go in separate modules.
5041 Because the preprocessor targets Haskell (rather than Core),
5042 <literal>let</literal>-bound variables are monomorphic.
5053 <!-- ==================== BANG PATTERNS ================= -->
5055 <sect1 id="bang-patterns">
5056 <title>Bang patterns
5057 <indexterm><primary>Bang patterns</primary></indexterm>
5059 <para>GHC supports an extension of pattern matching called <emphasis>bang
5060 patterns</emphasis>. Bang patterns are under consideration for Haskell Prime.
5062 url="http://hackage.haskell.org/trac/haskell-prime/wiki/BangPatterns">Haskell
5063 prime feature description</ulink> contains more discussion and examples
5064 than the material below.
5067 Bang patterns are enabled by the flag <option>-XBangPatterns</option>.
5070 <sect2 id="bang-patterns-informal">
5071 <title>Informal description of bang patterns
5074 The main idea is to add a single new production to the syntax of patterns:
5078 Matching an expression <literal>e</literal> against a pattern <literal>!p</literal> is done by first
5079 evaluating <literal>e</literal> (to WHNF) and then matching the result against <literal>p</literal>.
5084 This definition makes <literal>f1</literal> is strict in <literal>x</literal>,
5085 whereas without the bang it would be lazy.
5086 Bang patterns can be nested of course:
5090 Here, <literal>f2</literal> is strict in <literal>x</literal> but not in
5091 <literal>y</literal>.
5092 A bang only really has an effect if it precedes a variable or wild-card pattern:
5097 Here, <literal>f3</literal> and <literal>f4</literal> are identical; putting a bang before a pattern that
5098 forces evaluation anyway does nothing.
5100 Bang patterns work in <literal>case</literal> expressions too, of course:
5102 g5 x = let y = f x in body
5103 g6 x = case f x of { y -> body }
5104 g7 x = case f x of { !y -> body }
5106 The functions <literal>g5</literal> and <literal>g6</literal> mean exactly the same thing.
5107 But <literal>g7</literal> evalutes <literal>(f x)</literal>, binds <literal>y</literal> to the
5108 result, and then evaluates <literal>body</literal>.
5110 Bang patterns work in <literal>let</literal> and <literal>where</literal>
5111 definitions too. For example:
5115 is a strict pattern: operationally, it evaluates <literal>e</literal>, matches
5116 it against the pattern <literal>[x,y]</literal>, and then evaluates <literal>b</literal>
5117 The "<literal>!</literal>" should not be regarded as part of the pattern; after all,
5118 in a function argument <literal>![x,y]</literal> means the
5119 same as <literal>[x,y]</literal>. Rather, the "<literal>!</literal>"
5120 is part of the syntax of <literal>let</literal> bindings.
5125 <sect2 id="bang-patterns-sem">
5126 <title>Syntax and semantics
5130 We add a single new production to the syntax of patterns:
5134 There is one problem with syntactic ambiguity. Consider:
5138 Is this a definition of the infix function "<literal>(!)</literal>",
5139 or of the "<literal>f</literal>" with a bang pattern? GHC resolves this
5140 ambiguity in favour of the latter. If you want to define
5141 <literal>(!)</literal> with bang-patterns enabled, you have to do so using
5146 The semantics of Haskell pattern matching is described in <ulink
5147 url="http://haskell.org/onlinereport/exps.html#sect3.17.2">
5148 Section 3.17.2</ulink> of the Haskell Report. To this description add
5149 one extra item 10, saying:
5150 <itemizedlist><listitem><para>Matching
5151 the pattern <literal>!pat</literal> against a value <literal>v</literal> behaves as follows:
5152 <itemizedlist><listitem><para>if <literal>v</literal> is bottom, the match diverges</para></listitem>
5153 <listitem><para>otherwise, <literal>pat</literal> is matched against
5154 <literal>v</literal></para></listitem>
5156 </para></listitem></itemizedlist>
5157 Similarly, in Figure 4 of <ulink url="http://haskell.org/onlinereport/exps.html#sect3.17.3">
5158 Section 3.17.3</ulink>, add a new case (t):
5160 case v of { !pat -> e; _ -> e' }
5161 = v `seq` case v of { pat -> e; _ -> e' }
5164 That leaves let expressions, whose translation is given in
5165 <ulink url="http://haskell.org/onlinereport/exps.html#sect3.12">Section
5167 of the Haskell Report.
5168 In the translation box, first apply
5169 the following transformation: for each pattern <literal>pi</literal> that is of
5170 form <literal>!qi = ei</literal>, transform it to <literal>(xi,!qi) = ((),ei)</literal>, and and replace <literal>e0</literal>
5171 by <literal>(xi `seq` e0)</literal>. Then, when none of the left-hand-side patterns
5172 have a bang at the top, apply the rules in the existing box.
5174 <para>The effect of the let rule is to force complete matching of the pattern
5175 <literal>qi</literal> before evaluation of the body is begun. The bang is
5176 retained in the translated form in case <literal>qi</literal> is a variable,
5184 The let-binding can be recursive. However, it is much more common for
5185 the let-binding to be non-recursive, in which case the following law holds:
5186 <literal>(let !p = rhs in body)</literal>
5188 <literal>(case rhs of !p -> body)</literal>
5191 A pattern with a bang at the outermost level is not allowed at the top level of
5197 <!-- ==================== ASSERTIONS ================= -->
5199 <sect1 id="assertions">
5201 <indexterm><primary>Assertions</primary></indexterm>
5205 If you want to make use of assertions in your standard Haskell code, you
5206 could define a function like the following:
5212 assert :: Bool -> a -> a
5213 assert False x = error "assertion failed!"
5220 which works, but gives you back a less than useful error message --
5221 an assertion failed, but which and where?
5225 One way out is to define an extended <function>assert</function> function which also
5226 takes a descriptive string to include in the error message and
5227 perhaps combine this with the use of a pre-processor which inserts
5228 the source location where <function>assert</function> was used.
5232 Ghc offers a helping hand here, doing all of this for you. For every
5233 use of <function>assert</function> in the user's source:
5239 kelvinToC :: Double -> Double
5240 kelvinToC k = assert (k >= 0.0) (k+273.15)
5246 Ghc will rewrite this to also include the source location where the
5253 assert pred val ==> assertError "Main.hs|15" pred val
5259 The rewrite is only performed by the compiler when it spots
5260 applications of <function>Control.Exception.assert</function>, so you
5261 can still define and use your own versions of
5262 <function>assert</function>, should you so wish. If not, import
5263 <literal>Control.Exception</literal> to make use
5264 <function>assert</function> in your code.
5268 GHC ignores assertions when optimisation is turned on with the
5269 <option>-O</option><indexterm><primary><option>-O</option></primary></indexterm> flag. That is, expressions of the form
5270 <literal>assert pred e</literal> will be rewritten to
5271 <literal>e</literal>. You can also disable assertions using the
5272 <option>-fignore-asserts</option>
5273 option<indexterm><primary><option>-fignore-asserts</option></primary>
5274 </indexterm>.</para>
5277 Assertion failures can be caught, see the documentation for the
5278 <literal>Control.Exception</literal> library for the details.
5284 <!-- =============================== PRAGMAS =========================== -->
5286 <sect1 id="pragmas">
5287 <title>Pragmas</title>
5289 <indexterm><primary>pragma</primary></indexterm>
5291 <para>GHC supports several pragmas, or instructions to the
5292 compiler placed in the source code. Pragmas don't normally affect
5293 the meaning of the program, but they might affect the efficiency
5294 of the generated code.</para>
5296 <para>Pragmas all take the form
5298 <literal>{-# <replaceable>word</replaceable> ... #-}</literal>
5300 where <replaceable>word</replaceable> indicates the type of
5301 pragma, and is followed optionally by information specific to that
5302 type of pragma. Case is ignored in
5303 <replaceable>word</replaceable>. The various values for
5304 <replaceable>word</replaceable> that GHC understands are described
5305 in the following sections; any pragma encountered with an
5306 unrecognised <replaceable>word</replaceable> is (silently)
5309 <sect2 id="deprecated-pragma">
5310 <title>DEPRECATED pragma</title>
5311 <indexterm><primary>DEPRECATED</primary>
5314 <para>The DEPRECATED pragma lets you specify that a particular
5315 function, class, or type, is deprecated. There are two
5320 <para>You can deprecate an entire module thus:</para>
5322 module Wibble {-# DEPRECATED "Use Wobble instead" #-} where
5325 <para>When you compile any module that import
5326 <literal>Wibble</literal>, GHC will print the specified
5331 <para>You can deprecate a function, class, type, or data constructor, with the
5332 following top-level declaration:</para>
5334 {-# DEPRECATED f, C, T "Don't use these" #-}
5336 <para>When you compile any module that imports and uses any
5337 of the specified entities, GHC will print the specified
5339 <para> You can only depecate entities declared at top level in the module
5340 being compiled, and you can only use unqualified names in the list of
5341 entities being deprecated. A capitalised name, such as <literal>T</literal>
5342 refers to <emphasis>either</emphasis> the type constructor <literal>T</literal>
5343 <emphasis>or</emphasis> the data constructor <literal>T</literal>, or both if
5344 both are in scope. If both are in scope, there is currently no way to deprecate
5345 one without the other (c.f. fixities <xref linkend="infix-tycons"/>).</para>
5348 Any use of the deprecated item, or of anything from a deprecated
5349 module, will be flagged with an appropriate message. However,
5350 deprecations are not reported for
5351 (a) uses of a deprecated function within its defining module, and
5352 (b) uses of a deprecated function in an export list.
5353 The latter reduces spurious complaints within a library
5354 in which one module gathers together and re-exports
5355 the exports of several others.
5357 <para>You can suppress the warnings with the flag
5358 <option>-fno-warn-deprecations</option>.</para>
5361 <sect2 id="include-pragma">
5362 <title>INCLUDE pragma</title>
5364 <para>The <literal>INCLUDE</literal> pragma is for specifying the names
5365 of C header files that should be <literal>#include</literal>'d into
5366 the C source code generated by the compiler for the current module (if
5367 compiling via C). For example:</para>
5370 {-# INCLUDE "foo.h" #-}
5371 {-# INCLUDE <stdio.h> #-}</programlisting>
5373 <para>The <literal>INCLUDE</literal> pragma(s) must appear at the top of
5374 your source file with any <literal>OPTIONS_GHC</literal>
5377 <para>An <literal>INCLUDE</literal> pragma is the preferred alternative
5378 to the <option>-#include</option> option (<xref
5379 linkend="options-C-compiler" />), because the
5380 <literal>INCLUDE</literal> pragma is understood by other
5381 compilers. Yet another alternative is to add the include file to each
5382 <literal>foreign import</literal> declaration in your code, but we
5383 don't recommend using this approach with GHC.</para>
5386 <sect2 id="inline-noinline-pragma">
5387 <title>INLINE and NOINLINE pragmas</title>
5389 <para>These pragmas control the inlining of function
5392 <sect3 id="inline-pragma">
5393 <title>INLINE pragma</title>
5394 <indexterm><primary>INLINE</primary></indexterm>
5396 <para>GHC (with <option>-O</option>, as always) tries to
5397 inline (or “unfold”) functions/values that are
5398 “small enough,” thus avoiding the call overhead
5399 and possibly exposing other more-wonderful optimisations.
5400 Normally, if GHC decides a function is “too
5401 expensive” to inline, it will not do so, nor will it
5402 export that unfolding for other modules to use.</para>
5404 <para>The sledgehammer you can bring to bear is the
5405 <literal>INLINE</literal><indexterm><primary>INLINE
5406 pragma</primary></indexterm> pragma, used thusly:</para>
5409 key_function :: Int -> String -> (Bool, Double)
5411 #ifdef __GLASGOW_HASKELL__
5412 {-# INLINE key_function #-}
5416 <para>(You don't need to do the C pre-processor carry-on
5417 unless you're going to stick the code through HBC—it
5418 doesn't like <literal>INLINE</literal> pragmas.)</para>
5420 <para>The major effect of an <literal>INLINE</literal> pragma
5421 is to declare a function's “cost” to be very low.
5422 The normal unfolding machinery will then be very keen to
5425 <para>Syntactically, an <literal>INLINE</literal> pragma for a
5426 function can be put anywhere its type signature could be
5429 <para><literal>INLINE</literal> pragmas are a particularly
5431 <literal>then</literal>/<literal>return</literal> (or
5432 <literal>bind</literal>/<literal>unit</literal>) functions in
5433 a monad. For example, in GHC's own
5434 <literal>UniqueSupply</literal> monad code, we have:</para>
5437 #ifdef __GLASGOW_HASKELL__
5438 {-# INLINE thenUs #-}
5439 {-# INLINE returnUs #-}
5443 <para>See also the <literal>NOINLINE</literal> pragma (<xref
5444 linkend="noinline-pragma"/>).</para>
5447 <sect3 id="noinline-pragma">
5448 <title>NOINLINE pragma</title>
5450 <indexterm><primary>NOINLINE</primary></indexterm>
5451 <indexterm><primary>NOTINLINE</primary></indexterm>
5453 <para>The <literal>NOINLINE</literal> pragma does exactly what
5454 you'd expect: it stops the named function from being inlined
5455 by the compiler. You shouldn't ever need to do this, unless
5456 you're very cautious about code size.</para>
5458 <para><literal>NOTINLINE</literal> is a synonym for
5459 <literal>NOINLINE</literal> (<literal>NOINLINE</literal> is
5460 specified by Haskell 98 as the standard way to disable
5461 inlining, so it should be used if you want your code to be
5465 <sect3 id="phase-control">
5466 <title>Phase control</title>
5468 <para> Sometimes you want to control exactly when in GHC's
5469 pipeline the INLINE pragma is switched on. Inlining happens
5470 only during runs of the <emphasis>simplifier</emphasis>. Each
5471 run of the simplifier has a different <emphasis>phase
5472 number</emphasis>; the phase number decreases towards zero.
5473 If you use <option>-dverbose-core2core</option> you'll see the
5474 sequence of phase numbers for successive runs of the
5475 simplifier. In an INLINE pragma you can optionally specify a
5479 <para>"<literal>INLINE[k] f</literal>" means: do not inline
5480 <literal>f</literal>
5481 until phase <literal>k</literal>, but from phase
5482 <literal>k</literal> onwards be very keen to inline it.
5485 <para>"<literal>INLINE[~k] f</literal>" means: be very keen to inline
5486 <literal>f</literal>
5487 until phase <literal>k</literal>, but from phase
5488 <literal>k</literal> onwards do not inline it.
5491 <para>"<literal>NOINLINE[k] f</literal>" means: do not inline
5492 <literal>f</literal>
5493 until phase <literal>k</literal>, but from phase
5494 <literal>k</literal> onwards be willing to inline it (as if
5495 there was no pragma).
5498 <para>"<literal>INLINE[~k] f</literal>" means: be willing to inline
5499 <literal>f</literal>
5500 until phase <literal>k</literal>, but from phase
5501 <literal>k</literal> onwards do not inline it.
5504 The same information is summarised here:
5506 -- Before phase 2 Phase 2 and later
5507 {-# INLINE [2] f #-} -- No Yes
5508 {-# INLINE [~2] f #-} -- Yes No
5509 {-# NOINLINE [2] f #-} -- No Maybe
5510 {-# NOINLINE [~2] f #-} -- Maybe No
5512 {-# INLINE f #-} -- Yes Yes
5513 {-# NOINLINE f #-} -- No No
5515 By "Maybe" we mean that the usual heuristic inlining rules apply (if the
5516 function body is small, or it is applied to interesting-looking arguments etc).
5517 Another way to understand the semantics is this:
5519 <listitem><para>For both INLINE and NOINLINE, the phase number says
5520 when inlining is allowed at all.</para></listitem>
5521 <listitem><para>The INLINE pragma has the additional effect of making the
5522 function body look small, so that when inlining is allowed it is very likely to
5527 <para>The same phase-numbering control is available for RULES
5528 (<xref linkend="rewrite-rules"/>).</para>
5532 <sect2 id="language-pragma">
5533 <title>LANGUAGE pragma</title>
5535 <indexterm><primary>LANGUAGE</primary><secondary>pragma</secondary></indexterm>
5536 <indexterm><primary>pragma</primary><secondary>LANGUAGE</secondary></indexterm>
5538 <para>This allows language extensions to be enabled in a portable way.
5539 It is the intention that all Haskell compilers support the
5540 <literal>LANGUAGE</literal> pragma with the same syntax, although not
5541 all extensions are supported by all compilers, of
5542 course. The <literal>LANGUAGE</literal> pragma should be used instead
5543 of <literal>OPTIONS_GHC</literal>, if possible.</para>
5545 <para>For example, to enable the FFI and preprocessing with CPP:</para>
5547 <programlisting>{-# LANGUAGE ForeignFunctionInterface, CPP #-}</programlisting>
5549 <para>Any extension from the <literal>Extension</literal> type defined in
5551 url="../libraries/Cabal/Language-Haskell-Extension.html"><literal>Language.Haskell.Extension</literal></ulink> may be used. GHC will report an error if any of the requested extensions are not supported.</para>
5555 <sect2 id="line-pragma">
5556 <title>LINE pragma</title>
5558 <indexterm><primary>LINE</primary><secondary>pragma</secondary></indexterm>
5559 <indexterm><primary>pragma</primary><secondary>LINE</secondary></indexterm>
5560 <para>This pragma is similar to C's <literal>#line</literal>
5561 pragma, and is mainly for use in automatically generated Haskell
5562 code. It lets you specify the line number and filename of the
5563 original code; for example</para>
5565 <programlisting>{-# LINE 42 "Foo.vhs" #-}</programlisting>
5567 <para>if you'd generated the current file from something called
5568 <filename>Foo.vhs</filename> and this line corresponds to line
5569 42 in the original. GHC will adjust its error messages to refer
5570 to the line/file named in the <literal>LINE</literal>
5574 <sect2 id="options-pragma">
5575 <title>OPTIONS_GHC pragma</title>
5576 <indexterm><primary>OPTIONS_GHC</primary>
5578 <indexterm><primary>pragma</primary><secondary>OPTIONS_GHC</secondary>
5581 <para>The <literal>OPTIONS_GHC</literal> pragma is used to specify
5582 additional options that are given to the compiler when compiling
5583 this source file. See <xref linkend="source-file-options"/> for
5586 <para>Previous versions of GHC accepted <literal>OPTIONS</literal> rather
5587 than <literal>OPTIONS_GHC</literal>, but that is now deprecated.</para>
5591 <title>RULES pragma</title>
5593 <para>The RULES pragma lets you specify rewrite rules. It is
5594 described in <xref linkend="rewrite-rules"/>.</para>
5597 <sect2 id="specialize-pragma">
5598 <title>SPECIALIZE pragma</title>
5600 <indexterm><primary>SPECIALIZE pragma</primary></indexterm>
5601 <indexterm><primary>pragma, SPECIALIZE</primary></indexterm>
5602 <indexterm><primary>overloading, death to</primary></indexterm>
5604 <para>(UK spelling also accepted.) For key overloaded
5605 functions, you can create extra versions (NB: more code space)
5606 specialised to particular types. Thus, if you have an
5607 overloaded function:</para>
5610 hammeredLookup :: Ord key => [(key, value)] -> key -> value
5613 <para>If it is heavily used on lists with
5614 <literal>Widget</literal> keys, you could specialise it as
5618 {-# SPECIALIZE hammeredLookup :: [(Widget, value)] -> Widget -> value #-}
5621 <para>A <literal>SPECIALIZE</literal> pragma for a function can
5622 be put anywhere its type signature could be put.</para>
5624 <para>A <literal>SPECIALIZE</literal> has the effect of generating
5625 (a) a specialised version of the function and (b) a rewrite rule
5626 (see <xref linkend="rewrite-rules"/>) that rewrites a call to the
5627 un-specialised function into a call to the specialised one.</para>
5629 <para>The type in a SPECIALIZE pragma can be any type that is less
5630 polymorphic than the type of the original function. In concrete terms,
5631 if the original function is <literal>f</literal> then the pragma
5633 {-# SPECIALIZE f :: <type> #-}
5635 is valid if and only if the defintion
5637 f_spec :: <type>
5640 is valid. Here are some examples (where we only give the type signature
5641 for the original function, not its code):
5643 f :: Eq a => a -> b -> b
5644 {-# SPECIALISE f :: Int -> b -> b #-}
5646 g :: (Eq a, Ix b) => a -> b -> b
5647 {-# SPECIALISE g :: (Eq a) => a -> Int -> Int #-}
5649 h :: Eq a => a -> a -> a
5650 {-# SPECIALISE h :: (Eq a) => [a] -> [a] -> [a] #-}
5652 The last of these examples will generate a
5653 RULE with a somewhat-complex left-hand side (try it yourself), so it might not fire very
5654 well. If you use this kind of specialisation, let us know how well it works.
5657 <para>A <literal>SPECIALIZE</literal> pragma can optionally be followed with a
5658 <literal>INLINE</literal> or <literal>NOINLINE</literal> pragma, optionally
5659 followed by a phase, as described in <xref linkend="inline-noinline-pragma"/>.
5660 The <literal>INLINE</literal> pragma affects the specialised verison of the
5661 function (only), and applies even if the function is recursive. The motivating
5664 -- A GADT for arrays with type-indexed representation
5666 ArrInt :: !Int -> ByteArray# -> Arr Int
5667 ArrPair :: !Int -> Arr e1 -> Arr e2 -> Arr (e1, e2)
5669 (!:) :: Arr e -> Int -> e
5670 {-# SPECIALISE INLINE (!:) :: Arr Int -> Int -> Int #-}
5671 {-# SPECIALISE INLINE (!:) :: Arr (a, b) -> Int -> (a, b) #-}
5672 (ArrInt _ ba) !: (I# i) = I# (indexIntArray# ba i)
5673 (ArrPair _ a1 a2) !: i = (a1 !: i, a2 !: i)
5675 Here, <literal>(!:)</literal> is a recursive function that indexes arrays
5676 of type <literal>Arr e</literal>. Consider a call to <literal>(!:)</literal>
5677 at type <literal>(Int,Int)</literal>. The second specialisation will fire, and
5678 the specialised function will be inlined. It has two calls to
5679 <literal>(!:)</literal>,
5680 both at type <literal>Int</literal>. Both these calls fire the first
5681 specialisation, whose body is also inlined. The result is a type-based
5682 unrolling of the indexing function.</para>
5683 <para>Warning: you can make GHC diverge by using <literal>SPECIALISE INLINE</literal>
5684 on an ordinarily-recursive function.</para>
5686 <para>Note: In earlier versions of GHC, it was possible to provide your own
5687 specialised function for a given type:
5690 {-# SPECIALIZE hammeredLookup :: [(Int, value)] -> Int -> value = intLookup #-}
5693 This feature has been removed, as it is now subsumed by the
5694 <literal>RULES</literal> pragma (see <xref linkend="rule-spec"/>).</para>
5698 <sect2 id="specialize-instance-pragma">
5699 <title>SPECIALIZE instance pragma
5703 <indexterm><primary>SPECIALIZE pragma</primary></indexterm>
5704 <indexterm><primary>overloading, death to</primary></indexterm>
5705 Same idea, except for instance declarations. For example:
5708 instance (Eq a) => Eq (Foo a) where {
5709 {-# SPECIALIZE instance Eq (Foo [(Int, Bar)]) #-}
5713 The pragma must occur inside the <literal>where</literal> part
5714 of the instance declaration.
5717 Compatible with HBC, by the way, except perhaps in the placement
5723 <sect2 id="unpack-pragma">
5724 <title>UNPACK pragma</title>
5726 <indexterm><primary>UNPACK</primary></indexterm>
5728 <para>The <literal>UNPACK</literal> indicates to the compiler
5729 that it should unpack the contents of a constructor field into
5730 the constructor itself, removing a level of indirection. For
5734 data T = T {-# UNPACK #-} !Float
5735 {-# UNPACK #-} !Float
5738 <para>will create a constructor <literal>T</literal> containing
5739 two unboxed floats. This may not always be an optimisation: if
5740 the <function>T</function> constructor is scrutinised and the
5741 floats passed to a non-strict function for example, they will
5742 have to be reboxed (this is done automatically by the
5745 <para>Unpacking constructor fields should only be used in
5746 conjunction with <option>-O</option>, in order to expose
5747 unfoldings to the compiler so the reboxing can be removed as
5748 often as possible. For example:</para>
5752 f (T f1 f2) = f1 + f2
5755 <para>The compiler will avoid reboxing <function>f1</function>
5756 and <function>f2</function> by inlining <function>+</function>
5757 on floats, but only when <option>-O</option> is on.</para>
5759 <para>Any single-constructor data is eligible for unpacking; for
5763 data T = T {-# UNPACK #-} !(Int,Int)
5766 <para>will store the two <literal>Int</literal>s directly in the
5767 <function>T</function> constructor, by flattening the pair.
5768 Multi-level unpacking is also supported:</para>
5771 data T = T {-# UNPACK #-} !S
5772 data S = S {-# UNPACK #-} !Int {-# UNPACK #-} !Int
5775 <para>will store two unboxed <literal>Int#</literal>s
5776 directly in the <function>T</function> constructor. The
5777 unpacker can see through newtypes, too.</para>
5779 <para>If a field cannot be unpacked, you will not get a warning,
5780 so it might be an idea to check the generated code with
5781 <option>-ddump-simpl</option>.</para>
5783 <para>See also the <option>-funbox-strict-fields</option> flag,
5784 which essentially has the effect of adding
5785 <literal>{-# UNPACK #-}</literal> to every strict
5786 constructor field.</para>
5791 <!-- ======================= REWRITE RULES ======================== -->
5793 <sect1 id="rewrite-rules">
5794 <title>Rewrite rules
5796 <indexterm><primary>RULES pragma</primary></indexterm>
5797 <indexterm><primary>pragma, RULES</primary></indexterm>
5798 <indexterm><primary>rewrite rules</primary></indexterm></title>
5801 The programmer can specify rewrite rules as part of the source program
5802 (in a pragma). GHC applies these rewrite rules wherever it can, provided (a)
5803 the <option>-O</option> flag (<xref linkend="options-optimise"/>) is on,
5804 and (b) the <option>-frules-off</option> flag
5805 (<xref linkend="options-f"/>) is not specified, and (c) the
5806 <option>-fglasgow-exts</option> (<xref linkend="options-language"/>)
5815 "map/map" forall f g xs. map f (map g xs) = map (f.g) xs
5822 <title>Syntax</title>
5825 From a syntactic point of view:
5831 There may be zero or more rules in a <literal>RULES</literal> pragma.
5838 Each rule has a name, enclosed in double quotes. The name itself has
5839 no significance at all. It is only used when reporting how many times the rule fired.
5845 A rule may optionally have a phase-control number (see <xref linkend="phase-control"/>),
5846 immediately after the name of the rule. Thus:
5849 "map/map" [2] forall f g xs. map f (map g xs) = map (f.g) xs
5852 The "[2]" means that the rule is active in Phase 2 and subsequent phases. The inverse
5853 notation "[~2]" is also accepted, meaning that the rule is active up to, but not including,
5862 Layout applies in a <literal>RULES</literal> pragma. Currently no new indentation level
5863 is set, so you must lay out your rules starting in the same column as the
5864 enclosing definitions.
5871 Each variable mentioned in a rule must either be in scope (e.g. <function>map</function>),
5872 or bound by the <literal>forall</literal> (e.g. <function>f</function>, <function>g</function>, <function>xs</function>). The variables bound by
5873 the <literal>forall</literal> are called the <emphasis>pattern</emphasis> variables. They are separated
5874 by spaces, just like in a type <literal>forall</literal>.
5880 A pattern variable may optionally have a type signature.
5881 If the type of the pattern variable is polymorphic, it <emphasis>must</emphasis> have a type signature.
5882 For example, here is the <literal>foldr/build</literal> rule:
5885 "fold/build" forall k z (g::forall b. (a->b->b) -> b -> b) .
5886 foldr k z (build g) = g k z
5889 Since <function>g</function> has a polymorphic type, it must have a type signature.
5896 The left hand side of a rule must consist of a top-level variable applied
5897 to arbitrary expressions. For example, this is <emphasis>not</emphasis> OK:
5900 "wrong1" forall e1 e2. case True of { True -> e1; False -> e2 } = e1
5901 "wrong2" forall f. f True = True
5904 In <literal>"wrong1"</literal>, the LHS is not an application; in <literal>"wrong2"</literal>, the LHS has a pattern variable
5911 A rule does not need to be in the same module as (any of) the
5912 variables it mentions, though of course they need to be in scope.
5918 Rules are automatically exported from a module, just as instance declarations are.
5929 <title>Semantics</title>
5932 From a semantic point of view:
5938 Rules are only applied if you use the <option>-O</option> flag.
5944 Rules are regarded as left-to-right rewrite rules.
5945 When GHC finds an expression that is a substitution instance of the LHS
5946 of a rule, it replaces the expression by the (appropriately-substituted) RHS.
5947 By "a substitution instance" we mean that the LHS can be made equal to the
5948 expression by substituting for the pattern variables.
5955 The LHS and RHS of a rule are typechecked, and must have the
5963 GHC makes absolutely no attempt to verify that the LHS and RHS
5964 of a rule have the same meaning. That is undecidable in general, and
5965 infeasible in most interesting cases. The responsibility is entirely the programmer's!
5972 GHC makes no attempt to make sure that the rules are confluent or
5973 terminating. For example:
5976 "loop" forall x,y. f x y = f y x
5979 This rule will cause the compiler to go into an infinite loop.
5986 If more than one rule matches a call, GHC will choose one arbitrarily to apply.
5992 GHC currently uses a very simple, syntactic, matching algorithm
5993 for matching a rule LHS with an expression. It seeks a substitution
5994 which makes the LHS and expression syntactically equal modulo alpha
5995 conversion. The pattern (rule), but not the expression, is eta-expanded if
5996 necessary. (Eta-expanding the expression can lead to laziness bugs.)
5997 But not beta conversion (that's called higher-order matching).
6001 Matching is carried out on GHC's intermediate language, which includes
6002 type abstractions and applications. So a rule only matches if the
6003 types match too. See <xref linkend="rule-spec"/> below.
6009 GHC keeps trying to apply the rules as it optimises the program.
6010 For example, consider:
6019 The expression <literal>s (t xs)</literal> does not match the rule <literal>"map/map"</literal>, but GHC
6020 will substitute for <varname>s</varname> and <varname>t</varname>, giving an expression which does match.
6021 If <varname>s</varname> or <varname>t</varname> was (a) used more than once, and (b) large or a redex, then it would
6022 not be substituted, and the rule would not fire.
6029 In the earlier phases of compilation, GHC inlines <emphasis>nothing
6030 that appears on the LHS of a rule</emphasis>, because once you have substituted
6031 for something you can't match against it (given the simple minded
6032 matching). So if you write the rule
6035 "map/map" forall f,g. map f . map g = map (f.g)
6038 this <emphasis>won't</emphasis> match the expression <literal>map f (map g xs)</literal>.
6039 It will only match something written with explicit use of ".".
6040 Well, not quite. It <emphasis>will</emphasis> match the expression
6046 where <function>wibble</function> is defined:
6049 wibble f g = map f . map g
6052 because <function>wibble</function> will be inlined (it's small).
6054 Later on in compilation, GHC starts inlining even things on the
6055 LHS of rules, but still leaves the rules enabled. This inlining
6056 policy is controlled by the per-simplification-pass flag <option>-finline-phase</option><emphasis>n</emphasis>.
6063 All rules are implicitly exported from the module, and are therefore
6064 in force in any module that imports the module that defined the rule, directly
6065 or indirectly. (That is, if A imports B, which imports C, then C's rules are
6066 in force when compiling A.) The situation is very similar to that for instance
6078 <title>List fusion</title>
6081 The RULES mechanism is used to implement fusion (deforestation) of common list functions.
6082 If a "good consumer" consumes an intermediate list constructed by a "good producer", the
6083 intermediate list should be eliminated entirely.
6087 The following are good producers:
6099 Enumerations of <literal>Int</literal> and <literal>Char</literal> (e.g. <literal>['a'..'z']</literal>).
6105 Explicit lists (e.g. <literal>[True, False]</literal>)
6111 The cons constructor (e.g <literal>3:4:[]</literal>)
6117 <function>++</function>
6123 <function>map</function>
6129 <function>take</function>, <function>filter</function>
6135 <function>iterate</function>, <function>repeat</function>
6141 <function>zip</function>, <function>zipWith</function>
6150 The following are good consumers:
6162 <function>array</function> (on its second argument)
6168 <function>++</function> (on its first argument)
6174 <function>foldr</function>
6180 <function>map</function>
6186 <function>take</function>, <function>filter</function>
6192 <function>concat</function>
6198 <function>unzip</function>, <function>unzip2</function>, <function>unzip3</function>, <function>unzip4</function>
6204 <function>zip</function>, <function>zipWith</function> (but on one argument only; if both are good producers, <function>zip</function>
6205 will fuse with one but not the other)
6211 <function>partition</function>
6217 <function>head</function>
6223 <function>and</function>, <function>or</function>, <function>any</function>, <function>all</function>
6229 <function>sequence_</function>
6235 <function>msum</function>
6241 <function>sortBy</function>
6250 So, for example, the following should generate no intermediate lists:
6253 array (1,10) [(i,i*i) | i <- map (+ 1) [0..9]]
6259 This list could readily be extended; if there are Prelude functions that you use
6260 a lot which are not included, please tell us.
6264 If you want to write your own good consumers or producers, look at the
6265 Prelude definitions of the above functions to see how to do so.
6270 <sect2 id="rule-spec">
6271 <title>Specialisation
6275 Rewrite rules can be used to get the same effect as a feature
6276 present in earlier versions of GHC.
6277 For example, suppose that:
6280 genericLookup :: Ord a => Table a b -> a -> b
6281 intLookup :: Table Int b -> Int -> b
6284 where <function>intLookup</function> is an implementation of
6285 <function>genericLookup</function> that works very fast for
6286 keys of type <literal>Int</literal>. You might wish
6287 to tell GHC to use <function>intLookup</function> instead of
6288 <function>genericLookup</function> whenever the latter was called with
6289 type <literal>Table Int b -> Int -> b</literal>.
6290 It used to be possible to write
6293 {-# SPECIALIZE genericLookup :: Table Int b -> Int -> b = intLookup #-}
6296 This feature is no longer in GHC, but rewrite rules let you do the same thing:
6299 {-# RULES "genericLookup/Int" genericLookup = intLookup #-}
6302 This slightly odd-looking rule instructs GHC to replace
6303 <function>genericLookup</function> by <function>intLookup</function>
6304 <emphasis>whenever the types match</emphasis>.
6305 What is more, this rule does not need to be in the same
6306 file as <function>genericLookup</function>, unlike the
6307 <literal>SPECIALIZE</literal> pragmas which currently do (so that they
6308 have an original definition available to specialise).
6311 <para>It is <emphasis>Your Responsibility</emphasis> to make sure that
6312 <function>intLookup</function> really behaves as a specialised version
6313 of <function>genericLookup</function>!!!</para>
6315 <para>An example in which using <literal>RULES</literal> for
6316 specialisation will Win Big:
6319 toDouble :: Real a => a -> Double
6320 toDouble = fromRational . toRational
6322 {-# RULES "toDouble/Int" toDouble = i2d #-}
6323 i2d (I# i) = D# (int2Double# i) -- uses Glasgow prim-op directly
6326 The <function>i2d</function> function is virtually one machine
6327 instruction; the default conversion—via an intermediate
6328 <literal>Rational</literal>—is obscenely expensive by
6335 <title>Controlling what's going on</title>
6343 Use <option>-ddump-rules</option> to see what transformation rules GHC is using.
6349 Use <option>-ddump-simpl-stats</option> to see what rules are being fired.
6350 If you add <option>-dppr-debug</option> you get a more detailed listing.
6356 The definition of (say) <function>build</function> in <filename>GHC/Base.lhs</filename> looks llike this:
6359 build :: forall a. (forall b. (a -> b -> b) -> b -> b) -> [a]
6360 {-# INLINE build #-}
6364 Notice the <literal>INLINE</literal>! That prevents <literal>(:)</literal> from being inlined when compiling
6365 <literal>PrelBase</literal>, so that an importing module will “see” the <literal>(:)</literal>, and can
6366 match it on the LHS of a rule. <literal>INLINE</literal> prevents any inlining happening
6367 in the RHS of the <literal>INLINE</literal> thing. I regret the delicacy of this.
6374 In <filename>libraries/base/GHC/Base.lhs</filename> look at the rules for <function>map</function> to
6375 see how to write rules that will do fusion and yet give an efficient
6376 program even if fusion doesn't happen. More rules in <filename>GHC/List.lhs</filename>.
6386 <sect2 id="core-pragma">
6387 <title>CORE pragma</title>
6389 <indexterm><primary>CORE pragma</primary></indexterm>
6390 <indexterm><primary>pragma, CORE</primary></indexterm>
6391 <indexterm><primary>core, annotation</primary></indexterm>
6394 The external core format supports <quote>Note</quote> annotations;
6395 the <literal>CORE</literal> pragma gives a way to specify what these
6396 should be in your Haskell source code. Syntactically, core
6397 annotations are attached to expressions and take a Haskell string
6398 literal as an argument. The following function definition shows an
6402 f x = ({-# CORE "foo" #-} show) ({-# CORE "bar" #-} x)
6405 Semantically, this is equivalent to:
6413 However, when external for is generated (via
6414 <option>-fext-core</option>), there will be Notes attached to the
6415 expressions <function>show</function> and <varname>x</varname>.
6416 The core function declaration for <function>f</function> is:
6420 f :: %forall a . GHCziShow.ZCTShow a ->
6421 a -> GHCziBase.ZMZN GHCziBase.Char =
6422 \ @ a (zddShow::GHCziShow.ZCTShow a) (eta::a) ->
6424 %case zddShow %of (tpl::GHCziShow.ZCTShow a)
6426 (tpl1::GHCziBase.Int ->
6428 GHCziBase.ZMZN GHCziBase.Char -> GHCziBase.ZMZN GHCziBase.Cha
6430 (tpl2::a -> GHCziBase.ZMZN GHCziBase.Char)
6431 (tpl3::GHCziBase.ZMZN a ->
6432 GHCziBase.ZMZN GHCziBase.Char -> GHCziBase.ZMZN GHCziBase.Cha
6440 Here, we can see that the function <function>show</function> (which
6441 has been expanded out to a case expression over the Show dictionary)
6442 has a <literal>%note</literal> attached to it, as does the
6443 expression <varname>eta</varname> (which used to be called
6444 <varname>x</varname>).
6451 <sect1 id="special-ids">
6452 <title>Special built-in functions</title>
6453 <para>GHC has a few built-in funcions with special behaviour. These
6454 are now described in the module <ulink
6455 url="../libraries/base/GHC-Prim.html"><literal>GHC.Prim</literal></ulink>
6456 in the library documentation.</para>
6460 <sect1 id="generic-classes">
6461 <title>Generic classes</title>
6464 The ideas behind this extension are described in detail in "Derivable type classes",
6465 Ralf Hinze and Simon Peyton Jones, Haskell Workshop, Montreal Sept 2000, pp94-105.
6466 An example will give the idea:
6474 fromBin :: [Int] -> (a, [Int])
6476 toBin {| Unit |} Unit = []
6477 toBin {| a :+: b |} (Inl x) = 0 : toBin x
6478 toBin {| a :+: b |} (Inr y) = 1 : toBin y
6479 toBin {| a :*: b |} (x :*: y) = toBin x ++ toBin y
6481 fromBin {| Unit |} bs = (Unit, bs)
6482 fromBin {| a :+: b |} (0:bs) = (Inl x, bs') where (x,bs') = fromBin bs
6483 fromBin {| a :+: b |} (1:bs) = (Inr y, bs') where (y,bs') = fromBin bs
6484 fromBin {| a :*: b |} bs = (x :*: y, bs'') where (x,bs' ) = fromBin bs
6485 (y,bs'') = fromBin bs'
6488 This class declaration explains how <literal>toBin</literal> and <literal>fromBin</literal>
6489 work for arbitrary data types. They do so by giving cases for unit, product, and sum,
6490 which are defined thus in the library module <literal>Generics</literal>:
6494 data a :+: b = Inl a | Inr b
6495 data a :*: b = a :*: b
6498 Now you can make a data type into an instance of Bin like this:
6500 instance (Bin a, Bin b) => Bin (a,b)
6501 instance Bin a => Bin [a]
6503 That is, just leave off the "where" clause. Of course, you can put in the
6504 where clause and over-ride whichever methods you please.
6508 <title> Using generics </title>
6509 <para>To use generics you need to</para>
6512 <para>Use the flags <option>-fglasgow-exts</option> (to enable the extra syntax),
6513 <option>-XGenerics</option> (to generate extra per-data-type code),
6514 and <option>-package lang</option> (to make the <literal>Generics</literal> library
6518 <para>Import the module <literal>Generics</literal> from the
6519 <literal>lang</literal> package. This import brings into
6520 scope the data types <literal>Unit</literal>,
6521 <literal>:*:</literal>, and <literal>:+:</literal>. (You
6522 don't need this import if you don't mention these types
6523 explicitly; for example, if you are simply giving instance
6524 declarations.)</para>
6529 <sect2> <title> Changes wrt the paper </title>
6531 Note that the type constructors <literal>:+:</literal> and <literal>:*:</literal>
6532 can be written infix (indeed, you can now use
6533 any operator starting in a colon as an infix type constructor). Also note that
6534 the type constructors are not exactly as in the paper (Unit instead of 1, etc).
6535 Finally, note that the syntax of the type patterns in the class declaration
6536 uses "<literal>{|</literal>" and "<literal>|}</literal>" brackets; curly braces
6537 alone would ambiguous when they appear on right hand sides (an extension we
6538 anticipate wanting).
6542 <sect2> <title>Terminology and restrictions</title>
6544 Terminology. A "generic default method" in a class declaration
6545 is one that is defined using type patterns as above.
6546 A "polymorphic default method" is a default method defined as in Haskell 98.
6547 A "generic class declaration" is a class declaration with at least one
6548 generic default method.
6556 Alas, we do not yet implement the stuff about constructor names and
6563 A generic class can have only one parameter; you can't have a generic
6564 multi-parameter class.
6570 A default method must be defined entirely using type patterns, or entirely
6571 without. So this is illegal:
6574 op :: a -> (a, Bool)
6575 op {| Unit |} Unit = (Unit, True)
6578 However it is perfectly OK for some methods of a generic class to have
6579 generic default methods and others to have polymorphic default methods.
6585 The type variable(s) in the type pattern for a generic method declaration
6586 scope over the right hand side. So this is legal (note the use of the type variable ``p'' in a type signature on the right hand side:
6590 op {| p :*: q |} (x :*: y) = op (x :: p)
6598 The type patterns in a generic default method must take one of the forms:
6604 where "a" and "b" are type variables. Furthermore, all the type patterns for
6605 a single type constructor (<literal>:*:</literal>, say) must be identical; they
6606 must use the same type variables. So this is illegal:
6610 op {| a :+: b |} (Inl x) = True
6611 op {| p :+: q |} (Inr y) = False
6613 The type patterns must be identical, even in equations for different methods of the class.
6614 So this too is illegal:
6618 op1 {| a :*: b |} (x :*: y) = True
6621 op2 {| p :*: q |} (x :*: y) = False
6623 (The reason for this restriction is that we gather all the equations for a particular type consructor
6624 into a single generic instance declaration.)
6630 A generic method declaration must give a case for each of the three type constructors.
6636 The type for a generic method can be built only from:
6638 <listitem> <para> Function arrows </para> </listitem>
6639 <listitem> <para> Type variables </para> </listitem>
6640 <listitem> <para> Tuples </para> </listitem>
6641 <listitem> <para> Arbitrary types not involving type variables </para> </listitem>
6643 Here are some example type signatures for generic methods:
6646 op2 :: Bool -> (a,Bool)
6647 op3 :: [Int] -> a -> a
6650 Here, op1, op2, op3 are OK, but op4 is rejected, because it has a type variable
6654 This restriction is an implementation restriction: we just havn't got around to
6655 implementing the necessary bidirectional maps over arbitrary type constructors.
6656 It would be relatively easy to add specific type constructors, such as Maybe and list,
6657 to the ones that are allowed.</para>
6662 In an instance declaration for a generic class, the idea is that the compiler
6663 will fill in the methods for you, based on the generic templates. However it can only
6668 The instance type is simple (a type constructor applied to type variables, as in Haskell 98).
6673 No constructor of the instance type has unboxed fields.
6677 (Of course, these things can only arise if you are already using GHC extensions.)
6678 However, you can still give an instance declarations for types which break these rules,
6679 provided you give explicit code to override any generic default methods.
6687 The option <option>-ddump-deriv</option> dumps incomprehensible stuff giving details of
6688 what the compiler does with generic declarations.
6693 <sect2> <title> Another example </title>
6695 Just to finish with, here's another example I rather like:
6699 nCons {| Unit |} _ = 1
6700 nCons {| a :*: b |} _ = 1
6701 nCons {| a :+: b |} _ = nCons (bot::a) + nCons (bot::b)
6704 tag {| Unit |} _ = 1
6705 tag {| a :*: b |} _ = 1
6706 tag {| a :+: b |} (Inl x) = tag x
6707 tag {| a :+: b |} (Inr y) = nCons (bot::a) + tag y
6713 <sect1 id="monomorphism">
6714 <title>Control over monomorphism</title>
6716 <para>GHC supports two flags that control the way in which generalisation is
6717 carried out at let and where bindings.
6721 <title>Switching off the dreaded Monomorphism Restriction</title>
6722 <indexterm><primary><option>-XNoMonomorphismRestriction</option></primary></indexterm>
6724 <para>Haskell's monomorphism restriction (see
6725 <ulink url="http://haskell.org/onlinereport/decls.html#sect4.5.5">Section
6727 of the Haskell Report)
6728 can be completely switched off by
6729 <option>-XNoMonomorphismRestriction</option>.
6734 <title>Monomorphic pattern bindings</title>
6735 <indexterm><primary><option>-XNoMonoPatBinds</option></primary></indexterm>
6736 <indexterm><primary><option>-XMonoPatBinds</option></primary></indexterm>
6738 <para> As an experimental change, we are exploring the possibility of
6739 making pattern bindings monomorphic; that is, not generalised at all.
6740 A pattern binding is a binding whose LHS has no function arguments,
6741 and is not a simple variable. For example:
6743 f x = x -- Not a pattern binding
6744 f = \x -> x -- Not a pattern binding
6745 f :: Int -> Int = \x -> x -- Not a pattern binding
6747 (g,h) = e -- A pattern binding
6748 (f) = e -- A pattern binding
6749 [x] = e -- A pattern binding
6751 Experimentally, GHC now makes pattern bindings monomorphic <emphasis>by
6752 default</emphasis>. Use <option>-XMonoPatBinds</option> to recover the
6761 ;;; Local Variables: ***
6763 ;;; sgml-parent-document: ("users_guide.xml" "book" "chapter" "sect1") ***
projects / ghc-hetmet.git / blob