summaryrefslogtreecommitdiff
path: root/proofs/proof_type.ml
diff options
context:
space:
mode:
authorGravatar Samuel Mimram <samuel.mimram@ens-lyon.org>2004-07-28 21:54:47 +0000
committerGravatar Samuel Mimram <samuel.mimram@ens-lyon.org>2004-07-28 21:54:47 +0000
commit6b649aba925b6f7462da07599fe67ebb12a3460e (patch)
tree43656bcaa51164548f3fa14e5b10de5ef1088574 /proofs/proof_type.ml
Imported Upstream version 8.0pl1upstream/8.0pl1
Diffstat (limited to 'proofs/proof_type.ml')
-rw-r--r--proofs/proof_type.ml101
1 files changed, 101 insertions, 0 deletions
diff --git a/proofs/proof_type.ml b/proofs/proof_type.ml
new file mode 100644
index 00000000..cbed5e27
--- /dev/null
+++ b/proofs/proof_type.ml
@@ -0,0 +1,101 @@
+(************************************************************************)
+(* 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_type.ml,v 1.29.2.1 2004/07/16 19:30:49 herbelin Exp $ *)
+
+(*i*)
+open Environ
+open Evd
+open Names
+open Libnames
+open Term
+open Util
+open Tacexpr
+open Rawterm
+open Genarg
+open Nametab
+open Pattern
+(*i*)
+
+(* This module defines the structure of proof tree and the tactic type. So, it
+ is used by Proof_tree and Refiner *)
+
+type prim_rule =
+ | Intro of identifier
+ | Intro_replacing of identifier
+ | Cut of bool * identifier * types
+ | FixRule of identifier * int * (identifier * int * constr) list
+ | Cofix of identifier * (identifier * constr) list
+ | Refine of constr
+ | Convert_concl of types
+ | Convert_hyp of named_declaration
+ | Thin of identifier list
+ | ThinBody of identifier list
+ | Move of bool * identifier * identifier
+ | Rename of identifier * identifier
+
+
+(* Signature useful to define the tactic type *)
+type 'a sigma = {
+ it : 'a ;
+ sigma : evar_map }
+
+(*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.
+ if [ref = (Some(Tactic (t,p),l))] then [p] is the proof
+ that the goal can be proven if the goals in [l] are solved. *)
+type proof_tree = {
+ open_subgoals : int;
+ goal : goal;
+ ref : (rule * proof_tree list) option }
+
+and rule =
+ | Prim of prim_rule
+ | Tactic of tactic_expr * proof_tree
+ | Change_evars
+
+and goal = evar_info
+
+and tactic = goal sigma -> (goal list sigma * validation)
+
+and validation = (proof_tree list -> proof_tree)
+
+and tactic_expr =
+ (constr,
+ constr_pattern,
+ evaluable_global_reference,
+ inductive,
+ ltac_constant,
+ identifier,
+ glob_tactic_expr)
+ Tacexpr.gen_tactic_expr
+
+and atomic_tactic_expr =
+ (constr,
+ constr_pattern,
+ evaluable_global_reference,
+ inductive,
+ ltac_constant,
+ identifier,
+ glob_tactic_expr)
+ Tacexpr.gen_atomic_tactic_expr
+
+and tactic_arg =
+ (constr,
+ constr_pattern,
+ evaluable_global_reference,
+ inductive,
+ ltac_constant,
+ identifier,
+ glob_tactic_expr)
+ Tacexpr.gen_tactic_arg
+
+type hyp_location = identifier Tacexpr.raw_hyp_location
+