Building Abstractions with Procedures

1. The Elements of Programming

   1 486

(+ 137 349)
486
(- 1000 334)
666
(* 5 99)
495
(/ 10 5)
2
(+ 2.7 10)
12.7

   1 137 + 349
   2 1000 - 334
   3 5 * 99
   4 10 / 5
   5 2.7 + 10

(+ 21 35 12 7)
75

(* 25 4 12)
1200

   1 21 + 35 + 12 + 7
   2 25 * 4 * 12

或者

reduce(int.__add__, [21, 35, 12, 7])
reduce(int.__mul__, [25, 4, 12])

(+ (* 3 5) (- 10 6))
19

   1 (3 * 5) + (10 - 6)

(+ (* 3
      (+ (* 2 4)
         (+ 3 5)))
   (+ (- 10 7)
      6))

   1 (3*((2*4)+(3+5)))) + ((10-7)+6)

1.1.2 Naming and the Environment 1.1.3 Evaluating Combinations 1.1.4 Compound Procedures 1.1.5 The Substitution Model for Procedure Application 1.1.6 Conditional Expressions and Predicates 1.1.7 Example: Square Roots by Newton's Method 1.1.8 Procedures as Black-Box Abstractions

1.2 Procedures and the Processes They Generate
- 1.2.1 Linear Recursion and Iteration 1.2.2 Tree Recursion 1.2.3 Orders of Growth 1.2.4 Exponentiation 1.2.5 Greatest Common Divisors 1.2.6 Example: Testing for Primality
1.3 Formulating Abstractions with Higher-Order Procedures
- 1.3.1 Procedures as Arguments 1.3.2 Constructing Procedures Using Lambda 1.3.3 Procedures as General Methods 1.3.4 Procedures as Returned Values