Commit d07c33ca authored by Guillaume Melquiond's avatar Guillaume Melquiond

Fix some typos.

parent 3d663636
......@@ -185,7 +185,7 @@ each $x_1 \dots x_n$ occurs at most once in all the $e_i$.
\subsection{Induction Transformations}
\begin{description}
\item[induction\_ty\_lex]:
\item[induction\_ty\_lex]
\index{induction-ty-lex@\verb+induction_ty_lex+}
performs structural, lexicographic induction on
goals involving universally quantified variables of algebraic data
......@@ -391,7 +391,7 @@ definitions~\cite{paskevich09rr}.
\item[simplify\_recursive\_definition] reduces mutually recursive
definitions if they are not really mutually recursive, \eg
\begin{whycode}
function f : ... = .... g ...
function f : ... = ... g ...
with g : ... = e
\end{whycode}
becomes
......
......@@ -1016,7 +1016,7 @@ module AVLSorted
then Right s
else Here
(* In an ideal world....
(* In an ideal world...
1) It would be nice to have the two cloned AVL modules unified
(they are intended to be the same), as well as the two (identical)
definitions of type way.
......
#!/usr/bin/env ocaml
(** a mini-mini-make or mini-mini-sub-make
just the protocole for parallelism
just the protocol for parallelism
*)
#load "unix.cma";;
......@@ -95,7 +95,7 @@ let () =
ignore (create_process cmd args i)
done;
ignore (create_process cmd args nb_run);
eprintf "run_wait: *** Attente des tâches non terminées....@.";
eprintf "run_wait: *** Attente des tâches non terminées...@.";
let remaining_child = ref nb_run in
while !remaining_child <> 0 do
ignore (Unix.wait ()); decr remaining_child;
......
......@@ -51,7 +51,7 @@ val trivial : Task.task Trans.trans
(** [trivial] corresponds to the transformation "inline_trivial"
Inline only the trivial definition :
logic c : t = a
logic f(x : t,...., ) : t = g(y : t2,...) *)
logic f(x : t,...) : t = g(y : t2,...) *)
(*
(** Functions to use in other transformations if inlining is needed *)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment