|
These lecture notes are provided as a reference (my own personal lecture-prep). They are not intended as a substitute for attending class.
date | topic | reading | |
---|---|---|---|
week 1 | |||
Aug.22 | languages steer programmer choices (zoom-recording) | §§1.0–1.3 (pp.5–16); | |
Aug.24 | racket-intro.html;The Design Recipe: unit-tests (pizza-area) | §11.3.0 (pp. 539–542) | |
week 2 | |||
Aug.29 | Another ex. of design recipe; refactoring (monogram) |
||
Aug.31 | Union types |
video: Union types (18m05s) and video: part II (28m24s) (videos only have signatures in comments though) | |
week 3 | |||
Sep.05 | language-vocab-and-concepts/ | §1.6.1, and skim the rest of Chpt.1 (§1.4–1.7). | |
Sep.07 | struct-intro.html |
first two videos of struct-intro.html (~35min) | |
week 4 | |||
Sep.12 | Design exercise: a GUI textbox |
||
Sep.14 | union of structs (book-or-dvd) |
||
week 5 | |||
Sep.19 | list: a datatype-definition; |
§6.6, and §10.1–10.3.1. recording | |
Sep.21 | |||
week 6 | |||
Sep.26 | using let to avoid repeated-computation |
recording | |
Sep.28 | another union-of-struct recipe example: Ancestor Trees |
class: recording | |
week 7 | |||
Oct.03 | Language families video (32m23s), and video: defining trees in Java (14m41s) (composite pattern), |
||
Oct.05 | data-def'n for natnums a nonsense example;; AncTree.java: video: writing size, and template (17m12s); video: writing changeName (14m22s) |
||
week 8 | |||
Oct.10 | reflect on immutable-data-trade-offs.html; lists.html solution; language-vocab-and-concepts/ | ||
Oct.12 | exam01 | ||
week 9 | |||
Oct.17 | passing functions as arguments: |
||
Oct.19 | tail recursion (a practice problem: tail-recursion-sum-2^i.html) |
video (24m15s)recording | |
week10 | |||
Oct.24 | grammars-intro.html; practice: grammar for field-declarations | §2.1: Grammars | |
Oct.26 | finish grammars, and parse trees | ||
week11 | |||
Oct.🎃 | Decide on our language's E0 syntax and internal representation of Exprs/parse-trees; | recording | |
Nov.02 | Look at E0.rkt: data-def'n for an expression, examples of the data, and tests+code for eval, expr->string, and recursive-descent parse!ing. | ||
week12 | |||
Nov.07 | the law-of-racket.rkt recording (start at 11m45 for the new material) E0 test harness, both in racket video (14m14s)and (slightly more involved and less flexible) in Java video (8m08s) Note: These test-harness videos are from a different semester's language, so the exact examples will be different from @L0, but otherwise it's identical. |
§3.3, but you can skim §§3.3.4-3.3.5. | |
Nov.09 | Prolog intro recording (file |
Scott Chpt.11, but skip §11.2.6 recording | |
week13 | |||
Nov.14 | prolog-recursion.html; prolog-lists.html | §3.6 (“the binding of referencing environments”) recording | |
Nov.16 | sorting in prolog |
||
thanksgiving br eak | |||
week14 | |||
Nov.28 | objects-with-let-over-lambda.rkt (pretty much). | ||
Nov.30 | using a macro ~>, more on Higher Order Functions |
E6.html | |
finals week | |||
Dec.07 | 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 |