# Learn Haskell in 10 minutes

### From HaskellWiki

Line 131: | Line 131: | ||

Putting it all together, |
Putting it all together, |
||

− | Prelude> <hask>gcd 42 35 :: Int</hask> |
+ | Prelude> <hask>gcd 42 35 :: Int</hask> |

− | 7 |
+ | 7 |

− | Prelude> <hask>gcd 42 35 :: Double</hask> |
+ | Prelude> <hask>gcd 42 35 :: Double</hask> |

− | + | ||

− | <interactive>:1:0: |
+ | <interactive>:1:0: |

− | No instance for (Integral Double) |
+ | No instance for (Integral Double) |

The final type worth mentioning here is <hask>()</hask>, pronounced "unit." It only has one value, also written as <hask>()</hask> and pronounced "unit." You can think of this as similar to the void keyword in C family languages. You can return <hask>()</hask> from a function or I/O action if you don't want to return anything. |
The final type worth mentioning here is <hask>()</hask>, pronounced "unit." It only has one value, also written as <hask>()</hask> and pronounced "unit." You can think of this as similar to the void keyword in C family languages. You can return <hask>()</hask> from a function or I/O action if you don't want to return anything. |
||

== Structured Data == |
== Structured Data == |
||

− | === Lists === |
+ | |

− | === Common List Handling (map, filter, fold) === |
+ | Basic data types can be easily combined in two ways: lists, which go in [square brackets], and tuples, which go in (parentheses). |

− | === Tuples === |
+ | |

− | === Basic Tuple Functions (fst, snd) === |
+ | Lists are used to hold multiple values of the same type. |

+ | |||

+ | Prelude> <hask>[1, 2, 3]</hask> |
||

+ | [1,2,3] |
||

+ | Prelude> <hask>[1 .. 5]</hask> |
||

+ | [1,2,3,4,5] |
||

+ | Prelude> <hask>[1, 3 .. 10]</hask> |
||

+ | [1,3,5,7,9] |
||

+ | Prelude> <hask>[True, False, True]</hask> |
||

+ | [True,False,True] |
||

+ | |||

+ | Strings are just lists of characters. |
||

+ | |||

+ | Prelude> <hask>['H', 'e', 'l', 'l', 'o']</hask> |
||

+ | "Hello" |
||

+ | |||

+ | The <hask>:</hask> operator appends an item to the beginning of a list. (It is Haskell's version of LISP's cons). |
||

+ | |||

+ | Prelude> <hask>'C' : ['H', 'e', 'l', 'l', 'o']</hask> |
||

+ | "CHello" |
||

+ | |||

+ | Tuples hold a fixed number of values, which can have different types. |
||

+ | |||

+ | Prelude> <hask>(1, True)</hask> |
||

+ | (1,True) |
||

+ | Prelude> <hask>zip [1 .. 5] ['a' .. 'e']</hask> |
||

+ | [(1,'a'),(2,'b'),(3,'c'),(4,'d'),(5,'e')] |
||

+ | |||

+ | The last example used <hask>zip</hask>, a library function that turns two lists into a list of tuples. |
||

+ | |||

+ | The types are probably what you'd expect. |
||

+ | |||

+ | Prelude> :t <hask>['a' .. 'c']</hask> |
||

+ | <hask>['a' .. 'c'] :: [Char]</hask> |
||

+ | Prelude> :t <hask>[('x', True), ('y', False)]</hask> |
||

+ | <hask>[('x', True), ('y', False)] :: [(Char, Bool)]</hask> |
||

+ | |||

+ | Lists are used a lot in Haskell. There are several functions that do nice things with them. |
||

+ | |||

+ | Prelude> <hask>[1 .. 5]</hask> |
||

+ | <hask>[1,2,3,4,5]</hask> |
||

+ | Prelude> <hask>map (+2) [1 .. 5]</hask> |
||

+ | <hask>[3,4,5,6,7]</hask> |
||

+ | Prelude> <hask>filter (> 2) [1 .. 5]</hask> |
||

+ | <hask>[3,4,5]</hask> |
||

+ | |||

+ | TODO: Can't think of a good way to describe fold |
||

+ | |||

+ | There are two nice functions on ordered pairs (tuples of two elements): |
||

