Our linguistic competence is unbounded, yet our tries only allow for the representation of a finite number of forms.

In Haskell, as in linguistic semantics, the universe is partitioned into types.

We have a robust intuition that our language processing takes place incrementally, with us beginning to understand what is being said before the speaker has finished.

Our second lecture is about setting the stage for the parsing problem.

Our first lecture is about the lambda calculus, which many of you are familiar with from your previous semantics course.