Lecture Notes, Week 03

• The Scheme programming language
  • Goal
  • Resources
  • Our programming language of discourse, Scheme
  • Infix, prefix, and postfix operators
  • A BNF for pure Scheme
  • Scheme comments
  • This chapter
  • Interlude #0
  • Ground expressions: numbers
  • Ground expressions: Booleans
  • Ground expressions: characters
  • Interlude #1
  • Ground expressions: strings
  • Interlude #2
  • Chez Scheme core special form: time
  • Interlude #3
  • Core special form: if
  • Interlude #4
  • Derived special form: and
  • Interlude #5
  • Exercise 01
  • Derived special form: or
  • Core special forms: define
  • Core special form: lambda-abstractions with fixed arity
  • Core special form: lambda-abstractions with non-fixed arity
  • Predefined procedures
  • Core special form: applications
  • Interlude #6
  • Exercise 02
  • Solution for Exercise 02
  • Exercise 03
  • Order of evaluation for actual parameters
  • Dynamic definitions and redefinitions
  • Chez Scheme core special form: trace-lambda
  • Predefined type predicates
  • Interlude #7
  • Predefined type predicates, continued
  • Interlude #7, continued
  • Predefined procedures over numbers
  • Exercise 04
  • Predefined procedures over Booleans
  • Exercise 05
  • Exercise 06
  • Predefined procedures over characters
  • Predefined procedures over strings
  • Interlude #8
  • Exercise 07
  • Equality of Scheme values
  • Interlude #9
  • Exercise 08
  • Exercise 09
  • Exercise 10
  • Exercise 11
  • Exercise 12
  • Postlude about making errors
  • Postlude about divergence
  • Postlude about the end of the world
  • Resources
  • Version
• Exercises for Week 03
  • Exercise 00
  • Mandatory exercises
  • Optional exercises
  • Version
• Index of concepts for Week 03
  • Version