Skip to topic | Skip to bottom


Home

POPL
POPL.Scheduler1.2 - 05 Nov 2009 - 09:37 - SanderVermolen

Start of topic | Skip to actions

Course Schedule

The schedule is based on 2 lectures of 2 hours and 1 practical session of 4 hours per week. Each week shows the topics that will be discussed, including references to the corresponding chapters of the PLAI book. The schedule also holds references to the assignments you will be working on during the week. The word deadline following the assignment link indicates a deadline for this assignment at the end of the week (Sunday, 12pm sharp). Note that you are free to hand in your assignment earlier.

9 - 15 November

  • General introduction
  • Introduction to scheme
  • Modeling languages (PLAI 1-2)
  • Substitution (PLAI 3)
  • Functions (PLAI 4)
  • Deferring substitution (PLAI 5)

16 - 22 November

  • First-class functions (PLAI 6)
  • Laziness (PLAI 7)

23 - 29 November

  • Implementing laziness (PLAI 8)
  • Recursion (PLAI 9-10)

30 November - 6 December

  • Recursion (PLAI 9-10)
  • State (PLAI 11-14)

7 - 13 December

  • Web programs need continuation passing style
  • Transformation to CPS

14 - 20 December

  • CPS transformation automatically
  • Implementing continuations

4 - 10 January

  • PLT Scheme webserver
  • exam preparation

-- SanderVermolen - 23 Oct 2009


You are here: POPL > Schedule

to top

Copyright © 2003-2017, Software Engineering Research Group, Delft University of Technology, The Netherlands