CIS 352   —   SPRING 2008

Programming Languages: Theory and Practice

News

• Exam 3 papers and answers
  You can pick up your Exam 3 papers in CST 3-106.

  The answers to Exam 3a and Exam 3b are available here.
  Posted: Mon 5 May 2008 11:08:45 EDT

• Old news

Homeworks

• Homework 1:   Due Friday, January 25.
• Homework 2:   Due Friday, February 1.
• Homework 3:   Due Friday, February 15.
• Homework 4:   Due Friday, February 22.
• Homework 5:   Due Friday, February 29.
• Homework 6:   Due Friday, March 7.
• Homework 7:   Due Friday, March 21.
• Homework 8:   Due Friday, April 4.
• Homework 9:   Due Friday, April 11.
• Homework 10:   Due Friday, April 18.     Here is hw10.scm.

Labs

• Lab 1:   Due Noon, Friday January 18.
• Lab 2:   Due Noon, Friday January 25.
• Lab 3:   Due Noon, Friday February 1.
• Lab 4:   Due Noon, Friday February 8.
• Lab 5:   Due Noon, Friday February 22.
• Lab 6:   Due Noon, Friday February 29.
  You will need your copy of EOPL for this lab.

Exams

• Exam 1: Thursday, February 14.   [Scope/Practice]   [Answers: e1ans.scm]
• Exam 2: Thursday, March 27.   [Scope/Practice]   [Answers: e2.scm]
• Exam 3: Tuesday, April 29.   [Scope/Practice]  
• Final Exam: Tuesday May 6.
      The exam will be in our usual classroom from 12:30pm to 2:30pm.       ⇐ corrected time and date

Support

• Code and transcripts from lectures
  • Jan 15 — the bare beginnings of Scheme
  • Jan 17 — Lists
  • Jan 22 — BNF, recursive data structures, a start on s-expressions.
  • Jan 24 — S-expressions, procedures (with arbitrary number of parameters, higher type, etc), vectors, and local variables.
  • Jan 29 — local variables (let and letrec), hello to the lambda calculus, free and bound variables, lexical scoping, lexical addresses.
  • Jan 31 — define-datatype, parsing, unparsing, substitution.
  • Feb 5 — Substitution, substitution, and more substitution. Also, alpha-reductions and beta-reductions
    Handout: The Lambda-Calculus Overview by Susan Older
  • Feb 7 — Alpha-reductions and beta-reductions. Normal and applicative evaluation.
  • Feb 19 — Finishing up the lambda calculus
  • Feb 21 — Introduction to the basic framework for the rest of the course
  • Feb 26 — The basic interpreter through let expressions
  • Feb 28 — Handling procedures, part 1.
  • Mar 4 — Handling procedures, part 2; lexical and dynamic scoping
  • Mar 6 — A bit more on dynamic scoping, some pleasures and puzzles of sharing memory
  • Mar 18 — a collective quiz and implementing recursion
  • Mar 20 — a bit more about letrec and a start at implementing assignment
  • Mar 25 — a more on references
  • Apr 1 — call-by-reference parameter passing
  • Apr 3 — call-by-(name | need | value-result) parameter passing
  • Apr 8 — a start on continuations (Chapter 7 in EOPL)
  • Apr 10 — more on continuations (Chapter 7 in EOPL)
  • Apr 15 — defunctionalized continuation and exception handling
  • Apr 17 — a multi-threaded language
  • Apr 24 — threads, locks, and mutual exclusion
• Basic tools
  • Textbook Pages  
  • Course tools  
  • Almost all the Scheme code from EOPL
  • schemers.org  
  • R⁵RS
• Miscellaneous
  • Why, oh why, do we have to learn these strange programming languages?
  • Lambda-Calculus Overview

Administrivia

• Course syllabus
• Honor Policy
• Homework and Lab Policy
• Summary of administrative details, including:
  • Instructor info
  • TA info
  • When & where
  • Texts
  • Coursework (e.g., grades)

Dates

First class	Tuesday	January 15
Last day to add a course	Tuesday	January 22
Financial drop deadline	Monday	February 4
Academic drop deadline	Tuesday	March 18
Spring break - no classes	Sat-Sun	March 8–16
Withdrawal deadline	Tuesday	April 15
Mayfest - no classes	Tuesday	April 22
Last class	Tuesday	April 29