# Lecture Notes # [[Week1]] (13 Sept) Applications; Basics of Lambda Calculus; Comparing Different Languages [[Week2]] (20 Sept) Reduction and Convertibility; Combinators; Evaluation Strategies and Normalization; Decidability; Lists and Numbers Week3 (27 Sept) Recursion with Fixed Point Combinators Introducing the notion of a "continuation", which technique we'll now already have used a few times # Still To Come # This is very sketchy at this point, but it should give a sense of our intended scope. ## Types ## 1. Product or record types, e.g. pairs and triples 2. Sum or variant types; tagged or "disjoint" unions 3. Maybe/option types; representing "out-of-band" values 4. Zero/bottom types 5. Unit type 6. Inductive types (numbers, lists) 7. "Pattern-matching" or type unpacking

8. The simply-typed lambda calculus

9. Parametric polymorphism, System F, "type inference"

10. [Phil/ling application] inner/outer domain semantics for positive free logic

11. [Phil/ling application] King vs Schiffer in King 2007, pp 103ff. [which paper?](http://rci.rutgers.edu/~jeffreck/pub.php) 12. [Phil/ling application] King and Pryor on that clauses, predicates vs singular property-designators 13. Possible excursion: [Frege's "On Concept and Object"](http://www.persiangig.com/pages/download/?dl=http://sahmir.persiangig.com/document/Frege%27s%20Articles/On%20Concept%20And%20object%20%28Jstore%29.pdf)

14. Curry-Howard isomorphism between simply-typed lambda and intuitionistic propositional logic

15. The types of continuations; continuations as first-class values 16. [Phil/ling application] Partee on whether NPs should be uniformly interpreted as generalized quantifiers, or instead "lifted" when necessary. Lifting = a CPS transform. 17. [Phil/ling application] Expletives