Name binding, Recursion, Iteration, and Continuations

Page 1	Name binding constructs	Page 22	Examples of recursion: string-merge
Page 2	The `let` name binding expression	Page 23	Examples with recursion: `string-of-char-list?`
Page 3	The equivalent meaning of `let`	Page 24	Exercises
Page 4	Examples with `let` name binding	Page 25	Example of recursion: Hilbert Curves
Page 5	The `let*` name binding construct	Page 26	Hilbert Curves
Page 6	An example with `let*`	Page 27	Building Hilbert Curves of order 1
Page 7	The `letrec` namebinding construct	Page 28	Building Hilbert Curves of order 2
Page 8	LAML time functions	Page 29	Building Hilbert Curves of order 3
Page 9	Conditional expressions	Page 30	Building Hilbert Curves of order 4
Page 10	Conditional expressions	Page 31	A program making Hilbert Curves
Page 11	Examples with `if`	Page 32	Continuations
Page 12	Example with `cond`: `leap-year?`	Page 33	Introduction and motivation
Page 13	Example with cond: `american-time`	Page 34	The catch and throw idea
Page 14	Example with `cond`: `as-string`	Page 35	A catch and throw example
Page 15	Recursion and iteration	Page 36	The intuition behind continuations
Page 16	Recursion	Page 37	Being more precise
Page 17	List processing	Page 38	The capturing of continuations
Page 18	Tree processing (1)	Page 39	Capturing, storing, and applying continuations
Page 19	Tree processing (2)	Page 40	Use of continuations for escaping purposes
Page 20	Recursion versus iteration	Page 41	Practical example: Length of an improper list
Page 21	Example of recursion: `number-interval`	Page 42	Practical example: Searching a binary tree