1 Sets 13
2 Types 19
3 Simple Computations 27
4 Venn Diagrams and Logical Connectives 35
5 Lists and Comprehensions 45
6 Features and Predicates 55
7 Testing Your Programs 63
8 Patterns of Reasoning 73
9 More Patterns of Reasoning 81
10 Lists and Recursion 91
11 More Fun with Recursion 101
12 Higher-Order Functions 111
13 Higher and Higher 123
14 Sequent Calculus 131
15 Algebraic Data Types 143
16 Expression Trees 157
17 Karnaugh Maps 175
18 Relations and Quantifiers 183
19 Checking Satisfiability 191
20 Data Representation 203
21 Data Abstraction 221
22 Efficient CNF Conversion 237
23 Counting Satisfying Valuations 249
24 Type Classes 263
25 Search in Trees 275
26 Combinatorial Algorithms 285
27 Finite Automata 299
28 Deterministic Finite Automata 311
29 Non-Deterministic Finite Automata 321
30 Input/Output and Monads 341
31 Regular Expressions 359
32 Non-Regular Languages 369
Index 377
Prof. Donald Sannella, Prof. Michael Fourman, and Prof. Philip Wadler are each at the University of Edinburgh's School of Informatics, Edinburgh, UK. Mr. Haoran Peng is also at the same university department.
