Solutions and your handins

DateTopicNotesHomeworkSolution
M
Aug  24
Canceled   
W
  26
Intro, BNFPLAI §1; slidesHW 1available
F
  28
Schemequick-ref  
M
  31
How to Design Programsslides  
W
Sept 2
HW1 presentationsPLAI §2, ae  
F
  4
Binding and substitutionPLAI §3; slidesHW 2available
M
  7
Labor Day   
W
  9
HW2 presentations   
F
  11
First-order functionsPLAI §4; slides, f1waeHW 3available
M
  14
Deferred substitutionPLAI §5; slides, f1wae+ds  
W
  16
First-class functionsPLAI §6; slides, fae, trace  
F
  18
HW3 presentations   
M
  21
Lexical addresses, dynamic scopeslides, cfae  
W
  23
Canceled   
F
  25
Mid-Term 1sample  
M
  28
RecursionPLAI §9; slides, cfHW 4available
W
  30
Implementing recursionPLAI §10; slides, rcfae  
F
Oct 2
HW4 presentations   
M
  5
Lazy evaluationPLAI §7; slides, plai-lazy.plt, examples  
W
  7
Implementing lazinessPLAI §8; slides, cfalHW 5available
F
  9
Encoding with functionsslides  
M
  12
Fall Break   
W
  14
Fall Break   
F
  16
Fall Break   
M
  19
Mutable structuresPLAI §13; slides, bcfaeHW 6available
W
  21
HW5 presentations   
F
  23
Variables, call-by-referencePLAI §14; slides, bmcfae  
M
  26
HW6 presentations   
W
  28
Canceled   
F
  30
Continuation-passing web serverPLAI §15-17; slides, serverHW 7available
M
Nov 2
ContinuationsPLAI §19; slides  
W
  4
Delimited continuationsslides  
F
  6
HW7 presentations   
M
  9
Implementing continuationsPLAI §20; slides, kcfae, stepsHW 8 
W
  11
Compiling an interpreter; GCslides, slides, PLAI §21, sources  
F
  13
TypesPLAI §24-26; slides  
M
  16
HW8 presentations   
W
  18
Canceled   
F
  20
Mid-Term 2sample  
M
  23
PLAI Typedplai-typed, demo, kcfae-t  
W
  25
Type checkingPLAI §25-26; slides, tfae-tHW 9 
F
  27
Thanksgiving   
M
  30
Types and recursionPLAI §26-27; slides; trcfae-t; tvrcfae-t  
W
Dec 2
Objects and classesslides; cae-t  
F
  4
Subclasses and type checkingslides; ticae-tHW 10 
M
  7
Type soundness and inferencePLAI §28, 30; slides; tifae-t  
W
  9
PolymorphismPLAI §29, 31; slides  
F
  11