|
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 | |||
Jan.17 | languages steer programmer choices (zoom-recording) | §§1.0–1.3 (pp.5–16); | |
Jan.19 | racket-intro.html;The Design Recipe: unit-tests (pizza-area) | §11.3.0 (pp. 539–542) | |
week 2 | |||
Jan.24 | Another ex. of design recipe; refactoring (monogram) |
||
Jan.26 | Union types |
video: Union types (18m05s) and video: part II (28m24s) (videos only have signatures in comments though) | |
week 3 | |||
Jan.31 | language-vocab-and-concepts/ | §1.6.1, and skim the rest of Chpt.1 (§1.4–1.7). | |
Feb.02 | struct-intro.html |
first two videos of struct-intro.html (~35min) | |
week 4 | |||
Feb.07 | Design exercise: a GUI textbox |
||
Feb.09 | union of structs (book-or-dvd) |
||
week 5 | |||
Feb.♥ | list: a datatype-definition; |
§6.6, and §10.1–10.3.1. recording | |
Feb.16 | |||
week 6 | |||
Feb.21 | using let to avoid repeated-computation |
recording | |
Feb.23 | another union-of-struct recipe example: Ancestor Trees |
class: recording | |
week 7 | |||
Feb.28 | Language families video (32m23s), and video: defining trees in Java (14m41s) (composite pattern), |
||
Mar.02 | data-def'n for natnums a nonsense example;; AncTree.java: video: writing size, and template (17m12s); video: writing changeName (14m22s) |
||
spring 🌷 br eak | |||
week 8 | |||
Mar.14 | reflect on immutable-data-trade-offs.html; lists.html solution; language-vocab-and-concepts/ | ||
Mar.16 | exam01 | ||
week 9 | |||
Mar.21 | passing functions as arguments: |
||
Mar.23 | tail recursion (a practice problem: tail-recursion-sum-2^i.html) |
video (24m15s)recording | |
week10 | |||
Mar.28 | grammars-intro.html; practice: grammar for field-declarations | §2.1: Grammars | |
Mar.30 | finish grammars, and parse trees | ||
week11 | |||
Apr.04 | Decide on our language's D0 syntax and internal representation of Exprs/parse-trees; | recording | |
Apr.06 | Look at D0.rkt: data-def'n for an expression, examples of the data, and tests+code for eval, expr->string, and recursive-descent parse!ing. | ||
week12 | |||
Apr.11 | the law-of-racket.rkt recording (start at 11m45 for the new material) D0 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 B0, but otherwise it's identical. |
§3.3, but you can skim §§3.3.4-3.3.5. | |
Apr.13 | Prolog intro recording (file |
Scott Chpt.11, but skip §11.2.6 recording | |
week13 | |||
Apr.18 | prolog-recursion.html; prolog-lists.html | §3.6 (“the binding of referencing environments”) recording | |
Apr.20 | sorting in prolog |
||
week14 | |||
Apr.25 | objects-with-let-over-lambda.rkt (pretty much). | ||
Apr.27 | using a macro ~>, more on Higher Order Functions |
D6.html | |
finals week | |||
May.02 | 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 |