1 # Seminar in Semantics / Philosophy of Language #
3 or: **What Philosophers and Linguists Can Learn From Theoretical Computer Science But Didn't Know To Ask**
5 This course will be co-taught by [Chris Barker](http://homepages.nyu.edu/~cb125/) and [Jim Pryor](http://www.jimpryor.net/). Linguistics calls it "G61.3340-002" and Philosophy calls it "G83.2296-001."
10 The seminar meets on Mondays, starting September 13, from 4-6.
11 The first meeting will be in the Linguistics building at 10 Washington Place on the first floor (room 104).
12 (Earlier, we were going to meet in the 2nd floor Philosophy Seminar Room, at 5
13 Washington Place, but there were conflicts.) We may be able to shift the time around slightly to suit the
14 schedule of participants; but it will remain on Mondays late
21 The goal of this seminar is to introduce concepts and techniques from
22 theoretical computer science and show how they can provide insight
23 into established philosophical and linguistic problems.
25 This is not a seminar about any particular technology or software.
26 Rather, it's about a variety of conceptual/logical ideas that have been
27 developed in computer science and that linguists and philosophers ought to
28 know, or may already be unknowingly trying to reinvent.
30 Philosphers and linguists tend to reuse the same familiar tools in
31 ever more (sometime spectacularly) creative ways. But when your only
32 hammer is classical logic, every problem looks like modus ponens. In
33 contrast, computer scientists have invested considerable ingenuity in
34 studying tool design, and have made remarkable progress.
36 "Why shouldn't I reinvent some idea X for myself? It's intellectually
37 rewarding!" Yes it is, but it also takes time you might have better
38 spent elsewhere. After all, you can get anywhere you want to go by walking, but you can
39 accomplish more with a combination of walking and strategic subway
42 More importantly, the idiosyncrasies of your particular
43 implementation may obscure what's fundamental to the idea you're
44 working with. Your implementation may be buggy in corner cases you
45 didn't think of; it may be incomplete and not trivial to generalize; its
46 connection to existing literature and neighboring issues may go
47 unnoticed. For all these reasons you're better off understanding the
50 The theoretical tools we'll be introducing aren't very familiar to
51 everyday programmers, but they are prominent in academic computer science,
52 especially in the fields of functional programming and type theory.
54 Of necessity, this course will lay a lot of logical groundwork. But throughout
55 we'll be aiming to mix that groundwork with real cases
56 in our home subjects where these tools play central roles. Our aim for the
57 course is to enable you to make these tools your own; to have enough
58 understanding of them to recognize them in use, use them yourself at least
59 in simple ways, and to be able to read more about them when appropriate.
61 Once we get up and running, the central focii of the course will be
62 **continuations**, **types**, and **monads**. One of the on-going themes will
63 concern evaluation order and issues about how computations (inferences,
64 derivations) unfold in (for instance) time. The key analytic technique is to
65 form a static, order-independent model of a dynamic process. We'll be
66 discussing this in much more detail as the course proceeds.
68 The logical systems we'll be looking at include:
70 * the pure/untyped lambda calculus
72 * the simply-typed lambda calculus
73 * polymorphic types with System F
74 * some discussion of dependent types
75 * if time permits, "indeterministic" or "preemptively parallel" computation and linear logic
80 recursion using the Y-combinator
81 evaluation-order stratgies
82 normalizing properties
83 the Curry-Howard isomorphism(s)
84 monads in category theory and computation
87 ## Who Can Participate? ##
89 The course will not presume previous experience with programming. We
90 will, however, discuss concepts embodied in specific programming
91 languages, and we will encourage experimentation with running,
92 modifying, and writing computer programs.
94 The course will not presume lots of mathematical or logical background, either.
95 However, it will demand a certain amount of comfort working with such material; as a result,
96 it will not be especially well-suited to be a first graduate-level course
97 in formal semantics or philosophy of language. If you have concerns about your
98 background, come discuss them with us.
100 This class will count as satisfying the logic requirement for Philosophy
101 PhD students; however if this would be your first or only serious
102 engagement with graduate-level formal work you should consider
103 carefully, and must discuss with us, (1) whether you'll be adequately
104 prepared for this course, and (2) whether you'd be better served by
105 taking a logic course (at a neighboring department, or at NYU next year)
106 with a more canonical syllabus.
109 Faculty and students from outside of NYU Linguistics and Philosophy are welcome
110 to audit, to the extent that this coheres well with the needs of our local
114 ## Recommended Software ##
116 During the course, we'll be encouraging you to try out various things in Scheme
117 and Caml, which are prominent *functional programming languages*. We'll explain
118 what that means during the course.
120 * **Scheme** is one of two major dialects of *Lisp*, which is a large family
121 of programming languages. The other dialect is called "CommonLisp." Scheme
122 is the more clean and minimalistic dialect, and is what's mostly used in
124 Scheme itself has umpteen different "implementations", which share most of
125 their fundamentals, but have slightly different extensions and interact with
126 the operating system differently. One major implementation used to be called
127 PLT Scheme, and has just in the past few weeks changed their name to Racket.
128 This is what we recommend you use. (If you're already using or comfortable with
129 another Scheme implementation, though, there's no compelling reason to switch.)
131 * **Caml** is one of two major dialects of *ML*, which is another large
132 family of programming languages. The other dialect is called "SML" and has
133 several implementations. But Caml has only one active implementation,
134 OCaml, developed by the INRIA academic group in France.
136 * Those of you with some programming background may have encountered a third
137 prominent functional programming language, **Haskell**. This is also used a
138 lot in the academic contexts we'll be working through. Its surface syntax
139 differs from Caml, and there are various important things one can do in
140 each of Haskell and Caml that one can't (or can't as easily) do in the
141 other. But these languages also have a lot in common, and if you're
142 familiar with one of them, it's not difficult to move between it and the
145 [[How to get the programming languages running on your computer]]
147 [[Using the programming languages]]
149 [[Family tree of functional programming languages]]
151 ## Recommended Books ##
153 * *An Introduction to Lambda Calculi for Computer Scientists*, by Chris
154 Hankin, currently $17 on
155 [Amazon](http://www.amazon.com/Introduction-Lambda-Calculi-Computer-Scientists/dp/0954300653).
157 * (Another good book covering the same ground as the Hankin book, but
158 more thoroughly, and in a more mathematical style, is *Lambda-Calculus and Combinators:
159 an Introduction*, by J. Roger Hindley and Jonathan P. Seldin. If you choose to read
160 both the Hankin book and this book, you'll notice the authors made some different
161 terminological/notational choices. At first, this makes comprehension slightly slower,
162 but in the long run it's helpful because it makes the arbitrariness of those choices more salient.)
165 * *The Little Schemer, Fourth Edition*, by Daniel P. Friedman and Matthias
166 Felleisen, currently $23 on [Amazon](http://www.amazon.com/exec/obidos/ASIN/0262560992).
167 This is a classic text introducing the gentle art of programming, using the
168 functional programming language Scheme. Many people love this book, but it has
169 an unusual dialog format that is not to everybody's taste. **Of particular
170 interest for this course** is the explanation of the Y combinator, available as
171 a free sample chapter [at the MIT Press web page for the
172 book](http://www.ccs.neu.edu/home/matthias/BTLS/).
174 * *The Seasoned Schemer*, also by Daniel P. Friedman and Matthias Felleisen, currently $28
175 on [Amazon](http://www.amazon.com/Seasoned-Schemer-Daniel-P-Friedman/dp/026256100X)
177 * *The Little MLer*, by Matthias Felleisen and Daniel P. Friedman, currently $27
178 on [Amazon](http://www.amazon.com/Little-MLer-Matthias-Felleisen/dp/026256114X).
179 This covers some of the same introductory ground as The Little Schemer, but
180 this time in ML. The dialect of ML used is SML, not OCaml, but there are only
181 superficial syntactic differences between these languages. [Here's a translation
182 manual between them](http://www.mpi-sws.org/~rossberg/sml-vs-ocaml.html).
184 ##[[Schedule of Topics]]##
186 ##[[Lecture Notes]]##
188 ##[[Offsite Reading]]##
190 There's lots of links here already to tutorials and encyclopedia entries about many of the notions we'll be dealing with.
195 All wikis are supposed to have a [[SandBox]], so this one does too.
197 This wiki is powered by [[ikiwiki]].