Learn Haskell in 10 minutes
From HaskellWiki
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. Its closest popular relative is probably the ML family of languages (which are not, however, lazy languages).
The most common Haskell compiler is GHC. You can download GHC from http://www.haskell.org/ghc/download . GHC binaries are available for GNU/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> is the default GHCi prompt.
Prelude> 3 * 5 15 Prelude> 4 ^ 2 - 1 15 Prelude> (1 - 5)^(3 * 2 - 4) 16Strings are in "double quotes." You can concatenate them with
Prelude> "Hello" "Hello" Prelude> "Hello" ++ ", Haskell" "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> succ 5 6 Prelude> truncate 6.59 6 Prelude> round 6.59 7 Prelude> sqrt 2 1.4142135623730951 Prelude> not (5 < 3) True Prelude> gcd 21 14 7
3 The console
I/O actions can be used to read from and write to the console. Some common ones include:
Prelude> putStrLn "Hello, Haskell" Hello, Haskell Prelude> putStr "No newline" No newline Prelude> print (5 + 4) 9 Prelude> print (1 < 2) TrueThe
Prelude> do { putStr "2 + 2 = " ; print (2 + 2) } 2 + 2 = 4 Prelude> do { putStrLn "ABCDE" ; putStrLn "12345" } ABCDE 12345Reading can be done with
Prelude> do { n <- readLn ; print (n^2) } 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!"
(Note: Do not indent with tabs if you're using layout. It technically still works if your tabs are 8 spaces, but it's a bad idea. Also, don't use proportional fonts -- which apparently some people do, even when programming!)
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 usePrelude> 5 :: Int 5 Prelude> 5 :: Double 5.0
Types (and type classes, discussed later) always start with upper-case letters in Haskell. Variables always start with lower-case letters. This is a rule of the language, not a naming convention.
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> :t True True :: Bool Prelude> :t 'X' 'X' :: Char Prelude> :t "Hello, Haskell" "Hello, Haskell" :: [Char](In case you noticed,
Things get more interesting for numbers.
Prelude> :t 42 42 :: (Num t) => t Prelude> :t 42.0 42.0 :: (Fractional t) => t Prelude> :t gcd 15 20 gcd 15 20 :: (Integral t) => t
These types use "type classes." They mean:
- can be used as any numeric type. (This is why I was able to declare42as either an5or aIntearlier.)Double
- can be any fractional type, but not an integral type.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
- is a fraction type, with no rounding error.Rational
Putting it all together,
Prelude> gcd 42 35 :: Int 7 Prelude> gcd 42 35 :: Double <interactive>:1:0: No instance for (Integral Double)The final type worth mentioning here is
Prelude> () () Prelude> :t () () :: ()You can think of this as similar to the void keyword in C family languages. You can return
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] [1,2,3] Prelude> [1 .. 5] [1,2,3,4,5] Prelude> [1, 3 .. 10] [1,3,5,7,9] Prelude> [True, False, True] [True,False,True]
Strings are just lists of characters.
Prelude> ['H', 'e', 'l', 'l', 'o'] "Hello"The
Prelude> 'C' : ['H', 'e', 'l', 'l', 'o'] "CHello"
Tuples hold a fixed number of values, which can have different types.
Prelude> (1, True) (1,True) Prelude> zip [1 .. 5] ['a' .. 'e'] [(1,'a'),(2,'b'),(3,'c'),(4,'d'),(5,'e')]The last example used
The types are probably what you'd expect.
Prelude> :t ['a' .. 'c'] ['a' .. 'c'] :: [Char] Prelude> :t [('x', True), ('y', False)] [('x', True), ('y', False)] :: [(Char, Bool)]
Lists are used a lot in Haskell. There are several functions that do nice things with them.
Prelude> [1 .. 5] [1,2,3,4,5] Prelude> map (+ 2) [1 .. 5] [3,4,5,6,7] Prelude> filter (> 2) [1 .. 5] [3,4,5]
There are two nice functions on ordered pairs (tuples of two elements):
Prelude> fst (1, 2) 1 Prelude> snd (1, 2) 2 Prelude> map fst [(1, 2), (3, 4), (5, 6)] [1,3,5]
Also see how to work on lists
6 Function definitions
We wrote a definition of an IO action earlier, calledmain = do putStrLn "What is 2 + 2?" x <- readLn if x == 4 then putStrLn "You're right!" else putStrLn "You're wrong!"
module Main where factorial n = if n == 0 then 1 else n * factorial (n - 1) main = do putStrLn "What is 5! ?" x <- readLn if x == factorial 5 then putStrLn "You're right!" else putStrLn "You're wrong!"
Build again with ghc --make Test.hs. And,
$ ./Test What is 5! ? 120 You're right!There's a function. Just like the built-in functions, it can be called as
Now ask ghci for the type.
$ ghci Test.hs << GHCi banner >> Ok, modules loaded: Main. Prelude Main> :t factorial factorial :: (Num a) => a -> aFunction types are written with the argument type, then
Factorial can be simplified by writing it with case analysis.
factorial 0 = 1 factorial n = n * factorial (n - 1)
7 Convenient syntax
A couple extra pieces of syntax are helpful.
secsToWeeks secs = let perMinute = 60 perHour = 60 * perMinute perDay = 24 * perHour perWeek = 7 * perDay in secs / perWeek
classify age = case age of 0 -> "newborn" 1 -> "infant" 2 -> "toddler" _ -> "senior citizen"
8 Using libraries
Everything used so far in this tutorial is part of the Prelude, which is the set of Haskell functions that are always there in any program.
The best road from here to becoming a very productive Haskell programmer (aside from practice!) is becoming familiar with other libraries that do the things you need. Documentation on the standard libraries is at http://haskell.org/ghc/docs/latest/html/libraries/. There are modules there with:
- Useful data structures
- Concurrent and parallel programming
- Graphics and GUI libraries
- Networking, POSIX, and other system-level stuff
- Two test frameworks, QuickCheck and HUnit
- Regular expressions and predictive parsers
- More...
module Main where import qualified Data.Map as M errorsPerLine = M.fromList [ ("Chris", 472), ("Don", 100), ("Simon", -5) ] main = do putStrLn "Who are you?" name <- getLine case M.lookup name errorsPerLine of Nothing -> putStrLn "I don't know you" Just n -> do putStr "Errors per line: " print n
If you want something that's not in the standard library, try looking at http://hackage.haskell.org/packages/hackage.html or this wiki's applications and libraries page. This is a collection of many different libraries written by a lot of people for Haskell. Once you've got a library, extract it and switch into that directory and do this:
runhaskell Setup configure runhaskell Setup build runhaskell Setup install
On a UNIX system, you may need to be root for that last part.
9 Topics that don't fit in 10 minute limit
- Advanced data types
- Arithmetic lists
- List comprehensions
- Type synonyms
- data vs newtype (and here)
- Type classes and instances
- Advanced syntax
- Advanced functions
- Monads
- File I/O
- Reading files
- Writing Files