blob: 47fb74c75e164baba0727cd4bc7ffd6d37a9bbc5 (
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
55
56
57
58
59
60
61
62
63
64
65
66
|
(************************************************************************)
(* 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: sequent.mli 5920 2004-07-16 20:01:26Z herbelin $ *)
open Term
open Util
open Formula
open Tacmach
open Names
open Libnames
module OrderedConstr: Set.OrderedType with type t=constr
module CM: Map.S with type key=constr
type h_item = global_reference * (int*constr) option
module History: Set.S with type elt = h_item
val cm_add : constr -> global_reference -> global_reference list CM.t ->
global_reference list CM.t
val cm_remove : constr -> global_reference -> global_reference list CM.t ->
global_reference list CM.t
module HP: Heap.S with type elt=Formula.t
type t = {redexes:HP.t;
context: global_reference list CM.t;
latoms:constr list;
gl:types;
glatom:constr option;
cnt:counter;
history:History.t;
depth:int}
val deepen: t -> t
val record: h_item -> t -> t
val lookup: h_item -> t -> bool
val add_formula : side -> global_reference -> constr -> t ->
Proof_type.goal sigma -> t
val re_add_formula_list : Formula.t list -> t -> t
val find_left : constr -> t -> global_reference
val take_formula : t -> Formula.t * t
val empty_seq : int -> t
val create_with_ref_list : global_reference list ->
int -> Proof_type.goal sigma -> t
val create_with_auto_hints : Auto.hint_db_name list ->
int -> Proof_type.goal sigma -> t
val print_cmap: global_reference list CM.t -> unit
|
