[home]
1.11 Making your own operations
1.13 Statements and exceptions
1.14 Extended example: A cumulative song
1.15 Special Topic: Comparison with object-oriented programming
2.5 Case expressions and option types
2.6 Extended example: A language processor
3.13 Quantification and algorithms
3.15 Extended example: Verifying arguments automatically
4.10 From theorems to algorithms
4.11 Extended example: Solving games
5.10 Extended example: Unification and resolution
5.11 Extended example: Unification and resolution
6.11 From theorems to algorithms, revisited
6.12 Extended example: Huffman encoding
6.12 Extended example: Huffman encoding, revised version. You can get a PDF of the revised version of this section here.
7.3 Functions as first-class values
7.11 Permutations and combinations
7.14 Extended example: Modeling mathematical functions
7.15 Special topic: Countability
8.7 Extended example: Graph algorithms
9.10 Extended example: The Knapsack Problem
10.5 Implementing lattice operations
10.7 Special topic: Digital logic circuits
11.6 Extended example: RSA encryption
12.2 Deterministic finite automata
12.5 Language model equivalence and limitations