aboutsummaryrefslogtreecommitdiff
path: root/tactics
diff options
context:
space:
mode:
authorletouzey2010-04-29 16:06:42 +0000
committerletouzey2010-04-29 16:06:42 +0000
commitccba6c718af6a5a15f278fc9365b6ad27108e98f (patch)
treef0229aa4d08eb12db1fb1e76f227076c117d59bf /tactics
parent06456c76b7fa2f0c69380faf27a6ca403b1e6f3f (diff)
Various minor improvements of comments in mli for ocamldoc
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@12976 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'tactics')
-rw-r--r--tactics/auto.mli12
-rw-r--r--tactics/hipattern.mli4
-rw-r--r--tactics/termdn.mli2
3 files changed, 10 insertions, 8 deletions
diff --git a/tactics/auto.mli b/tactics/auto.mli
index f7c3fd7775..684478d966 100644
--- a/tactics/auto.mli
+++ b/tactics/auto.mli
@@ -20,6 +20,8 @@ open Libnames
open Vernacexpr
open Mod_subst
+(** Auto and related automation tactics *)
+
type auto_tactic =
| Res_pf of constr * clausenv (** Hint Apply *)
| ERes_pf of constr * clausenv (** Hint EApply *)
@@ -122,11 +124,11 @@ val make_apply_entry :
-> hint_entry
(** A constr which is Hint'ed will be:
- (1) used as an Exact, if it does not start with a product
- (2) used as an Apply, if its HNF starts with a product, and
- has no missing arguments.
- (3) used as an EApply, if its HNF starts with a product, and
- has missing arguments. *)
+ - (1) used as an Exact, if it does not start with a product
+ - (2) used as an Apply, if its HNF starts with a product, and
+ has no missing arguments.
+ - (3) used as an EApply, if its HNF starts with a product, and
+ has missing arguments. *)
val make_resolves :
env -> evar_map -> bool * bool * bool -> int option -> constr ->
diff --git a/tactics/hipattern.mli b/tactics/hipattern.mli
index 3fa8596f90..c44eb6fddc 100644
--- a/tactics/hipattern.mli
+++ b/tactics/hipattern.mli
@@ -14,7 +14,8 @@ open Evd
open Pattern
open Coqlib
-(** {6 Sect } *)
+(** High-order patterns *)
+
(** Given a term with second-order variables in it,
represented by Meta's, and possibly applied using SoApp
terms, this function will perform second-order, binding-preserving,
@@ -34,7 +35,6 @@ open Coqlib
intersection of the free-rels of the term and the current stack be
contained in the arguments of the application *)
-(** {6 Sect } *)
(** I implemented the following functions which test whether a term [t]
is an inductive but non-recursive type, a general conjuction, a
general disjunction, or a type with no constructors.
diff --git a/tactics/termdn.mli b/tactics/termdn.mli
index ed3a928abb..dae4e8e30f 100644
--- a/tactics/termdn.mli
+++ b/tactics/termdn.mli
@@ -64,5 +64,5 @@ sig
val constr_pat_discr : constr_pattern -> (term_label * constr_pattern list) option
val constr_val_discr : constr -> (term_label * constr list) lookup_res
-(**/**)
+ (**/**)
end