Week #1: Tues: Overview, get acquainted with computers and programs. For Thursday, In TSPL: read Section 2.1 and 2.2, and do HW1: exercises 2.2.1, 2.2.2, and 2.2.3.
Thurs: Discuss Sections 2.1 and 2.2. For Tuesday, read 2.3-2.7. Do HW2: exercises: 2.4.1, 2.5.2, and 2.6.2.
Week #2:
Tues: Discuss 2.3-2.7. For Thursday, read 2.8 and 2.9.
Thurs: Discuss 2.8 and 2.9. For Tuesday, read EOPL Chapter 1, sections 1 and 2; do HW3: TSPL problems 2.7.2 (using length), 2.8.5 (without length), 2.8.6, and 2.9.1. Solutions
Week #3: Discuss EOPL Chapter 1, sections 1 and 2. For Thursday, Sept 26, do HW4. For Tuesday, Sept 24, read section EOPL 1.3.
Week #4: Tues: Discuss EOPL 1.3. Thursday: Turn in HW4, and discuss. Assignment HW5 due next Tuesday.
Week #5: Tues: Due HW#5. Discuss Solutions. Read EOPL 2.1-2.2 for Thursday. Thursday: Discuss EOPL Chapter 2.1-2.2. Read EOPL 2.3-2.4 for Tuesday. Source code for Chapter 2 and instructions.
Week #9: Tues: discuss EOPL 3.1, 3.2. For Thursday, do Exercizes 3.5, 3.6, 3.7, 3.10, and 3.11. Read 3.3-3.4, and Appendix A. Thursday: Discuss 3.3-3.4, Appendix A. For next Tuesday, add Conditional eval, Local binding, and Procedures to DaGym; read 3.3-3.5.
Week #10: Tues: Discuss Conditional Eval, Local variables, and Procedures. For Thursday discuss Recursion, Variable assignment. Read EOPL 3.6 and Y-Combinator for Thursday. Thursday: discuss Recursion. For Tuesday: implement recursion in Dagym.
Week #11: Tuesday: discuss recursion. dagym-2.ss source code. For Thursday: examine adding "define" and "letrec" to Dagym. Made changes in class to syntax. See dagym-3.ss for "string" and "load" additions. Here is examples.dg.
Week #12: Due Thursday: "define" and "letrec". Some test examples are here: recursion.dg
