blob: 3f5dbaeea7f7fa542cf94ea527556ee711dbf04e (
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
(*i*)
open Environ
open Evd
open Names
open Stamps
open Term
open Util
(*i*)
(* This module defines the structure of proof tree and the tactic type. So, it
is used by Proof_tree and Refiner *)
type bindOcc =
| Dep of identifier
| NoDep of int
| Com
type 'a substitution = (bindOcc * 'a) list
type pf_status =
| Complete_proof
| Incomplete_proof
type prim_rule_name =
| Intro
| Intro_after
| Intro_replacing
| Fix
| Cofix
| Refine
| Convert_concl
| Convert_hyp
| Thin
| Move of bool
type prim_rule = {
name : prim_rule_name;
hypspecs : identifier list;
newids : identifier list;
params : Coqast.t list;
terms : constr list }
type local_constraints = Intset.t
type ctxtty = {
pgm : constr option;
lc : local_constraints }
type enamed_declarations = ctxtty evar_map
(* A global constraint is a mappings of existential variables
with some extra information for the program tactic *)
type global_constraints = enamed_declarations timestamped
(* Signature useful to define the tactic type *)
type 'a sigma = {
it : 'a ;
sigma : global_constraints }
(*s Proof trees.
[ref] = [None] if the goal has still to be proved,
and [Some (r,l)] if the rule [r] was applied to the goal
and gave [l] as subproofs to be completed.
[subproof] = [(Some p)] if [ref = (Some(Tactic t,l))];
[p] is then the proof that the goal can be proven if the goals
in [l] are solved. *)
type proof_tree = {
status : pf_status;
goal : goal;
ref : (rule * proof_tree list) option;
subproof : proof_tree option }
and rule =
| Prim of prim_rule
| Tactic of tactic_expression
| Context of ctxtty
| Local_constraints of local_constraints
and goal = ctxtty evar_info
and tactic = goal sigma -> (goal list sigma * validation)
and validation = (proof_tree list -> proof_tree)
and tactic_arg =
| Command of Coqast.t
| Constr of constr
| OpenConstr of ((int * constr) list * constr) (* constr with holes *)
| Constr_context of constr
| Identifier of identifier
| Qualid of Nametab.qualid
| Integer of int
| Clause of identifier list
| Bindings of Coqast.t substitution
| Cbindings of constr substitution
| Quoted_string of string
| Tacexp of Coqast.t
| Tac of tactic * Coqast.t
| Redexp of Tacred.red_expr
| Fixexp of identifier * int * Coqast.t
| Cofixexp of identifier * Coqast.t
| Letpatterns of (int list option * (identifier * int list) list)
| Intropattern of intro_pattern
and intro_pattern =
| IdPat of identifier
| DisjPat of intro_pattern list
| ConjPat of intro_pattern list
| ListPat of intro_pattern list
and tactic_expression = string * tactic_arg list
|
