Cookbook
From HaskellWiki
(Added a writeFile example) |
(Added some more information on lists.) |
||
| Line 106: | Line 106: | ||
== Lists == | == Lists == | ||
| - | Haskell has all of the general list manipulation functions. | + | In Haskell, lists are what Arrays are in most other languages. Haskell has all of the general list manipulation functions, see also <hask>Data.List</hask> |
<haskell> | <haskell> | ||
| Line 117: | Line 117: | ||
Prelude> length [1,2,3] | Prelude> length [1,2,3] | ||
3 | 3 | ||
| + | </haskell> | ||
| + | |||
| + | Furthermore, Haskell supports some neat concepts. | ||
| + | |||
| + | ===Infinite lists=== | ||
| + | <haskell> | ||
| + | Prelude> [1..] | ||
| + | </haskell> | ||
| + | |||
| + | The list of all squares: | ||
| + | <haskell> | ||
| + | square x = x*x | ||
| + | squares = map square [1..] | ||
| + | </haskell> | ||
| + | |||
| + | But in the end, you probably don't want to use infinite lists, but make them finite. You can do this with <hask>take</hask>: | ||
| + | |||
| + | <haskell> | ||
| + | Prelude> take 10 squares | ||
| + | [1,4,9,16,25,36,49,64,81,100] | ||
| + | </hask> | ||
| + | |||
| + | ===List Comprehensions=== | ||
| + | |||
| + | The list of all squares can also be written in a more comprehensive way, using list comprehensions: | ||
| + | |||
| + | <haskell> | ||
| + | squares = [x*x | x <- [1..]] | ||
</haskell> | </haskell> | ||
Revision as of 18:29, 25 February 2007
We need to start a GOOD (aka, not a PLEAC clone) Haskell cookbook.
This page is based on the Scheme Cookbook at http://schemecookbook.org/Cookbook/WebHome
Contents |
1 GHCi/Hugs
1.1 GHCi interaction
To start GHCi from a command prompt, simply type `ghci'
$ ghci
___ ___ _
/ _ \ /\ /\/ __(_)
/ /_\// /_/ / / | | GHC Interactive, version 6.6, for Haskell 98.
/ /_\\/ __ / /___| | http://www.haskell.org/ghc/
\____/\/ /_/\____/|_| Type :? for help.
Loading package base ... linking ... done.
Prelude>
Prelude is the "base" library of Haskell.
To create variables at the GHCi prompt, use `let'
Prelude> let x = 5 Prelude> x 5 Prelude> let y = 3 Prelude> y 3 Prelude> x + y 8
2 Types
To check the type of an expression or function, use the command `:t'
Prelude> :t x x :: Integer Prelude> :t y y :: Integer
Haskell has the following types defined in the Standard Prelude.
Int -- bounded, word-sized integers Integer -- unbounded integers Double -- floating point values Char -- characters String -- strings () -- the unit type Bool -- booleans [a] -- lists (a,b) -- tuples / product types Either a b -- sum types Maybe a -- optional values
3 Strings
3.1 Input
Strings can be read as input using getLine.
Prelude> getLine Foo bar baz "Foo bar baz"
3.2 Output
Strings can be output in a number of different ways.
Prelude> putStr "Foo" FooPrelude>
As you can see, putStr does not include the newline character `\n'. We can either use putStr like this:
Prelude> putStr "Foo\n" Foo
Or use putStrLn, which is already in the Standard Prelude
Prelude> putStrLn "Foo" Foo
We can also use print to print a string, including the quotation marks.
Prelude> print "Foo" "Foo"
3.3 Concatenation
Concatenation of strings is done with the `++' operator.
Prelude> "foo" ++ "bar" "foobar"
4 Numbers
Numbers in Haskell can be of the type4.1 Random numbers
5 Dates and time
Use System.Time.getClockTime to get a properly formatted date stamp.
Prelude> System.Time.getClockTime Wed Feb 21 20:05:35 CST 2007
6 Lists
In Haskell, lists are what Arrays are in most other languages. Haskell has all of the general list manipulation functions, see alsoPrelude> head [1,2,3] 1 Prelude> tail [1,2,3] [2,3] Prelude> length [1,2,3] 3
Furthermore, Haskell supports some neat concepts.
6.1 Infinite lists
Prelude> [1..]
The list of all squares:
square x = x*x squares = map square [1..]
Prelude> take 10 squares [1,4,9,16,25,36,49,64,81,100] </hask> ===List Comprehensions=== The list of all squares can also be written in a more comprehensive way, using list comprehensions: <haskell> squares = [x*x | x <- [1..]]
7 Pattern matching
Haskell does implicit pattern matching.
A good example of pattern matching is done in the fact function for finding a factorial.
fact :: Integer -> Integer fact 0 = 1 fact n = n * fact (n - 1)
The 3rd and final line of this function is another pattern match, which says that, whatever number was entered as the argument, is multiplied by the factorial of that number, minus 1. Notice this function is recursive.
Pattern matching in Haskell evaluates the patterns in the order they are written, so8 Arrays
9 Files
9.1 Simple IO
UsingA program to sum up numbers:
main = interact $ show . sum . map read . lines
A program that adds line numbers to each line:
main = interact numberLines numberLines = unlines . zipWith combine [1..] . lines where combine lineNumber text = concat [show lineNumber, " ", text]
9.2 Reading from files
The System.IO library contains the functions needed for file IO. The program below displays the contents of the file c:\test.txt.
import System.IO main = do h <- openFile "c:\\test.txt" ReadMode contents <- hGetContents h putStrLn contents hClose h
The same program, with some higher-lever functions:
main = do contents <- readFile "c:\\test.txt" putStrLn contents
9.3 Writing to files
The following program writes the first 100 squares to a file:
-- generate a list of squares with length 'num' in string-format. numbers num = unlines $ take num $ map (show . \x -> x*x) [1..] main = do writeFile "test.txt" (numbers 100) putStrLn "successfully written"
