|
These lecture notes are provided as a reference (my own personal lecture-prep). They are not intended as a substitute for attending class.
date | lecture notes | reading | hw |
---|---|---|---|
week 1 | |||
Aug.27 | languages steer programmer choices | §§1.0–1.3 (pp.5–16); | |
Aug.29 | racket intro | §10.3.0 (pp. 509–512) | |
week 2 | |||
Sep.03 | The Design Recipe: unit-tests (pizza-area) | hw01, on D2L | |
Sep.05 | Union types (and, | ||
week 3 | |||
Sep.10 | Union types: further examples incl. numeric intervals; use helpers for union-of-unions | hw02/ | |
Sep.12 | language-vocab-and-concepts/ | §1.6.1, and skim the rest of Chpt.1 (§1.4–1.7). | |
week 4 | |||
Sep.17 | start structs intro | hw03/ | |
Sep.19 | Finish structs intro; Design exercise: a GUI textbox | ||
week 5 | |||
Sep.24 | Structs within structs (easter-egg textbox) | ||
Sep.26 | union of structs (book-or-dvd) | hw04/ | |
week 6 | |||
Oct.01 | list introduction | §6.6, and §10.1–10.3.1. | |
Oct.03 | hw05a (2 problems) | ||
week 7 | |||
Oct.08 | A non-list example of recursive data, stepping through a recursive function | lists.html | |
Oct.10 | exam01 | ||
week 8 | |||
Oct.15 | Tail recursion ( | §2.1: Grammars | |
Oct.17 | intro grammars/BNF; practice: grammar for field-declarations | ||
week 9 | |||
Oct.22 | discuss hw06-soln (incl. hex vs. binary); | hw06: grammars | |
Oct.24 | passing-functions-before.rkt (and passing-functions-after.rkt as completed in class) | ||
week10 | |||
Oct.29 | ancestor-tree-before.rkt (video (32m23s)) (and ancestor-tree-after.rkt as completed in class) | ||
Oct.🎃 | video: defining ancestor trees in Java (14m41s) (composite pattern),
Optional: AncTrees in scala (code, video). | ||
week11 | |||
Nov.05 | Decide on our language's
U0 syntax and internal representation of Exprs/parse-trees; | ||
Nov.07 | Look at U0.rkt:
data-def'n for an expression,
examples of the data,
test cases for | ||
week12 | |||
Nov.12 | explaining the code
(incl. recursive-descent parsing, and (optionally) some of the tricks used in the accompanying test-harness).
See the videos at the bottom of Interpreting U. | ||
Nov.14 | scope-simple-examples.rkt; | §3.3, but you can skim §§3.3.4-3.3.5. | AncTrees and Expr Trees |
week13 | |||
Nov.19 | prolog practice; | Scott Chpt.11, but skip §11.2.6 | |
Nov.21 | Review U4-soln; | §3.6 (“the binding of referencing environments”) | U4 shadowing, function-application; prolog |
thanksgiving
br eak | |||
week14 | |||
Dec.03 | Finish lists in prolog.
Possible: sorts.pl, and/or numbers in prolog | ||
Dec.05 | Finish looking at: implementing objects-with-let-over-lambda.rkt (pretty much). Wrap-up | U6: environments | |
finals week | |||
May.07 (Tue) 14:45 | final exam | [0,∞) :-) |
Opening notes in .rkt files: Many of the lecture-notes links are .rkt files, not html. You should (a) download the file (say, via right-click or save-as; on Windows you might need to re-name the suffix to .rkt manually), (b) start DrRacket, and then (c) choose File » Open… them. Do not copy-paste into an empty DrRacket window — the language-preference won't be set correctly, and the initial lines may be goofed up. One possible result is the error message read-syntax: `#lang` not enabled.
This page licensed CC-BY 4.0 Ian Barland Page last generated | Please mail any suggestions (incl. typos, broken links) to ibarlandradford.edu |