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
|
(************************************************************************)
(* 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 *)
(************************************************************************)
(*i $Id: proof_trees.mli,v 1.27.2.1 2004/07/16 19:30:49 herbelin Exp $ i*)
(*i*)
open Util
open Names
open Term
open Sign
open Evd
open Environ
open Proof_type
(*i*)
(* This module declares readable constraints, and a few utilities on
constraints and proof trees *)
val mk_goal : named_context -> constr -> goal
val rule_of_proof : proof_tree -> rule
val ref_of_proof : proof_tree -> (rule * proof_tree list)
val children_of_proof : proof_tree -> proof_tree list
val goal_of_proof : proof_tree -> goal
val subproof_of_proof : proof_tree -> proof_tree
val status_of_proof : proof_tree -> int
val is_complete_proof : proof_tree -> bool
val is_leaf_proof : proof_tree -> bool
val is_tactic_proof : proof_tree -> bool
(*s A readable constraint is a global constraint plus a focus set
of existential variables and a signature. *)
val rc_of_gc : evar_map -> goal -> named_context sigma
val rc_add : named_context sigma -> existential_key * goal ->
named_context sigma
val get_hyps : named_context sigma -> named_context
val get_env : named_context sigma -> env
val get_gc : named_context sigma -> evar_map
val pf_lookup_name_as_renamed : env -> constr -> identifier -> int option
val pf_lookup_index_as_renamed : env -> constr -> int -> int option
(*s Pretty printing functions. *)
(*i*)
open Pp
(*i*)
val pr_goal : goal -> std_ppcmds
val pr_subgoals : goal list -> std_ppcmds
val pr_subgoal : int -> goal list -> std_ppcmds
val pr_decl : goal -> std_ppcmds
val pr_decls : evar_map -> std_ppcmds
val pr_evc : named_context sigma -> std_ppcmds
val prgl : goal -> std_ppcmds
val pr_seq : goal -> std_ppcmds
val pr_evars : (existential_key * goal) list -> std_ppcmds
val pr_evars_int : int -> (existential_key * goal) list -> std_ppcmds
val pr_subgoals_existential : evar_map -> goal list -> std_ppcmds
|
