X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=schedule_of_topics.mdwn;h=b784a9f371420332e97f5d1788a248ddf057345a;hp=f8e054e4347d1ca29c65294434c1daf8e87500ef;hb=b6e49b6bb965279c0af74175c3462787ca0a55a6;hpb=24275ff28f0aab1b25c7d90ec10b1119dfda4acf diff --git a/schedule_of_topics.mdwn b/schedule_of_topics.mdwn index f8e054e4..b784a9f3 100644 --- a/schedule_of_topics.mdwn +++ b/schedule_of_topics.mdwn @@ -13,26 +13,24 @@ This is very sketchy at this point, but it should give a sense of our intended s ## The "pure" or untyped lambda calculus ## 1. Beta reduction -2. Substitution; using alpha-conversion and other strategies -3. Conversion versus Reduction -4. Eta reduction and "extensionality" -5. Different evaluation strategies (call by name, call by value, etc.) -6. Strongly normalizing vs weakly normalizing vs non-normalizing; Church-Rosser Theorem(s) - -7. Encoding pairs (and triples and ...) -8. Encoding booleans -9. Church-like encodings of numbers, defining addition and multiplication -10. Defining the predecessor function; alternate encodings for the numbers -11. Homogeneous sequences or "lists"; how they differ from pairs, triples, etc. -12. Representing lists as pairs -13. Representing lists as folds -14. Typical higher-order functions: map, filter, fold - -15. Recursion exploiting the fold-like representation of numbers and lists (deforestation, zippers) -16. General recursion using omega -17. The Y combinator(s); more on evaluation strategies - -18. Introducing the notion of a "continuation", which technique we'll now already have used a few times +1. Substitution; using alpha-conversion and other strategies +1. Conversion versus reduction +1. Eta reduction and "extensionality" +1. Different evaluation strategies (call by name, call by value, etc.) +1. Strongly normalizing vs weakly normalizing vs non-normalizing; Church-Rosser Theorem(s) +1. Lambda calculus compared to combinatorial logic

+1. Encoding pairs (and triples and ...) +1. Encoding booleans +1. Church-like encodings of numbers, defining addition and multiplication +1. Defining the predecessor function; alternate encodings for the numbers +1. Homogeneous sequences or "lists"; how they differ from pairs, triples, etc. +1. Representing lists as pairs +1. Representing lists as folds +1. Typical higher-order functions: map, filter, fold

+1. Recursion exploiting the fold-like representation of numbers and lists ([[!wikipedia Deforestation (computer science)]], [[!wikipedia Zipper (data structure)]]) +1. General recursion using omega +1. The Y combinator(s); more on evaluation strategies

+1. Introducing the notion of a "continuation", which technique we'll now already have used a few times ## Types ## @@ -51,9 +49,9 @@ This is very sketchy at this point, but it should give a sense of our intended s 10. [Phil/ling application] inner/outer domain semantics for positive free logic -11. [Phil/ling application] King vs Schiffer in King 2007, pp 103ff. +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" +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 @@ -62,16 +60,16 @@ This is very sketchy at this point, but it should give a sense of our intended s 17. [Phil/ling application] Expletives 18. Some references: - * de Groote on the lambda-mu calculus in linguistics - * on donkey anaphora and continuations - * Wadler on symmetric sequent calculi + * [de Groote on the lambda-mu calculus in linguistics](http://www.loria.fr/%7Edegroote/papers/amsterdam01.pdf) + * [on donkey anaphora and continuations](http://dx.doi.org/10.3765/sp.1.1) + * [Wadler on symmetric sequent calculi](http://homepages.inf.ed.ac.uk/wadler/papers/dual-reloaded/dual-reloaded.pdf) 19. Dependent types ## Side-effects and mutation ## 1. What difference imperativity makes -2. Monads we've seen, and the "monadic laws" (computer science version) +2. Monads we've already seen, and the "monadic laws" [computer science version: Wadler](http://homepages.inf.ed.ac.uk/wadler/papers/marktoberdorf/baastad.pdf) 3. Side-effects in a purely functional setting, via monads 4. The basis of monads in category theory 5. Other interesting monads: reader monad, continuation monad @@ -80,7 +78,7 @@ This is very sketchy at this point, but it should give a sense of our intended s 7. Montague / Ben-avi and Winter, [A modular approach to intensionality](http://citeseerx.ist.psu.edu/viewdocsummary?doi=10.1.1.73.6927) 8. Passing by reference -9. [Phil/ling application] Fine and Pryor on "coordinated contents" (see, e.g., [Hyper-Evaluativity](http://www.jimpryor.net/research/papers/Hyper-Evaluativity.txt) +9. [Phil/ling application] Fine and Pryor on "coordinated contents" (see, e.g., [Hyper-Evaluativity](http://www.jimpryor.net/research/papers/Hyper-Evaluativity.txt)) ## Continuations (continued) ## @@ -88,8 +86,7 @@ This is very sketchy at this point, but it should give a sense of our intended s 2. Using CPS to do other handy things, e.g., coroutines 3. Making evaluation order explicit with continuations (could also be done earlier, but I think will be helpful to do after we've encountered mutation) 4. Delimited (quantifier scope) vs undelimited (expressives, presupposition) continuations -5. [Phil/ling application] Barker/Shan on donkey anaphora - +5. [Phil/ling application] [Barker/Shan on donkey anaphora](http://dx.doi.org/10.3765/sp.1.1) ## Preemptively parallel computing and linear logic ##