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
+val const_lazy_term: Cic.term -> Cic.lazy_term
type lazy_reduction =
Cic.context -> 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
+type ('term, 'lazy_term) pattern =
+ 'lazy_term option * (string * 'term) list * 'term option
+
+type lazy_pattern = (Cic.term, Cic.lazy_term) pattern
(** conclusion_pattern [t] returns the pattern (t,[],%) *)
-val conclusion_pattern : Cic.term option -> pattern
+val conclusion_pattern : Cic.term option -> lazy_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
+