]> matita.cs.unibo.it Git - helm.git/blobdiff - helm/ocaml/tactics/tactics.mli
ocaml 3.09 transition
[helm.git] / helm / ocaml / tactics / tactics.mli
index b69e43e88328ebcec45200a7303ecc0686e7d742..6d524093569a91663c8f57ec091286a756e31350 100644 (file)
@@ -2,64 +2,85 @@
 val absurd : term:Cic.term -> ProofEngineTypes.tactic
 val apply : term:Cic.term -> ProofEngineTypes.tactic
 val assumption : ProofEngineTypes.tactic
-val auto : ?num:int option -> dbd:Mysql.dbd -> ProofEngineTypes.tactic
-val auto_new : dbd:Mysql.dbd -> ProofEngineTypes.tactic
-val change : what:Cic.term -> with_what:Cic.term -> ProofEngineTypes.tactic
+val auto :
+  ?depth:int ->
+  ?width:int ->
+  ?paramodulation:string ->
+  ?full:string -> dbd:HMysql.dbd -> unit -> ProofEngineTypes.tactic
+val change :
+  pattern:ProofEngineTypes.pattern ->
+  ProofEngineTypes.lazy_term -> ProofEngineTypes.tactic
+val clear : hyp:string -> ProofEngineTypes.tactic
+val clearbody : hyp:string -> ProofEngineTypes.tactic
 val compare : term:Cic.term -> ProofEngineTypes.tactic
 val constructor : n:int -> ProofEngineTypes.tactic
 val contradiction : ProofEngineTypes.tactic
 val cut :
   ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type ->
-  term:Cic.term -> ProofEngineTypes.tactic
+  Cic.term -> ProofEngineTypes.tactic
 val decide_equality : ProofEngineTypes.tactic
 val decompose :
-  ?uris_choice_callback:((UriManager.uri * int *
-                          (UriManager.uri * Cic.term) list)
-                         list ->
-                         (UriManager.uri * int *
-                          (UriManager.uri * Cic.term) list)
-                         list) ->
-  Cic.term -> ProofEngineTypes.tactic
+  ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type ->
+  ?user_types:(UriManager.uri * int) list ->
+  dbd:HMysql.dbd -> string -> ProofEngineTypes.tactic
 val discriminate : term:Cic.term -> ProofEngineTypes.tactic
-val elim_intros_simpl : term:Cic.term -> ProofEngineTypes.tactic
-val elim_intros : term:Cic.term -> ProofEngineTypes.tactic
-val elim_type : term:Cic.term -> ProofEngineTypes.tactic
+val elim_intros :
+  ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type ->
+  ?depth:int -> ?using:Cic.term -> Cic.term -> ProofEngineTypes.tactic
+val elim_intros_simpl :
+  ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type ->
+  ?depth:int -> ?using:Cic.term -> Cic.term -> ProofEngineTypes.tactic
+val elim_type :
+  ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type ->
+  ?depth:int -> ?using:Cic.term -> Cic.term -> ProofEngineTypes.tactic
 val exact : term:Cic.term -> ProofEngineTypes.tactic
 val exists : ProofEngineTypes.tactic
+val fail : ProofEngineTypes.tactic
 val fold :
-  reduction:(Cic.context -> Cic.term -> Cic.term) ->
-  also_in_hypotheses:bool -> term:Cic.term -> ProofEngineTypes.tactic
+  reduction:ProofEngineTypes.lazy_reduction ->
+  term:ProofEngineTypes.lazy_term ->
+  pattern:ProofEngineTypes.pattern -> ProofEngineTypes.tactic
 val fourier : ProofEngineTypes.tactic
+val fwd_simpl :
+  ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type ->
+  dbd:HMysql.dbd -> string -> ProofEngineTypes.tactic
 val generalize :
   ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type ->
-  Cic.term list -> ProofEngineTypes.tactic
-val set_goal : int -> ProofEngineTypes.tactic
+  ProofEngineTypes.pattern -> ProofEngineTypes.tactic
+val id : ProofEngineTypes.tactic
 val injection : term:Cic.term -> ProofEngineTypes.tactic
 val intros :
   ?howmany:int ->
   ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type ->
   unit -> ProofEngineTypes.tactic
+val lapply :
+  ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type ->
+  ?how_many:int ->
+  ?to_what:Cic.term list -> Cic.term -> ProofEngineTypes.tactic
 val left : ProofEngineTypes.tactic
 val letin :
   ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type ->
-  term:Cic.term -> ProofEngineTypes.tactic
-val reduce :
-  also_in_hypotheses:bool ->
-  terms:Cic.term list option -> ProofEngineTypes.tactic
+  Cic.term -> ProofEngineTypes.tactic
+val normalize : pattern:ProofEngineTypes.pattern -> ProofEngineTypes.tactic
+val reduce : pattern:ProofEngineTypes.pattern -> ProofEngineTypes.tactic
 val reflexivity : ProofEngineTypes.tactic
-val replace : what:Cic.term -> with_what:Cic.term -> ProofEngineTypes.tactic
-val rewrite_back : term:Cic.term -> ProofEngineTypes.tactic
-val rewrite_back_simpl : term:Cic.term -> ProofEngineTypes.tactic
-val rewrite : term:Cic.term -> ProofEngineTypes.tactic
-val rewrite_simpl : term:Cic.term -> ProofEngineTypes.tactic
+val replace :
+  pattern:ProofEngineTypes.pattern ->
+  with_what:ProofEngineTypes.lazy_term -> ProofEngineTypes.tactic
+val rewrite :
+  direction:[ `LeftToRight | `RightToLeft ] ->
+  pattern:ProofEngineTypes.pattern -> Cic.term -> ProofEngineTypes.tactic
+val rewrite_simpl :
+  direction:[ `LeftToRight | `RightToLeft ] ->
+  pattern:ProofEngineTypes.pattern -> Cic.term -> ProofEngineTypes.tactic
 val right : ProofEngineTypes.tactic
 val ring : ProofEngineTypes.tactic
-val simpl :
-  also_in_hypotheses:bool ->
-  terms:Cic.term list option -> ProofEngineTypes.tactic
+val set_goal : int -> ProofEngineTypes.tactic
+val simpl : pattern:ProofEngineTypes.pattern -> ProofEngineTypes.tactic
 val split : ProofEngineTypes.tactic
 val symmetry : ProofEngineTypes.tactic
 val transitivity : term:Cic.term -> ProofEngineTypes.tactic
-val whd :
-  also_in_hypotheses:bool ->
-  terms:Cic.term list option -> ProofEngineTypes.tactic
+val unfold :
+  ProofEngineTypes.lazy_term option ->
+  pattern:ProofEngineTypes.pattern -> ProofEngineTypes.tactic
+val whd : pattern:ProofEngineTypes.pattern -> ProofEngineTypes.tactic