type goal = int
type status = proof * goal
+ (** @param goal
+ * @param goal's metasenv
+ * @return initial proof status for the given goal *)
+val initial_status: Cic.term -> Cic.metasenv -> status
+
(**
a tactic: make a transition from one status to another one or, usually,
raise a "Fail" (@see Fail) exception in case of failure
type tactic
val mk_tactic: (status -> proof * goal list) -> tactic
+type reduction = Cic.context -> Cic.term -> Cic.term
+
+type lazy_term =
+ Cic.context -> Cic.metasenv -> CicUniv.universe_graph ->
+ Cic.term * Cic.metasenv * CicUniv.universe_graph
+
+val const_lazy_term: Cic.term -> lazy_term
+
+type lazy_reduction =
+ Cic.context -> Cic.metasenv -> CicUniv.universe_graph ->
+ reduction * Cic.metasenv * CicUniv.universe_graph
+
+val const_lazy_reduction: reduction -> lazy_reduction
+
+ (** what, hypothesis patterns, conclusion pattern *)
+type pattern = lazy_term option * (string * Cic.term) list * Cic.term
+
+ (** conclusion_pattern [t] returns the pattern (t,[],%) *)
+val conclusion_pattern : Cic.term option -> pattern
+
(** tactic failure *)
-exception Fail of string
+exception Fail of string Lazy.t
val apply_tactic: tactic -> status -> proof * goal list
(** constraint: the returned value will always be constructed by Cic.Name **)
type mk_fresh_name_type =
Cic.metasenv -> Cic.context -> Cic.name -> typ:Cic.term -> Cic.name
+
+val goals_of_proof: proof -> goal list
+