How to Design Programs: DrScheme Companion

Matthias Felleisen
Robert Bruce Findler
Matthew Flatt
Shriram Krishnamurthi

Rice University
Houston, Texas

January 16, 2001








DRAFT

   Copyright ©1997-2001 Felleisen, Findler, Flatt, Krishnamurthi  

The corrected version of this edition is available on-line. This contains several error fixes—please use that version rather than this one.

• Contents
• DrScheme Setup
  • Getting Started with DrScheme
    • DrScheme vs. DrScheme Jr
    • Getting DrScheme or DrScheme Jr
    • Installing and Starting DrScheme or DrScheme Jr
      • Windows 95/98/NT/2000
      • Macintosh
      • Unix/X Window System
    • Preparing DrScheme
    • Preparing DrScheme Jr
• Processing Simple Forms of Data
  • Students, Teachers, and Computers - No Notes
  • 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 Functions
    • Booleans and Relations
    • Functions that Test Conditions
    • Conditionals and Conditional Functions
    • Designing Conditional Functions - No Notes
  • Symbolic Information
    • Finger Exercises with Symbols
  • Compound Data, Part 1: Structures
    • Structures
    • Extended Exercise: Drawing Simple Pictures
    • Structure Definitions
    • Data Definitions
    • Designing Functions for Compound Data - No Notes
    • Extended Exercise: Moving Circles and Rectangles
    • Extended Exercise: Hangman
  • The Varieties of Data - No Notes
• Intermezzo 1
  • Syntax and Semantics
    • The Scheme Vocabulary - No Notes
    • The Scheme Grammar
    • The Meaning of Scheme
    • Errors - No Notes
    • Boolean Expressions - No Notes
    • Variable Definitions - No Notes
    • Structure Definitions - No Notes
• Processing Arbitrarily Large Data
  • Compound Data, Part 2: Lists
    • Lists
    • Data Definitions for Lists of Arbitrary Length - No Notes
    • Processing Lists of Arbitrary Length
    • Designing Functions for Self-Referential Data Definitions - No Notes
    • More on Processing Simple Lists - No Notes
  • More on Processing Lists
    • Functions that Produce Lists
    • Lists that Contain Structures - No Notes
    • Extended Exercise: Moving Pictures - No Notes
  • Natural Numbers - No Notes
  • Composing Functions, Revisited Again - No Notes
• Intermezzo 2
  • List Abbreviations
• More on Processing Arbitrarily Large Data - No Notes
• Intermezzo 3
  • Local Definitions and Lexical Scope
  • Organizing Programs with local - No Notes
  • Lexical Scope and Block Structure
• Abstracting Designs - No Notes
• Intermezzo 4: Defining Functions on the Fly - No Notes
• Generative Recursion - No Notes
• Intermezzo 5: The Cost of Computing and Vectors - No Notes
• Accumulating Knowledge - No Notes
• Intermezzo 6: The Nature of Inexact Numbers - No Notes
• Changing the State of Variables
• Intermezzo 7: The Final Syntax and Semantics - No Notes
• Changing Compound Values - No Notes
• Epilogue
• Appendix
  • Supported Operating Systems and Installation
  • Using DrScheme
  • Memory and Performance
  • Troubleshooting
• About this document ...