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
other.
[[How to get the programming languages running on your computer]]
-
-## Recommended Readings ##
+
+[[Using the programming languages]]
+
+[[Family tree of functional programming languages]]
+
+## Recommended Books ##
* *An Introduction to Lambda Calculi for Computer Scientists*, by Chris
Hankin, currently $17 on
on [Amazon](http://www.amazon.com/Little-MLer-Matthias-Felleisen/dp/026256114X).
This covers some of the same introductory ground as The Little Schemer, but
this time in ML. The dialect of ML used is SML, not OCaml, but there are only
-superficial syntactic differences between these languages.
-
+superficial syntactic differences between these languages. [Here's a translation
+manual between them](http://www.mpi-sws.org/~rossberg/sml-vs-ocaml.html).
##[[Schedule of Topics]]##