sicp: A Scheme repository from catsout

Building Abstractions with Procedures
1. The Elements of Programming
  - Expressions
  - Naming and the Environment
  - Evaluating Combinations
  - Compound Procedures
  - The Substitution Model for Procedure Application
  - Conditional Expressions and Predicates
  - Example: Square Roots by Newton’s Method
  - Procedures as Black-Box Abstractions
2. Procedures and the Processes They Generate
  - Linear Recursion and Iteration
  - Tree Recursion
  - Orders of Growth
  - Exponentiation
  - Greatest Common Divisors
  - Example: Testing for Primality
3. Formulating Abstractions with Higher-Order Procedures
  - Procedures as Arguments
    1.29, 1.30, 1.31, 1.32
  - Constructing Procedures Using lambda
  - Procedures as General Methods
    1.35, 1.36, 1.37, 1.38, 1.39
  - Procedures as Returned Values
    1.40, 1.41, 1.42, 1.43, 1.45, 1.46
Building Abstractions with Data
1. Introduction to Data Abstraction
  - Example: Arithmetic Operations for Rational Numbers
    2.1
  - Abstraction Barriers
    2.2, 2.3
  - What Is Meant by Data?
    2.4, 2.5, 2.6
  - Extended Exercise: Interval Arithmetic
2. Hierarchical Data and the Closure Property
  - Representing Sequences
    2.17, 2.18, 2.19, 2.20, 2.21, 2.22, 2.23
  - Hierarchical Structures
    2.24, 2.25, 2.26, 2.27, 2.28, 2.29, 2.30, 2.31, 2.32
  - Sequences as Conventional Interfaces
    2.33, 2.34, 2.35, 2.36, 2.37, 2.38, 2.39, 2.40, 2.41, 2.42
  - Example: A Picture Language
3. Symbolic Data
  - Qotation
    2.53, 2.54
  - Example: Symbolic Differentiation
    2.56, 2.57, 2.58, 2.59, 2.61, 2.62
  - Example: Representing Sets
    2.63, 2.64, 2.65, 2.66
  - Example: Huffman Encoding Trees
    2.67, 2.68, 2.69, 2.70
4. Multiple Representations for Abstract Data
  - Representations for Complex Numbers
  - Tagged data
  - Data-Directed Programming and Additivity
5. Systems with Generic Operations
  - Generic Arithmetic Operations
  - Combining Data of Different Types
  - Example: Symbolic Algebra

catsout/sicp