Solutions and your handins

DateTopicNotesHomeworkSolution
T
Aug  24
RacketPLAI §1, slides, quick refHW 0available
Th
  26
How to Design ProgramsslidesHW 1available
T
  31
Arithmetic, binding, substitutionPLAI §2-3, slides, ae, wae  
Th
Sept  2
First-order functionsPLAI §4, slides, f1waeHW 2available
T
  7
Deferred substitutionPLAI §5, slides, f1wae-ds  
Th
  9
Compilation and lexical scopeslides, cf1waeHW 3available
T
  14
First-class functionsPLAI §6, slides, fae, trace  
Th
  16
Dynamic scope, recursionPLAI §9, slides, cfaeHW 4available
T
  21
Encodings, metacircular recursionslides, frfae  
Th
  23
Implementing recursionPLAI §10, slides, rcfaeHW 5available
T
  28
Mid-Term 1sample  
Th
  30
Lazy evaluationPLAI §7-8, slides, plai-lazy, cfalHW 6available
T
Oct  5
Mutable structuresPLAI §13, slides, bcfae  
Th
  7
VariablesPLAI §14, slides, bmcfaeHW 7available
T
  12
Fall break   
Th
  14
Fall break   
T
  19
Store-passing practice(code in class only)  
Th
  21
Canceled HW 8available
T
  26
Continuation-passing stylePLAI §15-18, slides, server  
Th
  28
ContinuationsPLAI §19, slidesHW 9available
T
Nov  2
Implementing continuationsPLAI §20, slides, kcfae, delim  
Th
  4
Compiling an interpreterslides, codeHW 10available
T
  9
Garbage collectionslides, gc  
Th
  11
Mid-Term 2sample(none) 
T
  16
TypesPLAI §24-26, slides  
Th
  18
Type CheckingPLAI §25-26, slides, plai-typed, demo, kcfae-t, tfae-tHW 11 
T
  23
Objects and classesslides, cae-t  
Th
  25
Thanksgiving   
T
  30
Subclasses and type checkingslides, ticae-tHW 12 
Th
Dec  2
Types and recursionPLAI §26-27; slides, trcfae-t, tvrcfae-t  
T
Dec  7
Type soundness and inferencePLAI §28, 30; slides; tifae-t  
Th
Dec  9
PolymorphismPLAI §29, 31, slides