Tentative Schedule for Summer 2007

Week 1:  Define a sequentially allocated cons cell heap and create all structure definitions and header files need to express all data types in a single cons cell

Week 2- 3:  Set up application and memory location assignments, create a simple parser to simulate evaluation (scheme's stucture permits very simple parsing).

Week 4- 6:  Creation of simple primitives to test evaluation, +, -, and quote.  Create structure of environments.  With simple parsing and environments in place, next comes rough code of let, letrec, and lambda

MIDTERM (around there somewhere)

Week 7- 9:  Continue adding primitives while testing real heap usage for small functions.  Create a scheme for reclaiming heap space -- either by dynamically releasing after they fall out of scope or a full garbage collector.

Week 10-12: Provide a means for editing programs on the calculator, while continuing to tune up heap (perhaps confer with other interpreter writers for editor options)