1
Q
tree accumulation
A
A form of evaluation rule where the values of the operands in the tree percolate upwards starting from the terminal nodes
2
Q
special forms
A
Exceptions to the general evaluation rule
3
Q
syntax in a programming language
A
the various kinds of expressions in the programming language, each with its associated evaluation rule
SICP
flashcards
Decks in class (11)
# Cards
-
1 Building Abstractions with Procedures3
-
1.1 The Elements of Programming6
-
1.1.1 Expressions6
-
1.1.2 Naming and the Environment4
-
1.1.3 Evaluating Combinations3
-
1.1.4 Compound Procedures7
-
1.1.5 The Substitution Model for Procedure Application4
-
1.1.6 Conditional Expressions and Predicates8
-
1.1.7 Example: Square Roots by Newton's Method4
-
1.1.8 Procedures as Black-Box Abstractions10
-
T0
