the Curry-Howard isomorphism(s)
monads in category theory and computation
-->
-
+
## Who Can Participate? ##
The course will not presume previous experience with programming. We
modifying, and writing computer programs.
The course will not presume lots of mathematical or logical background, either.
-However, it will demand a certain amount of comfort working with such material; as a result,
+However, it will demand a certain amount of comfort working with such material; as a result,
it will not be especially well-suited to be a first graduate-level course
in formal semantics or philosophy of language. If you have concerns about your
background, come discuss them with us.
-It hasn't yet been decided whether this course counts for satisfying the logic requirement for
+It hasn't yet been decided whether this course counts for satisfying the logic requirement for
Philosophy PhD students.
Faculty and students from outside of NYU Linguistics and Philosophy are welcome
[[Using the programming languages]]
-
+[[Family tree of functional programming languages]]
+
## Recommended Books ##
* *An Introduction to Lambda Calculi for Computer Scientists*, by Chris
this time in ML. The dialect of ML used is SML, not OCaml, but there are only
superficial syntactic differences between these languages.
-# Other resources #
-
-* [Barker's Lambda Tutorial](http://homepages.nyu.edu/~cb125/Lambda): tutorial with embedded Javascript code that enables a user to type a lambda form into a web browser page and click to execute (reduce) it.
-* [Penn Lambda Calculator](http://www.ling.upenn.edu/lambda/): requires installing Java, but provides a number of tools for evaluating lambda expressions and other linguistic forms.
-
##[[Schedule of Topics]]##
##[[Lecture Notes]]##