summaryrefslogtreecommitdiff
path: root/pretyping/tacred.mli
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 /pretyping/tacred.mli
Imported Upstream version 8.0pl1upstream/8.0pl1
Diffstat (limited to 'pretyping/tacred.mli')
-rw-r--r--pretyping/tacred.mli85
1 files changed, 85 insertions, 0 deletions
diff --git a/pretyping/tacred.mli b/pretyping/tacred.mli
new file mode 100644
index 00000000..162275d5
--- /dev/null
+++ b/pretyping/tacred.mli
@@ -0,0 +1,85 @@
+(************************************************************************)
+(* 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: tacred.mli,v 1.21.2.1 2004/07/16 19:30:46 herbelin Exp $ i*)
+
+(*i*)
+open Names
+open Term
+open Environ
+open Evd
+open Reductionops
+open Closure
+open Rawterm
+(*i*)
+
+(*s Reduction functions associated to tactics. \label{tacred} *)
+
+val is_evaluable : env -> evaluable_global_reference -> bool
+
+exception Redelimination
+
+(* Red (raise Redelimination if nothing reducible) *)
+val red_product : reduction_function
+
+(* Hnf *)
+val hnf_constr : reduction_function
+
+(* Simpl *)
+val nf : reduction_function
+
+(* Unfold *)
+val unfoldn :
+ (int list * evaluable_global_reference) list -> reduction_function
+
+(* Fold *)
+val fold_commands : constr list -> reduction_function
+
+(* Pattern *)
+val pattern_occs : (int list * constr) list -> reduction_function
+(* Rem: Lazy strategies are defined in Reduction *)
+
+(* Call by value strategy (uses Closures) *)
+val cbv_norm_flags : Closure.RedFlags.reds -> reduction_function
+ val cbv_beta : local_reduction_function
+ val cbv_betaiota : local_reduction_function
+ val cbv_betadeltaiota : reduction_function
+ val compute : reduction_function (* = [cbv_betadeltaiota] *)
+
+(* [reduce_to_atomic_ind env sigma t] puts [t] in the form [t'=(I args)]
+ with [I] an inductive definition;
+ returns [I] and [t'] or fails with a user error *)
+val reduce_to_atomic_ind : env -> evar_map -> types -> inductive * types
+
+(* [reduce_to_quantified_ind env sigma t] puts [t] in the form
+ [t'=(x1:A1)..(xn:An)(I args)] with [I] an inductive definition;
+ returns [I] and [t'] or fails with a user error *)
+val reduce_to_quantified_ind : env -> evar_map -> types -> inductive * types
+
+(* [reduce_to_quantified_ref env sigma ref t] try to put [t] in the form
+ [t'=(x1:A1)..(xn:An)(ref args)] and raise Not_found if not possible *)
+val reduce_to_quantified_ref :
+ env -> evar_map -> Libnames.global_reference -> types -> types
+
+val reduce_to_atomic_ref :
+ env -> evar_map -> Libnames.global_reference -> types -> types
+
+type red_expr = (constr, evaluable_global_reference) red_expr_gen
+
+val contextually : bool -> constr occurrences -> reduction_function
+ -> reduction_function
+val reduction_of_redexp : red_expr -> reduction_function
+
+val declare_red_expr : string -> reduction_function -> unit
+
+(* Opaque and Transparent commands. *)
+val set_opaque_const : constant -> unit
+val set_transparent_const : constant -> unit
+
+val set_opaque_var : identifier -> unit
+val set_transparent_var : identifier -> unit