Curry-Howard, take 1
--------------------
-We will returnto the Curry-Howard correspondence a number of times
+We will return to the Curry-Howard correspondence a number of times
during this course. It expresses a deep connection between logic,
types, and computation. Today we'll discuss how the simply-typed
lambda calculus corresponds to intuitionistic logic. This naturally
roughly as follows:
If a variable `x` has type σ and term `M` has type τ, then
-the abstract `\xM` has type `σ --> τ`.
+the abstract `\xM` has type σ `-->` τ.
-If a term `M` has type `σ --> &tau`, and a term `N` has type
+If a term `M` has type σ `-->` &tau, and a term `N` has type
σ, then the application `MN` has type τ.
These rules are clearly obverses of one another: the functional types