summaryrefslogtreecommitdiff
path: root/tactics/decl_proof_instr.mli
blob: 5f4a04850fb8d69c7434d62614ddfb3bad69f475 (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
112
113
114
115
116
117
118
(************************************************************************)
(*  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: decl_proof_instr.mli 12422 2009-10-27 08:42:49Z corbinea $ *)

open Refiner
open Names
open Term
open Tacmach
open Decl_mode

val go_to_proof_mode: unit -> unit
val return_from_tactic_mode: unit -> unit

val register_automation_tac: tactic -> unit

val automation_tac : tactic

val daimon_subtree: pftreestate -> pftreestate

val concl_refiner: Termops.metamap -> constr -> Proof_type.goal sigma -> constr

val do_instr: Decl_expr.raw_proof_instr -> pftreestate -> pftreestate
val proof_instr: Decl_expr.raw_proof_instr -> unit

val tcl_change_info : Decl_mode.pm_info -> tactic

val mark_proof_tree_as_done : Proof_type.proof_tree -> Proof_type.proof_tree

val mark_as_done : pftreestate -> pftreestate

val execute_cases :
    Names.name ->
    Decl_mode.per_info ->
    (Term.constr -> Proof_type.tactic) ->
    (Names.Idset.elt * (Term.constr option * Term.constr list) list) list ->
    Term.constr list -> int -> Decl_mode.split_tree -> Proof_type.tactic

val tree_of_pats : 
  identifier * (int * int) -> (Rawterm.cases_pattern*recpath) list list ->
  split_tree

val add_branch : 
  identifier * (int * int) -> (Rawterm.cases_pattern*recpath) list list ->
  split_tree -> split_tree

val append_branch :
  identifier *(int * int) -> int -> (Rawterm.cases_pattern*recpath) list list ->
  (Names.Idset.t * Decl_mode.split_tree) option ->
  (Names.Idset.t * Decl_mode.split_tree) option

val append_tree :
  identifier * (int * int) -> int -> (Rawterm.cases_pattern*recpath) list list ->
  split_tree -> split_tree

val build_dep_clause :   Term.types Decl_expr.statement list ->
    Decl_expr.proof_pattern ->
    Decl_mode.per_info ->
    (Term.types Decl_expr.statement, Term.types Decl_expr.or_thesis)
    Decl_expr.hyp list -> Proof_type.goal Tacmach.sigma -> Term.types

val register_dep_subcase :    
    Names.identifier * (int * int) ->
    Environ.env ->
    Decl_mode.per_info ->
    Rawterm.cases_pattern -> Decl_mode.elim_kind -> Decl_mode.elim_kind

val thesis_for :     Term.constr ->
    Term.constr -> Decl_mode.per_info -> Environ.env -> Term.constr

val close_previous_case : pftreestate -> pftreestate

val pop_stacks :
  (Names.identifier * 
     (Term.constr option * Term.constr list) list) list -> 
  (Names.identifier * 
     (Term.constr option * Term.constr list) list) list

val push_head :   Term.constr ->
  Names.Idset.t ->
  (Names.identifier * 
     (Term.constr option * Term.constr list) list) list ->
  (Names.identifier * 
     (Term.constr option * Term.constr list) list) list

val push_arg : Term.constr ->
  (Names.identifier * 
     (Term.constr option * Term.constr list) list) list ->
  (Names.identifier * 
     (Term.constr option * Term.constr list) list) list

val hrec_for: 
    Names.identifier ->
    Decl_mode.per_info -> Proof_type.goal Tacmach.sigma -> 
    Names.identifier -> Term.constr

val consider_match :
   bool ->
    (Names.Idset.elt*bool) list ->
    Names.Idset.elt list ->
    (Term.types Decl_expr.statement, Term.types) Decl_expr.hyp list ->
    Proof_type.tactic

val init_tree:
    Names.Idset.t ->
    Names.inductive ->
    int option * Declarations.wf_paths ->
    (int ->
     (int option * Declarations.recarg Rtree.t) array ->
     (Names.Idset.t * Decl_mode.split_tree) option) ->
    Decl_mode.split_tree

val set_refine : (Evd.open_constr -> Proof_type.tactic) -> unit