Solutions and your handins

DateTopicNotesHomeworkSolution
W
Aug  24
Intro, BNFPLAI §1; slidesHW 1available
F
  26
Schemequick-ref.scm  
M
  29
InterpretersPLAI §2; slides  
W
  31
Identifier bindingPLAI §3; slidesHW 2available
F
Sept  2
First-order functionsPLAI §4; slides  
M
  5
Labor Day   
W
  7
HW 2 presentations   
F
  9
EnvironmentsPLAI §5; slidesHW 3available
M
  12
Functions as valuesPLAI §6; slides  
W
  14
Lexical addresses, dynamic scopeslidesHW 4available
F
  16
RecursionPLAI §8; slides  
M
  19
Recursive environmentsPLAI §9; slides  
W
  21
HW 4 presentations HW 5available
F
  23
Class Cancelled   
M
  26
Encoding with Functionsslides, lc.ss  
W
  28
Mid-Term 1sample  
F
  30
Lazy evaluationPLAI §10; slides, code  
M
Oct  3
Implementing lazy evaluationPLAI §11; slides  
W
  5
HW 5 presentations HW 6available
F
  7
Fall Break   
M
  10
State, call-by-referencePLAI §12-14; slides  
W
  12
Web server and CPSPLAI §15-17; slides, server.ss  
F
  14
HW 6 presentations HW 7available
M
  17
Parsing and CPSsuccess-fail-k.zip  
W
  19
Class Cancelled   
F
  21
HW 7 presentations   
M
  24
Let/ccPLAI §19; slides, server2.ss  
W
  26
Implementing continuationsPLAI §20; slides, letcc.scmHW 8available
F
  28
Compiling an InterpreterPLAI §21-22; slides, comp-interp.zip  
M
  31
Garbage collectionPLAI §23; slides, gc.zip  
W
Nov  2
HW 8 presentationsmt2-review.txtMid-Term 2 
F
  4
TypesPLAI §26-27; slides  
M
  7
Camltutorial, caml-demo.txt; slides  
W
  9
Types and recursionPLAI §28-29; slidesHW 9available
F
  11
Type soundness and inferencePLAI §30, 32; slides  
M
  14
PolymorphismPLAI §29, 31; slides  
W
  16
HW 9 presentations HW 10available
F
  18
Classes and objectsslides  
M
  21
Inheritance and type checkingslides  
W
  22
HW 10 presentations HW 11 
F
  25
Thanksgiving   
M
  28
Compiling classesslides  
W
  30
Super and innerslides  
F
Dec  2
HW 11 presentations   
M
  5
HW 11 presentationsex.ml  
W
  7
HW 11 presentations   

Final Exam  Tuesday, December 13, 10:30-12:30