0.0_Structure_and_Interpretation_of_Computer_Programs.ipynb

{
 "cells": [
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "# Structure and Interpretation of Computer Programs\n",
    "Second Edition\n",
    "Unofficial Texinfo Format 2.andresraba6.6\n",
    "\n",
    "Harold Abelson and Gerald Jay Sussman with Julie Sussman, foreword by Alan J. Perlis\n",
    "©1996 by The Massachusetts Institute of Technology\n",
    "  \n",
    "This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA 4.0). Based on a work at mitpress.mit.edu.\n",
    "\n",
    "The MIT Press\n",
    "Cambridge, Massachusetts\n",
    "London, England\n",
    "\n",
    "McGraw-Hill Book Company\n",
    "New York, St. Louis, San Francisco,\n",
    "Montreal, Toronto\n",
    "\n",
    "This book is one of a series of texts written by faculty of the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology. It was edited and produced by The MIT Press under a joint production-distribution arrangement with the McGraw-Hill Book Company.\n",
    "\n",
    "Unofficial Texinfo Format 2.andresraba6.6 (September 16, 2015), based on 2.neilvandyke4 (January 10, 2007).\n",
    "\n",
    "## Table of Contents\n",
    "- Unofficial Texinfo Format\n",
    "- Dedication\n",
    "- Foreword\n",
    "- Preface to the Second Edition\n",
    "- Preface to the First Edition\n",
    "- Acknowledgments\n",
    "- **1 Building Abstractions with Procedures**\n",
    "  - [1.1 The Elements of Programming](./1.1_The_Elements_of_Programming.ipynb)\n",
    "    - [1.1.1 Expressions](./1.1_The_Elements_of_Programming.ipynb#1.1.1-Expressions)\n",
    "    - [1.1.2 Naming and the Environment](./1.1_The_Elements_of_Programming.ipynb#1.1.2-Naming-and-the-Environment)\n",
    "    - [1.1.3 Evaluating Combinations](./1.1_The_Elements_of_Programming.ipynb#1.1.3-Evaluating-Combinations)\n",
    "    - [1.1.4 Compound Procedures](./1.1_The_Elements_of_Programming.ipynb#1.1.4-Compound-Procedures)\n",
    "    - [1.1.5 The Substitution Model for Procedure Application](./1.1_The_Elements_of_Programming.ipynb#1.1.5-The-Substitution-Model-for-Procedure-Application)\n",
    "    - [1.1.6 Conditional Expressions and Predicates](./1.1_The_Elements_of_Programming.ipynb#1.1.6-Conditional-Expressions-and-Predicates)\n",
    "    - [1.1.7 Example: Square Roots by Newton’s Method](./1.1_The_Elements_of_Programming.ipynb#1.1.7-Example:-Square-Roots-by-Newton’s-Method)\n",
    "    - [1.1.8 Procedures as Black-Box Abstractions](./1.1_The_Elements_of_Programming.ipynb#1.1.8-Procedures-as-Black-Box-Abstractions)\n",
    "  - [1.2 Procedures and the Processes They Generate](./1.2_Procedures_and_the_Processes_They_Generate.ipynb)\n",
    "    - [1.2.1 Linear Recursion and Iteration](./1.2_Procedures_and_the_Processes_They_Generate.ipynb#1.2.1-Linear-Recursion-and-Iteration)\n",
    "    - [1.2.2 Tree Recursion](./1.2_Procedures_and_the_Processes_They_Generate.ipynb#1.2.2-Tree-Recursion)\n",
    "    - [1.2.3 Orders of Growth](./1.2_Procedures_and_the_Processes_They_Generate.ipynb#1.2.3-Orders-of-Growth)\n",
    "    - [1.2.4 Exponentiation](./1.2_Procedures_and_the_Processes_They_Generate.ipynb#1.2.4-Exponentiation)\n",
    "    - [1.2.5 Greatest Common Divisors](./1.2_Procedures_and_the_Processes_They_Generate.ipynb#1.2.5-Greatest-Common-Divisors)\n",
    "    - [1.2.6 Example: Testing for Primality](./1.2_Procedures_and_the_Processes_They_Generate.ipynb#1.2.6-Example:-Testing-for-Primality)\n",
    "  - [1.3 Formulating Abstractions with Higher-Order Procedures](./1.3_Formulating_Abstractions_with_Higher-Order_Procedures.ipynb)\n",
    "    - [1.3.1 Procedures as Arguments](./1.3_Formulating_Abstractions_with_Higher-Order_Procedures.ipynb#1.3.1-Procedures-as-Arguments)\n",
    "    - [1.3.2 Constructing Procedures Using Lambda](./1.3_Formulating_Abstractions_with_Higher-Order_Procedures.ipynb#1.3.2-Constructing-Procedures-Using-Lambda)\n",
    "    - [1.3.3 Procedures as General Methods](./1.3_Formulating_Abstractions_with_Higher-Order_Procedures.ipynb#1.3.3-Procedures-as-General-Methods)\n",
    "    - [1.3.4 Procedures as Returned Values](./1.3_Formulating_Abstractions_with_Higher-Order_Procedures.ipynb#1.3.4-Procedures-as-Returned-Values)\n",
    "- **2 Building Abstractions with Data**\n",
    "  - [2.1 Introduction to Data Abstraction](./2.1_Introduction_to_Data_Abstraction.ipynb)\n",
    "    - [2.1.1 Example: Arithmetic Operations for Rational Numbers](./2.1_Introduction_to_Data_Abstraction.ipynb#2.1.1-Example:-Arithmetic-Operations-for-Rational-Numbers)\n",
    "    - [2.1.2 Abstraction Barriers](./2.1_Introduction_to_Data_Abstraction.ipynb#2.1.2-Abstraction-Barriers)\n",
    "    - [2.1.3 What Is Meant by Data?](./2.1_Introduction_to_Data_Abstraction.ipynb#2.1.3-What-Is-Meant-by-Data?)\n",
    "    - [2.1.4 Extended Exercise: Interval Arithmetic](./2.1_Introduction_to_Data_Abstraction.ipynb#2.1.4-Extended-Exercise:-Interval-Arithmetic)\n",
    "  - [2.2 Hierarchical Data and the Closure Property](./2.2_Hierarchical_Data_and_the_Closure_Property.ipynb)\n",
    "    - [2.2.1 Representing Sequences](./2.2_Hierarchical_Data_and_the_Closure_Property.ipynb#2.2.1-Representing-Sequences)\n",
    "    - [2.2.2 Hierarchical Structures](./2.2_Hierarchical_Data_and_the_Closure_Property.ipynb#2.2.2-Hierarchical-Structures)\n",
    "    - [2.2.3 Sequences as Conventional Interfaces](./2.2_Hierarchical_Data_and_the_Closure_Property.ipynb#2.2.3-Sequences-as-Conventional-Interfaces)\n",
    "    - [2.2.4 Example: A Picture Language](./2.2_Hierarchical_Data_and_the_Closure_Property.ipynb#2.2.4-Example:-A-Picture-Language)\n",
    "  - [2.3 Symbolic Data](./2.3_Symbolic_Data.ipynb)\n",
    "    - [2.3.1 Quotation](./2.3_Symbolic_Data.ipynb#2.3.1-Quotation)\n",
    "    - [2.3.2 Example: Symbolic Differentiation](./2.3_Symbolic_Data.ipynb#2.3.2-Example:-Symbolic-Differentiation)\n",
    "    - [2.3.3 Example: Representing Sets](./2.3_Symbolic_Data.ipynb#2.3.3-Example:-Representing-Sets)\n",
    "    - [2.3.4 Example: Huffman Encoding Trees](./2.3_Symbolic_Data.ipynb#2.3.4-Example:-Huffman-Encoding-Trees)\n",
    "  - [2.4 Multiple Representations for Abstract Data](./2.4_Multiple_Representations_for_Abstract_Data.ipynb)\n",
    "    - [2.4.1 Representations for Complex Numbers](./2.4_Multiple_Representations_for_Abstract_Data.ipynb#2.4.1-Representations-for-Complex-Numbers)\n",
    "    - [2.4.2 Tagged data](./2.4_Multiple_Representations_for_Abstract_Data.ipynb#2.4.2-Tagged-data)\n",
    "    - [2.4.3 Data-Directed Programming and Additivity](./2.4_Multiple_Representations_for_Abstract_Data.ipynb#2.4.3-Data-Directed-Programming-and-Additivity)\n",
    "  - [2.5 Systems with Generic Operations](./2.5_Systems_with_Generic_Operations.ipynb)\n",
    "    - [2.5.1 Generic Arithmetic Operations](./2.5_Systems_with_Generic_Operations.ipynb#2.5.1-Generic-Arithmetic-Operations)\n",
    "    - [2.5.2 Combining Data of Different Types](./2.5_Systems_with_Generic_Operations.ipynb#2.5.2-Combining-Data-of-Different-Types)\n",
    "    - [2.5.3 Example: Symbolic Algebra](./2.5_Systems_with_Generic_Operations.ipynb#2.5.3-Example:-Symbolic-Algebra)\n",
    "- **3 Modularity, Objects, and State***\n",
    "  - [3.1 Assignment and Local State](./3.1_Assignment_and_Local_State.ipynb)\n",
    "    - [3.1.1 Local State Variables](./3.1_Assignment_and_Local_State.ipynb#3.1.1-Local-State-Variables)\n",
    "    - [3.1.2 The Benefits of Introducing Assignment](./3.1_Assignment_and_Local_State.ipynb#3.1.2-The-Benefits-of-Introducing-Assignment)\n",
    "    - [3.1.3 The Costs of Introducing Assignment](./3.1_Assignment_and_Local_State.ipynb#3.1.3-The-Costs-of-Introducing-Assignment)\n",
    "  - [3.2 The Environment Model of Evaluation](./3.2_The_Environment_Model_of_Evaluation.ipynb)\n",
    "    - [3.2.1 The Rules for Evaluation](./3.2_The_Environment_Model_of_Evaluation.ipynb#3.2.1-The-Rules-for-Evaluation)\n",
    "    - [3.2.2 Applying Simple Procedures](./3.2_The_Environment_Model_of_Evaluation.ipynb#3.2.2-Applying-Simple-Procedures)\n",
    "    - [3.2.3 Frames as the Repository of Local State](./3.2_The_Environment_Model_of_Evaluation.ipynb#3.2.3-Frames-as-the-Repository-of-Local-State)\n",
    "    - [3.2.4 Internal Definitions](./3.2_The_Environment_Model_of_Evaluation.ipynb#3.2.4-Internal-Definitions)\n",
    "  - [3.3 Modeling with Mutable Data](./3.3_Modeling_with_Mutable_Data.ipynb)\n",
    "    - [3.3.1 Mutable List Structure](./3.3_Modeling_with_Mutable_Data.ipynb#3.3.1-Mutable-List-Structure)\n",
    "    - [3.3.2 Representing Queues](./3.3_Modeling_with_Mutable_Data.ipynb#3.3.2-Representing-Queues)\n",
    "    - [3.3.3 Representing Tables](./3.3_Modeling_with_Mutable_Data.ipynb#3.3.3-Representing-Tables)\n",
    "    - [3.3.4 A Simulator for Digital Circuits](./3.3_Modeling_with_Mutable_Data.ipynb#3.3.4-A-Simulator-for-Digital-Circuits)\n",
    "    - [3.3.5 Propagation of Constraints](./3.3_Modeling_with_Mutable_Data.ipynb#3.3.5-Propagation-of-Constraints)\n",
    "  - [3.4 Concurrency: Time Is of the Essence](./3.4_Concurrency:_Time_Is_of_the_Essence.ipynb)\n",
    "    - [3.4.1 The Nature of Time in Concurrent Systems](./3.4_Concurrency:_Time_Is_of_the_Essence.ipynb#3.4.1 The-Nature-of-Time-in-Concurrent-Systems)\n",
    "    - [3.4.2 Mechanisms for Controlling Concurrency](./3.4_Concurrency:_Time_Is_of_the_Essence.ipynb#3.4.2-Mechanisms-for-Controlling-Concurrency)\n",
    "  - [3.5 Streams](./3.5_Streams.ipynb)\n",
    "    - [3.5.1 Streams Are Delayed Lists](./3.5_Streams.ipynb#3.5.1-Streams-Are-Delayed-Lists)\n",
    "    - [3.5.2 Infinite Streams](./3.5_Streams.ipynb#3.5.2-Infinite-Streams)\n",
    "    - [3.5.3 Exploiting the Stream Paradigm](./3.5_Streams.ipynb#3.5.3-Exploiting-the-Stream-Paradigm)\n",
    "    - [3.5.4 Streams and Delayed Evaluation](./3.5_Streams.ipynb#3.5.4-Streams-and-Delayed-Evaluation)\n",
    "    - [3.5.5 Modularity of Functional Programs and Modularity of Objects](./3.5_Streams.ipynb#3.5.5-Modularity-of-Functional-Programs-and-Modularity-of-Objects)\n",
    "- **4 Metalinguistic Abstraction**\n",
    "  - [4.1 The Metacircular Evaluator](./4.1_The_Metacircular_Evaluator.ipynb)\n",
    "    - [4.1.1 The Core of the Evaluator](./4.1_The_Metacircular_Evaluator.ipynb#4.1.1-The-Core-of-the-Evaluator)\n",
    "    - [4.1.2 Representing Expressions](./4.1_The_Metacircular_Evaluator.ipynb#4.1.2-Representing-Expressions)\n",
    "    - [4.1.3 Evaluator Data Structures](./4.1_The_Metacircular_Evaluator.ipynb#4.1.3-Evaluator-Data-Structures)\n",
    "    - [4.1.4 Running the Evaluator as a Program](./4.1_The_Metacircular_Evaluator.ipynb#4.1.4-Running-the-Evaluator-as-a-Program)\n",
    "    - [4.1.5 Data as Programs](./4.1_The_Metacircular_Evaluator.ipynb#4.1.5-Data-as-Programs)\n",
    "    - [4.1.6 Internal Definitions](./4.1_The_Metacircular_Evaluator.ipynb#4.1.6-Internal-Definitions)\n",
    "    - [4.1.7 Separating Syntactic Analysis from Execution](./4.1_The_Metacircular_Evaluator.ipynb#4.1.7-Separating-Syntactic-Analysis-from-Execution)\n",
    "  - [4.2 Variations on a Scheme — Lazy Evaluation](./4.2_Variations_on_a_Scheme_—_Lazy_Evaluation.ipynb)\n",
    "    - [4.2.1 Normal Order and Applicative Order](./4.2_Variations_on_a_Scheme_—_Lazy_Evaluation.ipynb#4.2.1-Normal-Order-and-Applicative-Order)\n",
    "    - [4.2.2 An Interpreter with Lazy Evaluation](./4.2_Variations_on_a_Scheme_—_Lazy_Evaluation.ipynb#4.2.2-An-Interpreter-with-Lazy-Evaluation)\n",
    "    - [4.2.3 Streams as Lazy Lists](./4.2_Variations_on_a_Scheme_—_Lazy_Evaluation.ipynb#4.2.3-Streams-as-Lazy-Lists)\n",
    "  - [4.3 Variations on a Scheme — Nondeterministic Computing](./4.3_Variations_on_a_Scheme_—_Nondeterministic_Computing.ipynb)\n",
    "    - [4.3.1 Amb and Search](./4.3_Variations_on_a_Scheme_—_Nondeterministic_Computing.ipynb#4.3.1-Amb-and-Search)\n",
    "    - [4.3.2 Examples of Nondeterministic Programs](./4.3_Variations_on_a_Scheme_—_Nondeterministic_Computing.ipynb#4.3.2-Examples-of-Nondeterministic-Programs)\n",
    "    - [4.3.3 Implementing the Amb Evaluator](./4.3_Variations_on_a_Scheme_—_Nondeterministic_Computing.ipynb#4.3.3-Implementing-the-Amb-Evaluator)\n",
    "  - [4.4 Logic Programming](./4.4_Logic_Programming.ipynb)\n",
    "    - [4.4.1 Deductive Information Retrieval](./4.4_Logic_Programming.ipynb#4.4.1-Deductive-Information-Retrieval)\n",
    "    - [4.4.2 How the Query System Works](./4.4_Logic_Programming.ipynb#4.4.2-How-the-Query-System-Works)\n",
    "    - [4.4.3 Is Logic Programming Mathematical Logic?](./4.4_Logic_Programming.ipynb#4.4.3-Is-Logic-Programming-Mathematical-Logic?)\n",
    "    - [4.4.4 Implementing the Query System](./4.4_Logic_Programming.ipynb#4.4.4-Implementing-the-Query-System)\n",
    "      - [4.4.4.1 The Driver Loop and Instantiation](./4.4_Logic_Programming.ipynb#4.4.4.1-The-Driver-Loop-and-Instantiation)\n",
    "      - [4.4.4.2 The Evaluator](./4.4_Logic_Programming.ipynb#4.4.4.2-The-Evaluator)\n",
    "      - [4.4.4.3 Finding Assertions by Pattern Matching](./4.4_Logic_Programming.ipynb#4.4.4.3-Finding-Assertions-by-Pattern-Matching)\n",
    "      - [4.4.4.4 Rules and Unification](./4.4_Logic_Programming.ipynb#4.4.4.4-Rules-and-Unification)\n",
    "      - [4.4.4.5 Maintaining the Data Base](./4.4_Logic_Programming.ipynb#4.4.4.5-Maintaining-the-Data-Base)\n",
    "      - [4.4.4.6 Stream Operations](./4.4_Logic_Programming.ipynb#4.4.4.6-Stream-Operations)\n",
    "      - [4.4.4.7 Query Syntax Procedures](./4.4_Logic_Programming.ipynb#4.4.4.7-Query-Syntax-Procedures)\n",
    "      - [4.4.4.8 Frames and Bindings](./4.4_Logic_Programming.ipynb#4.4.4.8-Frames-and-Bindings)\n",
    "- **5 Computing with Register Machines**\n",
    "  - [5.1 Designing Register Machines](./5.1_Designing_Register_Machines.ipynb)\n",
    "    - [5.1.1 A Language for Describing Register Machines](./5.1_Designing_Register_Machines.ipynb#5.1.1-A-Language-for-Describing-Register-Machines)\n",
    "    - [5.1.2 Abstraction in Machine Design](./5.1_Designing_Register_Machines.ipynb#5.1.2-Abstraction-in-Machine-Design)\n",
    "    - [5.1.3 Subroutines](./5.1_Designing_Register_Machines.ipynb#5.1.3-Subroutines)\n",
    "    - [5.1.4 Using a Stack to Implement Recursion](./5.1_Designing_Register_Machines.ipynb#5.1.4-Using-a-Stack-to-Implement-Recursion)\n",
    "    - [5.1.5 Instruction Summary](./5.1_Designing_Register_Machines.ipynb#5.1.5-Instruction-Summary)\n",
    "  - [5.2 A Register-Machine Simulator](./5.2_A_Register-Machine_Simulator.ipynb)\n",
    "    - [5.2.1 The Machine Model](./5.2_A_Register-Machine_Simulator.ipynb#5.2.1-The-Machine-Model)\n",
    "    - [5.2.2 The Assembler](./5.2_A_Register-Machine_Simulator.ipynb#5.2.2-The-Assembler)\n",
    "    - [5.2.3 Generating Execution Procedures for Instructions](./5.2_A_Register-Machine_Simulator.ipynb#5.2.3-Generating-Execution-Procedures-for-Instructions)\n",
    "    - [5.2.4 Monitoring Machine Performance](./5.2_A_Register-Machine_Simulator.ipynb#5.2.4-Monitoring-Machine-Performance)\n",
    "  - [5.3 Storage Allocation and Garbage Collection](./5.3_Storage_Allocation_and_Garbage_Collection.ipynb)\n",
    "    - [5.3.1 Memory as Vectors](./5.3_Storage_Allocation_and_Garbage_Collection.ipynb#5.3.1-Memory-as-Vectors)\n",
    "    - [5.3.2 Maintaining the Illusion of Infinite Memory](./5.3_Storage_Allocation_and_Garbage_Collection.ipynb#5.3.2-Maintaining-the-Illusion-of-Infinite-Memory)\n",
    "  - [5.4 The Explicit-Control Evaluator](./5.4_The_Explicit-Control_Evaluator.ipynb)\n",
    "    - [5.4.1 The Core of the Explicit-Control Evaluator](./5.4_The_Explicit-Control_Evaluator.ipynb#5.4.1 The-Core-of-the-Explicit-Control-Evaluator)\n",
    "    - [5.4.2 Sequence Evaluation and Tail Recursion](./5.4_The_Explicit-Control_Evaluator.ipynb#5.4.2-Sequence-Evaluation-and-Tail-Recursion)\n",
    "    - [5.4.3 Conditionals, Assignments, and Definitions](./5.4_The_Explicit-Control_Evaluator.ipynb#5.4.3-Conditionals,-Assignments,-and-Definitions)\n",
    "    - [5.4.4 Running the Evaluator](./5.4_The_Explicit-Control_Evaluator.ipynb#5.4.4-Running-the-Evaluator)\n",
    "  - [5.5 Compilation](./5.5_Compilation.ipynb)\n",
    "    - [5.5.1 Structure of the Compiler](./5.5_Compilation.ipynb#5.5.1-Structure-of-the-Compiler)\n",
    "    - [5.5.2 Compiling Expressions](./5.5_Compilation.ipynb#5.5.2-Compiling-Expressions)\n",
    "    - [5.5.3 Compiling Combinations](./5.5_Compilation.ipynb#5.5.3-Compiling-Combinations)\n",
    "    - [5.5.4 Combining Instruction Sequences](./5.5_Compilation.ipynb#5.5.4-Combining-Instruction-Sequences)\n",
    "    - [5.5.5 An Example of Compiled Code](./5.5_Compilation.ipynb#5.5.5-An-Example-of-Compiled-Code)\n",
    "    - [5.5.6 Lexical Addressing](./5.5_Compilation.ipynb#5.5.6-Lexical-Addressing)\n",
    "    - [5.5.7 Interfacing Compiled Code to the Evaluator](./5.5_Compilation.ipynb#5.5.7-Interfacing-Compiled-Code-to-the-Evaluator)\n",
    "- References\n",
    "- List of Exercises\n",
    "- List of Figures\n",
    "- Term Index\n",
    "- Colophon\n",
    "- References\n",
    "- List of Exercises\n",
    "- List of Figures\n",
    "- Term Index\n",
    "- Colophon"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": null,
   "metadata": {
    "collapsed": true
   },
   "outputs": [],
   "source": []
  }
 ],
 "metadata": {
  "kernelspec": {
   "display_name": "Python 3",
   "language": "python",
   "name": "python3"
  },
  "language_info": {
   "codemirror_mode": {
    "name": "ipython",
    "version": 3
   },
   "file_extension": ".py",
   "mimetype": "text/x-python",
   "name": "python",
   "nbconvert_exporter": "python",
   "pygments_lexer": "ipython3",
   "version": "3.5.2"
  }
 },
 "nbformat": 4,
 "nbformat_minor": 4
}