viii
Contents
3.1 The Booleans:
Boo1
3.2 The integers:
Int
3.3
Overloading
3.4 Guards
3.5 The characters:
Char
3.6 Floating-point numbers:
Float
3.7 Syntax
4
Designing and
writing
programs
4.1
Where
do
I
start? Designing a program in Haskell
4.2 Recursion
4.3 Primitive recursion in practice
4.4 General forms of recursion
4.5 Program testing
5
Data types: tuples and lists
5.1
Introducing tuples, lists and strings
5.2 Tuple types
5.3 Our approach to lists
5.4 Lists in Haskell
5.5 List comprehensions
5.6
A
library database
5.7 Generic functions: polymorphism
5.8
Haskell list functions in
Prelude.
hs
5.9 The
string
type
6
Programming
with
lists
6.1 The
Picture
example, revisited
6.2 Extended exercise: positioned pictures
6.3 Local definitions
6.4 Extended exercise: supermarket billing
7
Defining functions over lists
7.1 Pattern matching revisited
7.2 Lists and
list
patterns
7.3 Primitive recursion over
lists
7.4 Finding primitive recursive definitions
7.5 General recursions over lists
7.6 Example: text processing
8
Reasoning about programs
8.1 Understanding definitions
8.2 Testing and proof
