summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGravatar Adam Chlipala <adamc@hcoop.net>2008-12-20 18:24:12 -0500
committerGravatar Adam Chlipala <adamc@hcoop.net>2008-12-20 18:24:12 -0500
commit65428eeb2cba9807043188bfddf5fbfd1bf9296b (patch)
tree45cadcbc3fcffcac1a03cabeac21275b5e6e9bbc
parentec745f90fc97e10948dc32ec4f44aabf5c6908db (diff)
Typo report from megacz
-rw-r--r--doc/manual.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/manual.tex b/doc/manual.tex
index 930fd9f9..af905574 100644
--- a/doc/manual.tex
+++ b/doc/manual.tex
@@ -1017,7 +1017,7 @@ Nonetheless, the unification engine tends to do reasonably well. Unlike in ML,
\subsection{Unifying Record Types}
-The type inference engine tries to take advantage of the algebraic rules governing type-level records, as shown in Section \ref{definitional}. When two constructors of record kind are unified, they are reduce to normal forms, with like terms crossed off from each normal form until, hopefully, nothing remains. This cannot be complete, with the inclusion of unification variables. The type-checker can help you understand what goes wrong when the process fails, as it outputs the unmatched remainders of the two normal forms.
+The type inference engine tries to take advantage of the algebraic rules governing type-level records, as shown in Section \ref{definitional}. When two constructors of record kind are unified, they are reduced to normal forms, with like terms crossed off from each normal form until, hopefully, nothing remains. This cannot be complete, with the inclusion of unification variables. The type-checker can help you understand what goes wrong when the process fails, as it outputs the unmatched remainders of the two normal forms.
\subsection{\label{typeclasses}Type Classes}