Overview

In this course, we will explore how different programming languages approach computation.

Topics include:

Functions as values (programs as data)
The Backus-Naur Form notation for describing language syntax
Variable scope and binding
Data abstraction
Interpreters
Parameter passing
Type systems
The imperative, functional, object-oriented, and logical paradigms

We will read The Little Schemer first, to introduce you to the syntax and philosophy of the functional Scheme language. All of the assignments in this course (except the final project) will be done in Scheme, which is an excellent language for writing interpreters. As we work through Essentials of Programming Languages (probably chapters 1-7), we will develop interpreters for various kinds of languages. We will see how subtle changes in these interpreters can drastically change the semantics of the interpreted language.

Grading

Due Date	Score	Item
27 Jan	100	Assignment 1
3 Feb	100	Assignment 2
13 Feb	200	Exam 1
17 Feb	100	Assignment 3
24 Feb	100	Assignment 4
2 Mar	100	Assignment 5
12 Mar	200	Exam 2
16 Mar	100	Assignment 6
20-28 Mar		Spring Break
6 Apr	100	Assignment 7
9 Apr	200	Exam 3
15 Apr	100	Assignment 8
27 Apr	300	Final Project
5 May, 8:30-11:30 AM		Final Project Presentations
	1700	Total

See the course policies page for more on grading.

Resources

Dr. Scheme can be downloaded to your own machine
R. Kent Dybvig's The Scheme Programming Language is an excellent reference for Scheme
Paul Graham's essays Revenge of the Nerds and Being Popular are, in fact, about programming languages
Dan Friedman's home page has some interesting stuff, including slides from talks

Peter Drake

Last modified: Tue Apr 27 17:06:50 PDT 2004