aboutsummaryrefslogtreecommitdiffhomepage
path: root/doc/RefMan-modr.tex
diff options
context:
space:
mode:
Diffstat (limited to 'doc/RefMan-modr.tex')
-rw-r--r--doc/RefMan-modr.tex6
1 files changed, 3 insertions, 3 deletions
diff --git a/doc/RefMan-modr.tex b/doc/RefMan-modr.tex
index c5f309763..f9a251fdc 100644
--- a/doc/RefMan-modr.tex
+++ b/doc/RefMan-modr.tex
@@ -2,7 +2,7 @@
\label{Mod}
The module system extends the Calculus of Inductive Constructions
-providing a convinient way to structure large developments as well as
+providing a convenient way to structure large developments as well as
a mean of massive abstraction.
%It is described in details in Judicael's thesis and Jacek's thesis
@@ -56,7 +56,7 @@ $S$ is a module type name and $T$ is a module type.
In order to introduce the typing system we first slightly extend
the syntactic class of terms and environments given in
section~\ref{Terms}. The environments, apart from definitions of
-constants and inductives now also hold any other signature elements.
+constants and inductive types now also hold any other signature elements.
Terms, apart from variables, constants and complex terms,
include also access paths.
@@ -146,7 +146,7 @@ Rules for typing module expressions:
}
}
\end{itemize}
-The last rule, called strengthenning is used to make all module fields
+The last rule, called strengthening is used to make all module fields
manifestly equal to themselves. The notation $T/p$ has the following
meaning:
\begin{itemize}