+ | |||

+ | Prelude> <hask>fst (1, 2)</hask> |
||

+ | <hask>1</hask> |
||

+ | Prelude> <hask>snd (1, 2)</hask> |
||

+ | <hask>2</hask> |
||

+ | Prelude> <hask>map fst [(1, 2), (3, 4), (5, 6)]</hask> |
||

+ | <hask>[1,3,5]</hask> |
||

+ | |||

== Function Definitions == |
== Function Definitions == |
||

=== Simple Functions === |
=== Simple Functions === |

## Revision as of 06:45, 13 July 2007

## Contents |

## 1 Overview

Haskell is a functional (that is, everything is done with function calls), statically, implicitly typed (types are checked by the compiler, but you don't have to declare them), lazy (nothing is done until it needs to be) language. It's closest popular relative is probably the ML family of languages.

The most common Haskell compiler is GHC. You can download GHC from http://www.haskell.org/ghc/download_ghc_661.html. GHC binaries are available for Linux, FreeBSD, MacOS, Windows, and Solaris. Once you've installed GHC, you get two programs you're interested in right now: ghc, and ghci. The first compiles Haskell libraries or applications to binary code. The second is an interpreter that lets you write Haskell code and get feedback right away.

## 2 Simple Expressions

You can type most math expressions directly into ghci and get an answer.

Prelude>15Prelude>

15Prelude>

16Strings are in "double quotes." You can concatenate them with

"Hello"Prelude>

"Hello, Haskell"

Calling functions is done by putting the arguments directly after the function. There are no parentheses as part of the function call:

Prelude>6Prelude>

6Prelude>

7Prelude>

1.4142135623730951Prelude>

TruePrelude>

7

## 3 The Console

I/O actions can be used to read from and write to the console. Some common ones include:

Prelude>Hello, HaskellPrelude>

9Prelude>

TrueThe

2 + 2 = 4Prelude>

ABCDE 12345Reading can be done with

4 16

(The 4 was input. The 16 was a result.)

There is actually another way to writemain = do putStrLn "What is 2 + 2?" x <- readLn if x == 4 then putStrLn "You're right!" else putStrLn "You're wrong!"

## 4 Simple Types

So far, not a single type declaration has been mentioned. That's because Haskell does type inference. You generally don't have to declare types unless you want to. If you do want to declare types, you use5Prelude>

5.0

You can also ask ghci what type it has chosen for something. This is useful because you don't generally have to declare your types.

Prelude> :tThings get more interesting for numbers.

Prelude> :tThese type signatures mean:

- can be used as any numeric type. (This is why I was able to declare42can be any fractional type, but not an integral type.5<hask> as either an Int or a Double earlier.)

* <hask>42.0 - (which is a function call, incidentally) can be any integral type, but not a fractional type.gcd 15 20

There are five numeric types in the Haskell "prelude" (the part of the library you get without having to import anything):

- is an integer with at least 30 bits of precision.Int
- is an integer with unlimited precision.Integer
- is a single precision floating point number.Float
- is a double precision floating point number.Double
- type class. The first two belong toRational<hask> is a fraction type, with no rounding error.

All five of these belong to the <hask>Num, and the last two toIntegral.Fractional

Putting it all together,

Prelude>7Prelude>

<interactive>:1:0: No instance for (Integral Double)The final type worth mentioning here is

## 5 Structured Data

Basic data types can be easily combined in two ways: lists, which go in [square brackets], and tuples, which go in (parentheses).

Lists are used to hold multiple values of the same type.

Prelude>[1,2,3]Prelude>

[1,2,3,4,5]Prelude>

[1,3,5,7,9]Prelude>

[True,False,True]

Strings are just lists of characters.

Prelude>"Hello"The

"CHello"

Tuples hold a fixed number of values, which can have different types.

Prelude>(1,True)Prelude>

[(1,'a'),(2,'b'),(3,'c'),(4,'d'),(5,'e')]The last example used

The types are probably what you'd expect.

Prelude> :tLists are used a lot in Haskell. There are several functions that do nice things with them.

Prelude>TODO: Can't think of a good way to describe fold

There are two nice functions on ordered pairs (tuples of two elements):

Prelude>