# Keywords

### From HaskellWiki

NeilMitchell (Talk | contribs) (→--) |
m (→-<<) |
||

(18 intermediate revisions by 8 users not shown) | |||

Line 1: | Line 1: | ||

This page lists all Haskell keywords, feel free to edit. [[Hoogle]] searches will return results from this page. Please respect the Anchor macros. | This page lists all Haskell keywords, feel free to edit. [[Hoogle]] searches will return results from this page. Please respect the Anchor macros. | ||

− | For additional information you might want to look at [http://www.haskell.org/onlinereport/ the Haskell | + | For additional information you might want to look at [http://www.haskell.org/onlinereport/haskell2010/ the Haskell 2010 report]. |

== ! == | == ! == | ||

Line 37: | Line 37: | ||

* Character literal: <hask>'a'</hask> | * Character literal: <hask>'a'</hask> | ||

* [[Template Haskell]]: Name of a (value) variable or data constructor: <hask>'length</hask>, <hask>'Left</hask> | * [[Template Haskell]]: Name of a (value) variable or data constructor: <hask>'length</hask>, <hask>'Left</hask> | ||

+ | * (in types, GHC specific) Promoted data constructor: <hask>'True</hask> | ||

== <nowiki>''</nowiki> == | == <nowiki>''</nowiki> == | ||

Line 44: | Line 45: | ||

This operator token is magic/irregular in the sense that | This operator token is magic/irregular in the sense that | ||

<haskell>(- 1)</haskell> | <haskell>(- 1)</haskell> | ||

− | is parsed as the negative integer -1, rather than as an operator [[section]], as it would be for any other operator: | + | is parsed as the negative integer -1, rather than as an operator [[Section of an infix operator|section]], as it would be for any other operator: |

<haskell>(* 1) :: Num a => a -> a</haskell> | <haskell>(* 1) :: Num a => a -> a</haskell> | ||

<haskell>(++ "foo") :: String -> String</haskell> | <haskell>(++ "foo") :: String -> String</haskell> | ||

Line 65: | Line 66: | ||

== -< == | == -< == | ||

− | [ | + | [http://downloads.haskell.org/~ghc/latest/docs/html/users_guide/glasgow_exts.html#arrow-notation Arrow notation] |

== -<< == | == -<< == | ||

− | [ | + | [http://downloads.haskell.org/~ghc/latest/docs/html/users_guide/glasgow_exts.html#arrow-notation Arrow notation] |

− | + | ||

== -> == | == -> == | ||

Line 93: | Line 93: | ||

<haskell> | <haskell> | ||

ghci> :kind (->) | ghci> :kind (->) | ||

− | (->) :: | + | (->) :: * -> * -> * |

</haskell> | </haskell> | ||

Line 133: | Line 133: | ||

</haskell> | </haskell> | ||

− | * In list comprehension generators, " | + | * In list comprehension generators, "in": |

<haskell> | <haskell> | ||

[ (x,y) | x <- [1..10], y <- ['a'..'z'] ] | [ (x,y) | x <- [1..10], y <- ['a'..'z'] ] | ||

Line 142: | Line 142: | ||

f x y | Just z <- g x = True | f x y | Just z <- g x = True | ||

| otherwise = False | | otherwise = False | ||

+ | </haskell> | ||

+ | |||

+ | == , == | ||

+ | |||

+ | In list comprehensions, "and": | ||

+ | <haskell> | ||

+ | [ (x,y) | x <- [1..10], y <- ['a'..'z'], x > 42 ] | ||

</haskell> | </haskell> | ||

Line 171: | Line 178: | ||

== ? == | == ? == | ||

− | * [ | + | * [https://downloads.haskell.org/~ghc/latest/docs/html/users_guide/glasgow_exts.html#implicit-parameters Implicit parameters] |

<haskell> | <haskell> | ||

ghci> :t ?foo ++ "bar" | ghci> :t ?foo ++ "bar" | ||

?foo ++ "bar" :: (?foo::[Char]) => [Char] | ?foo ++ "bar" :: (?foo::[Char]) => [Char] | ||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

</haskell> | </haskell> | ||

== # == | == # == | ||

− | * [ | + | * [https://downloads.haskell.org/~ghc/7.6.2/docs/html/users_guide/syntax-extns.html MagicHash] |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

== * == | == * == | ||

Line 327: | Line 297: | ||

</haskell> | </haskell> | ||

− | * List comprehensions, " | + | * List comprehensions, "for" (as in, "list of <code>a*a</code> for <code>a</code> in <code>[1..]</code>) |

<haskell> | <haskell> | ||

squares = [a*a | a <- [1..]] | squares = [a*a | a <- [1..]] | ||

Line 347: | Line 317: | ||

* Lazy pattern bindings. Matching the pattern ~pat against a value always | * Lazy pattern bindings. Matching the pattern ~pat against a value always | ||

− | + | succeeds, and matching will only diverge when one of the variables bound | |

in the pattern is used. | in the pattern is used. | ||

Line 556: | Line 526: | ||

== forall == | == forall == | ||

− | This is a GHC/Hugs extension, and as such is not portable Haskell 98. | + | This is a GHC/Hugs extension, and as such is not portable Haskell 98/2010. |

It is only a reserved word within types. | It is only a reserved word within types. | ||

Type variables in a Haskell type expression are all assumed to be | Type variables in a Haskell type expression are all assumed to be | ||

universally quantified; there is no explicit syntax for universal | universally quantified; there is no explicit syntax for universal | ||

− | quantification, in standard Haskell 98. For example, the type expression | + | quantification, in standard Haskell 98/2010. For example, the type expression |

<hask>a -> a</hask> denotes the type <hask>forall a. a ->a</hask>. | <hask>a -> a</hask> denotes the type <hask>forall a. a ->a</hask>. | ||

For clarity, however, we often write quantification explicitly when | For clarity, however, we often write quantification explicitly when | ||

Line 680: | Line 650: | ||

They introduce a nested, lexically-scoped, mutually-recursive list of declarations (let is often called letrec in other languages). The scope of the declarations is the expression e and the right hand side of the declarations. | They introduce a nested, lexically-scoped, mutually-recursive list of declarations (let is often called letrec in other languages). The scope of the declarations is the expression e and the right hand side of the declarations. | ||

− | Within <hask>do</hask>-blocks or list comprehensions <hask>let { d1 ; ... ; dn }</hask> without <hask>in</hask> serves to | + | Within <hask>do</hask>-blocks or list comprehensions <hask>let { d1 ; ... ; dn }</hask> without <hask>in</hask> serves to introduce local bindings. |

− | == [http:// | + | == [http://downloads.haskell.org/~ghc/latest/docs/html/users_guide/glasgow_exts.html#the-mdo-notation mdo] == |

− | The recursive <hask>do</hask> keyword enabled by -fglasgow-exts | + | The recursive <hask>do</hask> keyword enabled by -fglasgow-exts. |

== module == | == module == | ||

Line 710: | Line 680: | ||

newtype FunctionIdentifier = FunctionIdentifier Identifier | newtype FunctionIdentifier = FunctionIdentifier Identifier | ||

− | Most often, one supplies [[smart constructors]] and [[ | + | Most often, one supplies [[smart constructors]] and [[smart destructors|destructors]] for these to ease working with them. |

See the page on [[type]]s for more information, links and examples. | See the page on [[type]]s for more information, links and examples. |

## Latest revision as of 00:39, 28 May 2017

This page lists all Haskell keywords, feel free to edit. Hoogle searches will return results from this page. Please respect the Anchor macros.

For additional information you might want to look at the Haskell 2010 report.

## [edit] 1 !

Whenever a data constructor is applied, each argument to the constructor is evaluated if and only if the corresponding type in the algebraic datatype declaration has a strictness flag, denoted by an exclamation point. For example:

data STList a = STCons a !(STList a) -- the second argument to STCons will be -- evaluated before STCons is applied | STNil

to illustrate the difference between strict versus lazy constructor application, consider the following:

stList = STCons 1 undefined lzList = (:) 1 undefined stHead (STCons h _) = h -- this evaluates to undefined when applied to stList lzHead (h : _) = h -- this evaluates to 1 when applied to lzList

! is also used in the "bang patterns" (GHC extension), to indicate strictness in patterns:

f !x !y = x + y

## [edit] 2 '

- Character literal: 'a'
- Template Haskell: Name of a (value) variable or data constructor: ,'length'Left
- (in types, GHC specific) Promoted data constructor: 'True

## [edit] 3 ''

- Template Haskell: Name of a type constructor or class: ,''Int,''Either''Show

## [edit] 4 -

This operator token is magic/irregular in the sense that

(- 1)

is parsed as the negative integer -1, rather than as an operator section, as it would be for any other operator:

(* 1) :: Num a => a -> a

(++ "foo") :: String -> String

## [edit] 5 --

Starts a single-line comment, unless immediately followed by an operator character other thanmain = print "hello world" -- this is a comment --this is a comment as well ---this too foobar --+ this_is_the_second_argument_of_the_dash_dash_plus_operator

## [edit] 6 -<

## [edit] 7 -<<

## [edit] 8 ->

- The function type constructor:

length :: [a] -> Int

- In lambda functions:

\x -> x + 1

- To denote alternatives in case statements:

case Just 3 of Nothing -> False Just x -> True

- On the kind level (GHC specific):

ghci> :kind (->) (->) :: * -> * -> *

-- This examples assumes that each type 'c' can "contain" only one type -- i.e. type 'c' uniquely determines type 'elt' class Contains c elt | c -> elt where ...

## [edit] 9 ::

Read as "has type":

length :: [a] -> Int

"Length has type list-of-'a' to Int"

Or "has kind" (GHC specific):

Either :: * -> * -> *

## [edit] 10 ;

- Statement separator in an explicit block (see layout)

## [edit] 11 <-

- In do-notation, "draw from":

do x <- getChar putChar x

- In list comprehension generators, "in":

[ (x,y) | x <- [1..10], y <- ['a'..'z'] ]

- In pattern guards, "matches":

f x y | Just z <- g x = True | otherwise = False

## [edit] 12 ,

In list comprehensions, "and":

[ (x,y) | x <- [1..10], y <- ['a'..'z'], x > 42 ]

## [edit] 13 =

Used in definitions.

x = 4

## [edit] 14 =>

Used to indicate instance contexts, for example:

sort :: Ord a => [a] -> [a]

## [edit] 15 >

In a Bird's style Literate Haskell file, the > character is used to introduce a code line.

comment line > main = print "hello world"

## [edit] 16 ?

ghci> :t ?foo ++ "bar" ?foo ++ "bar" :: (?foo::[Char]) => [Char]

## [edit] 17 #

## [edit] 18 *

- Is an ordinary operator name on the value level

- On the kind level: The kind of boxed types (GHC-specific)

ghci> :kind Int Int :: *

## [edit] 19 @

Patterns of the form var@pat are called as-patterns, and allow one to use var as a name for the value being matched by pat. For example:

case e of { xs@(x:rest) -> if x==0 then rest else xs }

is equivalent to:

let { xs = e } in case xs of { (x:rest) -> if x==0 then rest else xs }

## [edit] 20 [|, |]

- Template Haskell
- Expression quotation: [| print 1 |]
- Declaration quotation: [d| main = print 1 |]
- Type quotation: [t| Either Int () |]
- Pattern quotation: [p| (x,y) |]
- Quasiquotation: [nameOfQuasiQuoter| ... |]

- Expression quotation:

## [edit] 21 \

The backslash "\" is used

- in multiline strings

```
"foo\
\bar"
```

- in lambda functions

\x -> x + 1

## [edit] 22 _

Patterns of the form _ are wildcards and are useful when some part of a pattern is not referenced on the right-hand-side. It is as if an identifier not used elsewhere were put in its place. For example,

case e of { [x,_,_] -> if x==0 then True else False }

is equivalent to:

case e of { [x,y,z] -> if x==0 then True else False }

## [edit] 23 `

A function enclosed in back ticks "`" can be used as an infix operator.

2 `subtract` 10

is the same as

subtract 2 10

## [edit] 24 {, }

- Explicit block (disable layout), possibly with ";" .

- Record update notation

changePrice :: Thing -> Price -> Thing changePrice x new = x { price = new }

- Comments (see below)

## [edit] 25 {-, -}

Everything between "{-" followed by a space and "-}" is a block comment.

```
{-
hello
world
-}
```

## [edit] 26 |

The "pipe" is used in several places

- Data type definitions, "or"

data Maybe a = Just a | Nothing

- List comprehensions, "for" (as in, "list of
`a*a`

for`a`

in`[1..]`

)

squares = [a*a | a <- [1..]]

- Guards, "when"

safeTail x | null x = [] | otherwise = tail x

- Functional dependencies, "where"

class Contains c elt | c -> elt where ...

## [edit] 27 ~

- Lazy pattern bindings. Matching the pattern ~pat against a value always

succeeds, and matching will only diverge when one of the variables bound in the pattern is used.

f1, f2 :: Maybe Int -> String f1 x = case x of Just n -> "Got it" f2 x = case x of ~(Just n) -> "Got it" (+++), (++++) :: (a -> b) -> (c -> d) -> (a, c) -> (b, d) (f +++ g) ~(x, y) = (f x, g y) (f ++++ g) (x, y) = (f x, g y)

Then we have:

f1 Nothing Exception: Non-exhaustive patterns in case f2 Nothing "Got it" (const 1 +++ const 2) undefined (1,2) (const 1 ++++ const 2) undefined Exception: Prelude.undefined

For more details see the Haskell Wikibook.

- Equality constraints. Assert that two types in a context must be the same:

example :: F a ~ b => a -> b

Here the type "F a" must be the same as the type "b", which allows one to constrain polymorphism (especially where type families are involved), but to a lesser extent than functional dependencies. See Type Families.

## [edit] 28 as

Renaming module imports. Likeimport qualified Data.Map as M main = print (M.empty :: M.Map Int ())

## [edit] 29 case, of

A case expression has the general form

case e of { p1 match1 ; ... ; pn matchn }

where each `match`

_{i} is of the general form

| g1 -> e1 ... | gm -> em where decls

Each alternative consists of patterns `p`

_{i} and their matches, `match`

_{i}. Each
`match`

_{i} in turn consists of a sequence of pairs of guards `g`

_{ij} and bodies `e`

_{ij}
(expressions), followed by optional bindings (`decls`

_{i}) that scope over all
of the guards and expressions of the alternative. An alternative of the
form

pat -> exp where decls

is treated as shorthand for:

pat | True -> exp where decls

A case expression must have at least one alternative and each alternative must have at least one body. Each body must have the same type, and the type of the whole expression is that type.

A case expression is evaluated by pattern matching the expression `e`

against the individual alternatives. The alternatives are tried
sequentially, from top to bottom. If `e`

matches the pattern in the
alternative, the guards for that alternative are tried sequentially from
top to bottom, in the environment of the case expression extended first
by the bindings created during the matching of the pattern, and then by
the `decls`

_{i} in the `where`

clause associated with that alternative. If one
of the guards evaluates to `True`

, the corresponding right-hand side is
evaluated in the same environment as the guard. If all the guards
evaluate to `False`

, matching continues with the next alternative. If no
match succeeds, the result is _|_.

## [edit] 30 class

A class declaration introduces a new type class and the overloaded operations that must be supported by any type that is an instance of that class.

class Num a where (+) :: a -> a -> a negate :: a -> a

## [edit] 31 data

The data declaration is how one introduces new algebraic data types into Haskell. For example:

data Set a = NilSet | ConsSet a (Set a)

Another example, to create a datatype to hold an abstract syntax tree for an expression, one could use:

data Exp = Ebin Operator Exp Exp | Eunary Operator Exp | Efun FunctionIdentifier [Exp] | Eid SimpleIdentifier

where the types `Operator, FunctionIdentifier`

and `SimpleIdentifier`

are defined elsewhere.

See the page on types for more information, links and examples.

## [edit] 32 data family

Declares a datatype family (see type families). GHC language extension.

## [edit] 33 data instance

Declares a datatype family instance (see type families). GHC language extension.

## [edit] 34 default

Ambiguities in the class Num are most common, so Haskell provides a way to resolve them---with a default declaration:

default (Int)

Only one default declaration is permitted per module, and its effect is limited to that module. If no default declaration is given in a module then it assumed to be:

default (Integer, Double)

## [edit] 35 deriving

data and newtype declarations contain an optional deriving form. If the form is included, then derived instance declarations are automatically generated for the datatype in each of the named classes.

Derived instances provide convenient commonly-used operations for user-defined datatypes. For example, derived instances for datatypes in the class Eq define the operations == and /=, freeing the programmer from the need to define them.

data T = A | B | C deriving (Eq, Ord, Show)

In the case of newtypes, GHC extends this mechanism to Cunning Newtype Deriving.

## [edit] 36 deriving instance

Standalone deriving (GHC language extension).

{-# LANGUAGE StandaloneDeriving #-} data A = A deriving instance Show A

## [edit] 37 do

Syntactic sugar for use with monadic expressions. For example:

do { x ; result <- y ; foo result }

is shorthand for:

x >> y >>= \result -> foo result

## [edit] 38 forall

This is a GHC/Hugs extension, and as such is not portable Haskell 98/2010. It is only a reserved word within types.

Type variables in a Haskell type expression are all assumed to be universally quantified; there is no explicit syntax for universal quantification, in standard Haskell 98/2010. For example, the type expression

For clarity, however, we often write quantification explicitly when discussing the types of Haskell programs. When we write an explicitly quantified type, the scope of the forall extends as far to the right as possible; for example,

forall a. a -> a

means

forall a. (a -> a)

data Foo = forall a. MkFoo a (a -> Bool) | Nil MkFoo :: forall a. a -> (a -> Bool) -> Foo Nil :: Foo [MkFoo 3 even, MkFoo 'c' isUpper] :: [Foo]

## [edit] 39 foreign

A keyword for the Foreign Function Interface (commonly called the FFI) that introduces either a## [edit] 40 hiding

When importing modules, without introducing a name into scope, entities can be excluded by using the form

hiding (import1 , ... , importn )

which specifies that all entities exported by the named module should be imported except for those named in the list.

For example:

import Prelude hiding (lookup,filter,foldr,foldl,null,map)

## [edit] 41 if, then, else

A conditional expression has the form:

if e1 then e2 else e3

and returns the value of e2 if the value of e1 is True, e3 if e1 is False, and _|_ otherwise.

max a b = if a > b then a else b

## [edit] 42 import

Modules may reference other modules via explicit import declarations, each giving the name of a module to be imported and specifying its entities to be imported.

For example:

module Main where import A import B main = A.f >> B.f module A where f = ... module B where f = ...

See also as, hiding , qualified and the page Import

## [edit] 43 infix, infixl, infixr

A fixity declaration gives the fixity and binding precedence of one or more operators. The integer in a fixity declaration must be in the range 0 to 9. A fixity declaration may appear anywhere that a type signature appears and, like a type signature, declares a property of a particular operator.

There are three kinds of fixity, non-, left- and right-associativity (infix, infixl, and infixr, respectively), and ten precedence levels, 0 to 9 inclusive (level 0 binds least tightly, and level 9 binds most tightly).

module Bar where infixr 7 `op` op = ...

## [edit] 44 instance

An instance declaration declares that a type is an instance of a class and includes the definitions of the overloaded operations - called class methods - instantiated on the named type.

instance Num Int where x + y = addInt x y negate x = negateInt x

## [edit] 45 let, in

Let expressions have the general form:

let { d1 ; ... ; dn } in e

They introduce a nested, lexically-scoped, mutually-recursive list of declarations (let is often called letrec in other languages). The scope of the declarations is the expression e and the right hand side of the declarations.

Within## [edit] 46 mdo

The recursive## [edit] 47 module

Taken from: A Gentle Introduction to Haskell, Version 98

Technically speaking, a module is really just one big declaration which begins with the keyword module; here's an example for a module whose name is Tree:

module Tree ( Tree(Leaf,Branch), fringe ) where data Tree a = Leaf a | Branch (Tree a) (Tree a) fringe :: Tree a -> [a] fringe (Leaf x) = [x] fringe (Branch left right) = fringe left ++ fringe right

## [edit] 48 newtype

The `newtype`

declaration is how one introduces a renaming for an algebraic data type into Haskell. This is different from `type`

below, as a `newtype`

requires a new constructor as well. As an example, when writing a compiler
one sometimes further qualifies `Identifier`

s to assist in type safety checks:

newtype SimpleIdentifier = SimpleIdentifier Identifier newtype FunctionIdentifier = FunctionIdentifier Identifier

Most often, one supplies smart constructors and destructors for these to ease working with them.

See the page on types for more information, links and examples.

For the differences between `newtype`

and `data`

, see Newtype.

## [edit] 49 proc

proc (arrow abstraction) is a kind of lambda, except that it constructs an arrow instead of a function.

## [edit] 50 qualified

Used to import a module, but not introduce a name into scope. For example, Data.Map exports lookup, which would clash with the Prelude version of lookup, to fix this:

import qualified Data.Map f x = lookup x -- use the Prelude version g x = Data.Map.lookup x -- use the Data.Map version

Of course, Data.Map is a bit of a mouthful, so qualified also allows the use of as.

import qualified Data.Map as M f x = lookup x -- use Prelude version g x = M.lookup x -- use Data.Map version

## [edit] 51 rec

The rec keyword can be used when the `-XDoRec`

flag is given; it allows recursive bindings in a do-block.

{-# LANGUAGE DoRec #-} justOnes = do { rec { xs <- Just (1:xs) } ; return (map negate xs) }

## [edit] 52 type

The `type`

declaration is how one introduces an alias for an algebraic data type into Haskell. As an example, when writing a compiler
one often creates an alias for identifiers:

type Identifier = String

This allows you to use `Identifer`

wherever you had used `String`

and if something is of type `Identifier`

it
may be used wherever a `String`

is expected.

See the page on types for more information, links and examples.

Some common `type`

declarations in the Prelude include:

type FilePath = String type String = [Char] type Rational = Ratio Integer type ReadS a = String -> [(a,String)] type ShowS = String -> String

## [edit] 53 type family

Declares a type synonym family (see type families). GHC language extension.

## [edit] 54 type instance

Declares a type synonym family instance (see type families). GHC language extension.

## [edit] 55 where

Used to introduce a module, instance, class or GADT:

module Main where class Num a where ... instance Num Int where ... data Something a where ...

And to bind local variables:

f x = y where y = x * 2 g z | z > 2 = y where y = x * 2