CS383 Programming Languages

Course Summary

A small number of concepts underline the hundreds of programming languages that have been designed and implemented. This course introduces the concepts that serve as a basis for programming languages. It aims to provide the students with a basic understanding and appreciation of the various essential programming language constructs, programming paradigms, evaluation criteria and language implementation issues. The course covers concepts from functional, imperative, object-oriented, logic programming and optionally scripting languages. These concepts are demonstrated by incrementally adding more features to a simple functional language called Lambda Calculus to eventually arrive at a full-fledged, user-friendly general purpose programming language. At the end of the course, a number of modern programming languages from various paradigms are presented as examples.

Latest News and Announcements

Administrative Information

Lectures: Mon, Wed, Fri 10:00-11:40, Dongxiayuan 400.

Instructor: Kenny Zhu - SEIEE 03-541 Phone: 3420-4592 Email: kzhu[at]cs[dot]sjtu[dot]edu[dot]cn
Office hours: by appointment via email or ask after class

Teaching Assistant: Xusheng Luo
Email: freefish_6174[at]126[dot]com
Office hours: Thu 16:00-17:00

Reference Textbooks:

  1. Programming Languages Principles and Paradigms by Allen Tucker and Robert Noonan, McGraw Hill / 2009-5-1 (Also published by Tsinghua University Press and available at the University Textbook Office).
  2. Practical Foundations for Programming Languages by Robert Harper, Cambridge University Press.
  3. Types and Programming Languages by Benjamin C. Pierce, The MIT Press.
  4. Programming Languages: Application and Interpretation by Shriram Krishnamurthi, Brown, Online.


  1. In-class quizzes: 10%
  2. Tutorial participation: 5%
  3. Assignments: 30-40%
  4. Project: 25% Project Website
  5. Exam (in-class test): 20-30%


ClassDateTopic SlidesResourcesHomework
19/12/2016 Introduction[pdf] Tucker Ch.1
29/14/2016 Tutorial 1[pdf] Project description
39/18/2016 Inductive Definition and Proofs[pdf] Harper Ch. 1-4 hw1 (pdf) hw1 (tex)
49/19/2016 Untyped Lambda Calculus[pdf] Pierce Ch 5, 8, 9
59/21/2016 Tutorial 2 [pdf] Assignment 1
69/23/2016 Untyped Lambda Calculus (II), Simply-typed Lambda Calculus[pdf] Pierce Ch 5, 8, 9 hw2 (pdf) hw2 (tex)
79/26/2016 Extension to Simply-typed Lambda Calculus (I)[pdf] Pierce Ch. 11
809/28/2016 Extension to Simply-typed Lambda Calculus (II) [pdf] Pierce Ch. 11 hw3 (pdf) hw3 (tex)
909/29/2016 Tutorial 3 [pdf] Assignment 2
1010/9/2016 Going Imperative [pdf] Pierce Ch. 12
1110/10/2016 Memory Management [pdf] Tucker Ch. 11
1210/12/2016 Type Inference (I)[pdf] Pierce Ch. 22, 23 hw4 (pdf) hw4 (tex)
1310/14/2016 Tutorial 4 [pdf] Assignment 3
1410/17/2016 Type Inference (II) [pdf] Pierce Ch. 22, 23
1510/19/2016 Tutorial 5 [pdf] Assignment 4
1610/21/2016 Subtyping [pdf] Pierce Ch. 15 hw5 (pdf) hw5 (tex)
1710/24/2016 Object-Oriented Programming [pdf] Tucker Ch. 14
1810/26/2016 Functional Programming [pdf] Tucker Ch. 14 hw6 (pdf) hw6 (tex)
1910/28/2016 Logic Programming [pdf] Tucker Ch. 15
2010/31/2016 Tutorial 6 [pdf] Assignment 5
2111/02/2016 Tutorial 7 [pdf] Assignment 6 Quiz 1 Quiz 2 Quiz 3 Quiz 4 Quiz 5 Quiz 6
Copyright (c) Kenny Q. Zhu, 2012-2016.