How to Design Program

Prologue

Prologue-How to Program

Part 1 Fixed-Size Data

• 2_Functions
• 3 How to Design Programs
  • 3.2_Finger_Exercises_Functions
  • 3.6_design-world-programs
  • 3.7_Virtual-Pet-Worlds
• 4 Conditional
  • [4.2]
    • Exercise49_rocket6
  • 4.3Enumerations_simple-traffic-light
  • 4.4Intervals_UFO-intervals
  • 4.5
  • 4.5-1
  • 4.6TraficLight
• TODO: add ch5
• TODO: add ch6

Part 2 Arbitrarily Large Data

• 8 List
• 9.1FingerExercises
• 9.2 Non-empty Lists
• 9.3 Natural Numbers
• 10.1 Functions that Produce Lists
• 10.2 Structures in Lists
• 10.3 Reading files
• 11.2 Composing Functions
• 11.3 Auxiliary Functions that Recur

Part 3 Abstraction

• 14.1 Similarities in Functions
• 14.2 Different Similarities
• 14.3 Similarities in Data Definitions
• 14.4 Functions Are Values
• 15.1 Abstractions from Examples
• 16.1 Existing Abstractions
  • Figure 99-100 ISL’s abstract functions for list processing
  • Exercise 257
  • Figure 101：Creating a program with abstractions
• 16.2 Local Definitions

Part 4 Intertwined Data

• 19.1 Trees
  • Family Tree
• 19.3 S-expressions
• 19.5 Project：BSTs
• 20 Iterative Refinement
• 21 Refining Interpreters
• 22 Project: XML
  • 22.1 XML as S-expressions

Interperters

• from htdp ch20
• R2
  • from 怎样写一个解释器