let compare = Pervasives.compare
end
module S = Set.Make(Codomain)
-module TI = Discrimination_tree.Make(Discrimination_tree.CicIndexable)(S)
+module TI = Discrimination_tree.Make(Cic_indexable.CicIndexable)(S)
type universe = TI.t
-let empty = TI.empty
+let empty = TI.empty ;;
+
+let iter u f =
+ TI.iter u
+ (fun p s -> f p (S.elements s))
;;
let get_candidates univ ty =
S.elements (TI.retrieve_unifiables univ ty)
;;
+let in_universe univ ty =
+ let candidates = get_candidates univ ty in
+ List.fold_left
+ (fun res cand ->
+ match res with
+ | Some found -> Some found
+ | None ->
+ let candty,_ =
+ CicTypeChecker.type_of_aux' [] [] cand CicUniv.oblivion_ugraph in
+ let same ,_ =
+ CicReduction.are_convertible [] candty ty CicUniv.oblivion_ugraph in
+ if same then Some cand else None
+ ) None candidates
+;;
+
let rec unfold context = function
| Cic.Prod(name,s,t) ->
let t' = unfold ((Some (name,Cic.Decl s))::context) t in