Programming-Language Concepts (CS2104)

• Updates
• Lecture Notes, Week 03
  • The Scheme programming language
  • Exercises for Week 03
  • Index of concepts for Week 03
• Lecture Notes, Week 04
  • Unit tests
  • From divergence to primitive iteration and primitive recursion
  • Pairs, binary trees, and lists
  • The Scheme programming language, continued
  • Unit tests, revisited
  • Exercises for Week 04
  • Index of concepts for Week 04
• Lecture Notes, Week 05
  • The Scheme programming language, continued further
  • Defensive programming
  • Sets as lists
  • Exercises for Week 05
  • Index of concepts for Week 05
• Lecture Notes, Week 07
  • Detecting cycles in Scheme values
• Lecture Notes, Week 08
  • Arithmetic expressions
  • Random numbers in Chez Scheme
  • Environments
  • Language processors for Boolean expressions
• Midterm project
  • Expectations about the midterm project
  • Towards a syntax checker for an extended subset of Scheme
  • A self-applicable syntax checker for a subset of Scheme
  • A syntax checker for an extended subset of Scheme, logically
• Lecture Notes, Week 10
  • A syntax checker for a basic imperative language
  • On designing programming languages
• Lecture Notes, Week 11
  • Matching regular expressions
  • Exercises for Week 11
• Lecture Notes, Week 12
  • Evaluation order
  • Compiled regular expressions
  • Exercises for Week 12
• Tools
  • GNU Emacs
  • Chez Scheme
• Dramatis Personæ
  • In real life (Computer Science)
  • In real life (before Computer Science)
  • In real life (outside Computer Science)
  • Fictional (main characters)
  • Fictional (recurring)
  • Fictional (others)
  • Version
• Overall postlude