diff -r 7dd5797a5ffa -r 470922b46a63 handouts/scala-ho.tex
--- a/handouts/scala-ho.tex	Fri Nov 28 13:47:32 2014 +0000
+++ b/handouts/scala-ho.tex	Wed Dec 03 00:00:36 2014 +0000
@@ -223,7 +223,7 @@
 fact that lists can only contain elements of a single type. In
 this case the first common type is \code{Rexp}.\footnote{If you
 type in this example, you will notice that the type contains
-some further information, but lets ignore this for the
+some further information, but let us ignore this for the
 moment.} 
 
 For compound types like \code{List[...]}, the general rule is
@@ -238,7 +238,7 @@
 language for the code we will write in this module. This
 elegance mainly stems from the fact that in addition to
 inductive datatypes, also functions can be implemented very
-easily in Scala. To show you this, lets first consider a
+easily in Scala. To show you this, let us first consider a
 problem from number theory, called the \emph{Collatz-series},
 which corresponds to a famous unsolved problem in
 mathematics.\footnote{See for example
@@ -365,7 +365,7 @@
 Coming from Java or C, you might be surprised that Scala does
 not really have loops. It has instead, what is in functional
 programming called, \emph{maps}. To illustrate how they work,
-lets assume you have a list of numbers from 1 to 8 and want to
+let us assume you have a list of numbers from 1 to 8 and want to
 build the list of squares. The list of numbers from 1 to 8 
 can be constructed in Scala as follows: