Chapter 0 Preface¶
Chapter 1 Grammars¶
Chapter 2 Functional Programming¶
- 1. List Construction and Deconstruction
- 2. Developing Basic, Recursive List-processing Functions
- 3. Recurring On Lists That Aren’t Flat
- 4. Using Helper Functions with Accumulators
- 5. Scope, Closures, Higher-order Functions, Static vs. Dynamic Binding
- 6. Procedural Abstraction: Map, Curry, and Compose
- 7. Procedural Abstraction: The Filtering and Folding (or Reduce) Patterns
- 8. Combining Map and Reduce
- 9. Continuations and Continuation Passing
Chapter 3 Lambda Calculus¶
Chapter 4 Interpreting the Functional Language SLang 1¶
Chapter 5 Interpreting the Imperative Language SLang 2¶
Chapter 6 Variations on Parameter Passing¶
Chapter 7 Type Systems¶
- 1. Types in Programming Languages
- 2. Type Inference
- 2.1. Type Environments
- 2.2. Typing Rules Expressed as Post Systems
- 2.3. Typing in a Scaled-down ML
- 2.4. Using Post System Rules to Describe Type Inferencing in ML
- 2.5. Parametric Polymorphism in ML
- 2.6. Type inferencing in ML
- 2.7. Type Inferencing Problem 1
- 2.8. Type Inferencing Problem 2
- 2.9. Type Inferencing Problem 3
- 2.10. Type Inferencing Problem 4
- 2.11. Type Inferencing Problem 5
- 2.12. Type Inferencing Problem 6
