Next: Contents

How to Design Programs: DrScheme Companion

Matthias Felleisen
Robert Bruce Findler
Matthew Flatt
Shriram Krishnamurthi

Rice University
Houston, Texas

September 1, 2000

DRAFT

Contents
DrScheme Setup
- Getting Started with DrScheme
Information, Data, and Structural Processing
- Students, Teachers, and Computers
- Numbers, Expressions, Simple Programs
  - Numbers and Arithmetic
  - Variables and Programs
  - Word Problems- No Notes
  - Errors
  - Designing Programs
- Programs are Function and Variable Definitions
  - Composing Functions- No Notes
  - Variable Definitions
  - Finger Exercises on Composing Functions
- Conditional Expressions and Programs
  - Booleans and Relations
  - Programs that Test Conditions- No Notes
  - Conditionals and Conditional Programs
  - Designing Conditional Programs - No Notes
- Symbolic Information
- Compound Data, Part 1: Structures
  - Structures
  - Extended Exercise: Drawing Simple Pictures
  - Structure Definitionss
  - Designing Programs for Compound Data- No Notes
  - Extended Exercise: Moving Circles and Rectangles
  - Extended Exercise: Moving Circles and Rectangles
- Varieties of Data- No Notes
  - Mixing and Distinguishing Data- No Notes
  - Designing Functions for Mixed Data- No Notes
  - Composing Functions, Revisited- No Notes
  - Extended Exercise: Moving Shapes- No Notes
  - Input Errors- No Notes
Intermezzo 1: Syntax and Semantics
- Intermezzo 1: Syntax and Semantics
  - The Meaning of Scheme
Processing Arbitrarily Large Data
- Compound Data, Part 2: Lists
  - Lists- No Notes
  - Data Definitions for Lists of Arbitrary Length
  - Processing Lists of Arbitrary Length
  - Designing Programs for Self-Referential Data- No Notes
  - More on Processing Simple Lists- No Notes
- More on Processing Lists- No Notes
- Natural Numbers- No Notes
- Composing Functions, Revisited Again- No Notes
Intermezzo 2: List Abbreviations- No Notes
- Intermezzo 2: List Abbreviations- No Notes
More on Processing Arbitrarily Large Data- No Notes
- More Self-referential Data Definitions- No Notes
- Mutually Referential Data Definitions- No Notes
- Development through Iterative Refinement- No Notes
- Processing Two Complex Pieces of Data- No Notes
Intermezzo 3: Local Definitions and Lexical Scope
- Intermezzo 3: Local Definitions and Lexical Scope
Abstracting Designs- No Notes
- Similarities in Definitions- No Notes
- Functions are Values- No Notes
- Designing Abstractions from Examples- No Notes
- Designing Abstractions with First-Class Functions- No Notes
- Mathematical Examples- No Notes
Intermezzo 4: Defining Functions on the Fly
- Intermezzo 4: Defining Functions on the Fly
Generative Recursion- No Notes
- Generative Recursion and Algorithms- No Notes
- Designing Algorithms- No Notes
- Variations on a Theme- No Notes
- Algorithms that Backtrack- No Notes
Intermezzo 5: The Cost of Computing and Vectors- No Notes
- Intermezzo 5: The Cost of Computing and Vectors- No Notes
Accumulating Knowledge- No Notes
- The Loss of Knowledge- No Notes
- Designing Accumulator-Style Functions- No Notes
- More Uses of Accumulation- No Notes
Intermezzo 6: The Nature of Inexact Numbers- No Notes
- Intermezzo 6: The Nature of Inexact Numbers- No Notes
Changing the State of Variables
- Memory for Functions- No Notes
- Assignment to Variables- No Notes
- Designing Functions with Memory- No Notes
- Examples of Memory Usage- No Notes
Intermezzo 7: The Final Syntax and Semantics- No Notes
- Intermezzo 7: The Final Syntax and Semantics- No Notes
Changing Compound Values- No Notes
- Encapsulation- No Notes
- Mutable Structures- No Notes
- Designing Functions that Change Structures- No Notes
- Equality- No Notes
- Changing Structures, Vectors, and Objects- No Notes
Appendix
About this document ...

PLT