SICP Distilled

• Licence
• Donate

Ch1 - Building Abstractions With Functions

• Chapter 1 Distilled
• Introduction
• 1.1 - The Elements Of Programming
• Expressions
• Naming and the Environment
• Evaluating Combinations
• Defining New Functions
• The Substitution Model
• Exercises
• Predicates
• Conditional Expressions
• Example: Newton’s Method
• Functions as Black-Box Abstractions
• 1.2 - Procedures and the Processes They Generate
• Linear Recursion and Iteration
• Tree Recursion
• Orders of Growth
• Exponentiation
Greatest Common Divisors
• Example: Testing For Primality
• 1.3 Higher Order Functions
• Project - Blackjack

Ch2 - Building Abstractions With Data

• Chapter 2 Distilled
• Introduction
• Data Abstraction
• Everything From Nothing
• Abstractions In Clojure
• Clojure's Data Structures
• Data Abstraction, Revisited
• Escher
• Project - Escher
• Symbolic Data
• Representing Sets
• Huffman Encoding Trees
• Zippers

Ch3 - Modularity, Objects, and State

• Chapter 3 Distorted
• Introduction
• Concurrency in Clojure

Ch4 - Metalinguistic Abstraction

• 4.1 - The Metacircular Evaluator
• The Halting Problem
• The Y Combinator
• 4.2 - Lazy Evaluation
• 4.3 - Nondeterministic Computing
• 4.4 - Logic Programming