Date | Exercises (before class) | Leader |
---|

9/21 | Preface & Basics | Robby |

9/23 | Up to Basics: mult_1_plus | Josh |

9/26 | Finish Basics | Andy |

9/28 | Basics: Binary numbers | Robby |

9/28 | Basics: Binary cotd | Robby |

10/3 | Lists: alternate, bag_functions, bag_theorem, bag_count_sum (and 1 star exercises you find along the way) | Geoff |

10/5 | Poly: up to (not including) map_rev, which we'll do in class | Burke |

10/7 | Poly: up to (not including) combine_split, which we'll do in class | James |

10/10 | Poly: split_combine (in class) | Casey |

10/12 | Gen: gen_dep_practice as practice; index_after_last_informal in class | Robby |

10/14 | Prop: up to (not including) ev_ev_even, which we'll do in class | Josh |

10/17 | Prop: up to (not including) palindromes, which we'll do in class | Robby |

10/19 | Continued with palindromes | Robby |

10/21 | Continued with palindromes | Andy |

10/26 | Logic.v: up to all_forallb, filter_challenge_2 in class | Geoff |

10/28 | Imp.v: do optimize_0plus_b, optimize_0plus in class | Burke |

11/2 | Imp.v: work on stack_compiler in class together | Robby |

11/4 | Imp.v: continue with stack_compiler in class | Robby |

11/9 | Imp.v: continue with stack_compiler in class | Robby |

11/11 | Imp.v: continue with stack_compiler in class | Robby |

11/16 | Equiv.v: optimize_0plus & CSeq_congruence in class, up to there to prepare | James |

11/18 | Equiv.v: optimize_0plus & CSeq_congruence in class, up to there to prepare | James |

11/23 | Rel.v & Smallstep.v: up to (not including) the declaration "Module Temp4." in Smallstep.v | Robby |

11/28 | Types.v: read up to (not including) the heading ``Progress'' | Robby |

12/2 | Hoare.v: read up to (not including) swap_exercise | Robby |