blob: eb4d81bd65d728e321b7a7d876645fd5d9a70158 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
(* $Id: rules.mli,v 1.11.2.1 2004/07/16 19:30:10 herbelin Exp $ *)
open Term
open Tacmach
open Names
open Libnames
type seqtac= (Sequent.t -> tactic) -> Sequent.t -> tactic
type lseqtac= global_reference -> seqtac
type 'a with_backtracking = tactic -> 'a
val wrap : int -> bool -> seqtac
val id_of_global: global_reference -> identifier
val clear_global: global_reference -> tactic
val axiom_tac : constr -> Sequent.t -> tactic
val ll_atom_tac : constr -> lseqtac with_backtracking
val and_tac : seqtac with_backtracking
val or_tac : seqtac with_backtracking
val arrow_tac : seqtac with_backtracking
val left_and_tac : inductive -> lseqtac with_backtracking
val left_or_tac : inductive -> lseqtac with_backtracking
val left_false_tac : global_reference -> tactic
val ll_ind_tac : inductive -> constr list -> lseqtac with_backtracking
val ll_arrow_tac : constr -> constr -> constr -> lseqtac with_backtracking
val forall_tac : seqtac with_backtracking
val left_exists_tac : inductive -> lseqtac
val ll_forall_tac : types -> lseqtac with_backtracking
val normalize_evaluables : tactic
|
