Scheme Tutorial

Catharina Candolin
candolin@cs.hut.fi

• Contents
• Foreword
  • Acknowledgements
• Introduction
  • The history of Scheme
  • Scheme as a language
  • Scheme in practice
  • Why is Scheme good as an introductory language?
• Getting started
  • Syntax
  • Expressions
  • Define
  • Lambda
  • Let, let* and letrec
    • Let
    • Let*
    • Named let
    • Letrec
• Conditional expressions
  • Conditional expressions using if
  • Conditional expressions using cond
  • Conditional expressions using case
• Logical composition operators
  • and
  • or
  • not
• Quote and quasiquote
  • Quote
  • Quasiquote
• Procedures
  • Recursion
    • Flat recursion
    • Deep recursion
    • Tail recursion
  • The iteration construct do
• Imperative programming
• Data types
  • Numbers
    • Operations on numbers
  • Booleans
    • Operations on booleans
  • Characters
    • Operations on characters
  • Symbols
    • Operations on symbols
  • Strings
    • Operations on strings
  • Pairs and lists
    • Pairs
    • Lists
    • Operations on pairs and lists
  • Vectors
    • Operations on vectors
• Equivalence predicates
  • =
  • eq?
  • eqv?
  • equal?
• Input and output
  • Input and output to files
• A short style guide
  • Procedures and variables
  • Indentation, newlines and spaces
  • Commenting the code
  • The big picture
• Bibliography