8.3 Lower Bounds. . . . . . . . . . . . . . . 8.4 Least Types. . . . . . . . . . . . . . . . . 8.5 Tuples. . . . . . . . . . . . . . . . . . . . 8.6 Functions. . . . . . . . . . . . . . . . .
Lists9.1 Using Lists. . . . . . . . . . . . . . . . . 9.2 Definition of class List I: First Order Met9.3 Example: Merge sort. . . . . . . . . . . 9.4 Definition of class List II: Higher-Order M9.5 Summary. . . . . . . . . . . . . . . . . .
10 For-Comprehensions10.1 The N-Queens Problem. . . . . . . . . 10.2 Querying with For-Comprehensions. . 10.3 Translation of For-Comprehensions. . 10.4 For-Loops. . . . . . . . . . . . . . . . . 10.5 Generalizing For. . . . . . . . . . . . . .
11 Mutable State11.1 Stateful Objects. . . . . . . . . . . . . . 11.2 Imperative Control Structures. . . . . . 11.3 Extended Example: Discrete Event Simu11.4 Summary. . . . . . . . . . . . . . . . . .
12 Computing with Streams
13 Iterators13.1 Iterator Methods. . . . . . . . . . . . . 13.2 Constructing Iterators. . . . . . . . . . 13.3 Using Iterators. . . . . . . . . . . . . . .
14 Lazy Values
15 Implicit Parameters and Conversions