How to Design Programs, 2ed

1-7 Fixed-Size Data

1. Arithmetic

2. Functions and Programs

./1-7 Fixed-Size Data/2-functions and programs.rkt

3. How to Design Programs

./1-7 Fixed-Size Data/3-how to design programs.rkt 39-41 43 44 47

4. Intervals, Enumerations, Itemizations

51 53-57 59 62

5. Adding Structure

74 81 82 chameleon graphical editor graphical editor 2

6. Itemizations and Structures

107 107-2 108 109 space invader game space invader game 2

7. Summary

8-13 Arbitrarily Large Data

8. Lists

9. Designing with Self-referential Data Definition

137-138 140 141 142 145, 146 147 150, 151 152, 153 154 158 159 160

10. More on Lists

163, 164, 165 166 167, 168, 169 170 172 173 174 175 176 179

11. Design by Composition

181, 182, 183, 184 186 187 188 189 190 193 194

12. Projects: Lists

195, 196, 197, 198 199, 200, 201, 202, 203, 204 205, 206, 207, 208 209, 210, 211 212, 213, 214 215, 216, 217, 218, 219 220, 221, 222, 223 226, 228

14-18 Abstraction

14. Similarities Everywhere

235, 236 238 245

15. Designing Abstractions

250, 251, 252

16. Using Abstractions

257, 258 267, 268, 269 270, 271 272, 273, 274

17. Nameless Functions

285, 286, 287, 288, 289, 290, 291 292, 293, 294, 295 299

Intermezzo

305, 306, 307 308, 309

19-24 Intertwined Data

19. The Poetry of S-expressions

310, 311, 312, 313, 314, 315 316, 317, 318, 319, 320, 321 322, 323, 324, 325, 326, 327

20. Incremental Refinement

330, 331, 332, 333, 334, 335, 336 338, 339, 340, 341, 342, 343, 344

21. Refining Interpreters

345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355 356, 357, 358, 359 360, 361, 362

22. The Commerce of XML

363, 364, 365, 366, 369 370, 371, 372, 376, 377 378, 379, 380, 381, 382, 383 384, 386

23. Simultaneous Processing

387, 388, 389 393, 394, 395 396 397, 398, 399, 400, 401 403, 404, 405, 406, 407, 408, 409 410, 411 412

25-30 Generative Recursion

25. Non-standard Recursion

422, 423 426, 430

26. Designing Algorithms

432, 433, 434, 436, 437, 442

27. Variations on the Theme

445, 446-449, 450, 451 453, 454

29. Algorithms that Backtrack

471, 472, 473 479, 480, 481, 482

31-34 Accumulators

31. The Loss of Knowledge

490, 493

32. Designing Accumulator-style Functions

499 500, 501, 502, 503 504, 505, 506, 507, 508 509, 510 511

33. More Uses of Accumulations

513, 515, 516, 518 514, 517 522 523-525 526-527 528 529