Week

Due

Tuesday

Thursday

1/28

What is a Compiler?

From OCaml to Racket (slides)

2/4

A1

From OCaml to Racket (cont.)

• Abscond: a language of numbers(slides)

• Blackmail: incrementing and decrementing(slides)

2/11

A2

Con: branching with conditionals (slides)

Dupe: a duplicity of types (slides)

2/18

A3

Extort: when errors exist (slides)

Fraud: local binding and variables

2/25

Grift: binary operations (slides)

Grift: binary operations (cont.)(slides)

3/3

A4

Hustle: heaps and lists (slides)

Hustle: heaps and lists (cont.)

3/10

M1

No lecture (exam)

Overview of Exam Question 5

3/17

Spring Break

3/24

Global Pandemic

3/31

Discussion of new Roadmap

Iniquity: function definitions and calls

4/7

Iniquity: function definitions and calls (cont.)

Jig: jumping to tail calls

4/14

Knock: first-class function (pointers)

Quiz

4/21

A5

Loot: lambda the ultimate

Loot: lambda the ultimate (cont.)

4/28

M2

Review

No lecture (exam)

5/5

Either FFI or Dyanmic Values

Either FFI or Dyanmic Values

5/12

Garbage Collection, briefly

No class