aboutsummaryrefslogtreecommitdiff
path: root/proofs
diff options
context:
space:
mode:
authorThéo Zimmermann2019-05-24 16:36:46 +0200
committerThéo Zimmermann2019-05-24 16:36:46 +0200
commit5727443376480be4793757fd5507621ad4f09509 (patch)
tree2fff9e86c24d1d6d82c3ed59919d3b3de4112189 /proofs
parent5596cf352d1c265fd5627dc19416d2b55c10f2b7 (diff)
parentbe40007de49140d403bb1dad1af9f4f1e3fe5003 (diff)
Merge PR #10233: Fixing typos - Part 3
Reviewed-by: Zimmi48
Diffstat (limited to 'proofs')
-rw-r--r--proofs/clenvtac.ml2
-rw-r--r--proofs/refine.mli2
-rw-r--r--proofs/refiner.ml2
3 files changed, 3 insertions, 3 deletions
diff --git a/proofs/clenvtac.ml b/proofs/clenvtac.ml
index c36b0fa337..b022f4596d 100644
--- a/proofs/clenvtac.ml
+++ b/proofs/clenvtac.ml
@@ -19,7 +19,7 @@ open Reduction
open Clenv
(* This function put casts around metavariables whose type could not be
- * infered by the refiner, that is head of applications, predicates and
+ * inferred by the refiner, that is head of applications, predicates and
* subject of Cases.
* Does check that the casted type is closed. Anyway, the refiner would
* fail in this case... *)
diff --git a/proofs/refine.mli b/proofs/refine.mli
index 55dafe521f..b8948a92f3 100644
--- a/proofs/refine.mli
+++ b/proofs/refine.mli
@@ -9,7 +9,7 @@
(************************************************************************)
(** The primitive refine tactic used to fill the holes in partial proofs. This
- is the recommanded way to write tactics when the proof term is easy to
+ is the recommended way to write tactics when the proof term is easy to
write down. Note that this is not the user-level refine tactic defined
in Ltac which is actually based on the one below. *)
diff --git a/proofs/refiner.ml b/proofs/refiner.ml
index bce227dabb..799f4a380b 100644
--- a/proofs/refiner.ml
+++ b/proofs/refiner.ml
@@ -289,7 +289,7 @@ let tclIFTHENTRYELSEMUST tac1 tac2 gl =
(* Fails if a tactic did not solve the goal *)
let tclCOMPLETE tac = tclTHEN tac (tclFAIL_s "Proof is not complete.")
-(* Try the first thats solves the current goal *)
+(* Try the first that solves the current goal *)
let tclSOLVE tacl = tclFIRST (List.map tclCOMPLETE tacl)