let coerc_carr_of_term t =
try
match t with
- Cic.Sort s -> Sort s
+ | Cic.Sort s -> Sort s
+ | Cic.Prod _ -> Fun 0
+ (* BUG: this should be the real arity. The computation
+ requires menv, context etc.., but since carrs are compared discharging Fun
+ arity... it works *)
| Cic.Appl (t::_)
| t -> Uri (CicUtil.uri_of_term t)
with Invalid_argument _ ->
| Fun i -> "FunClass_" ^ string_of_int i
;;
-let eq_carr src tgt =
+let eq_carr ?(exact=false) src tgt =
match src, tgt with
- | Uri src, Uri tgt -> UriManager.eq src tgt
+ | Uri src, Uri tgt ->
+ let coarse_eq = UriManager.eq src tgt in
+ let t = CicUtil.term_of_uri src in
+ let ty,_ = CicTypeChecker.type_of_aux' [] [] t CicUniv.oblivion_ugraph in
+ (match ty, exact with
+ | Cic.Prod _, true -> false
+ | Cic.Prod _, false -> coarse_eq
+ | _ -> coarse_eq)
| Sort (Cic.Type _), Sort (Cic.Type _) -> true
| Sort src, Sort tgt when src = tgt -> true
| Term t1, Term t2 ->
else raise EqCarrOnNonMetaClosed
| Fun _,Fun _ -> true (* only one Funclass? *)
(* | Fun i,Fun j when i=j -> true *)
+ | Term t, _
+ | _, Term t when not (CicUtil.is_meta_closed t) -> raise EqCarrOnNonMetaClosed
| _, _ -> false
;;
let to_list () =
- List.map (fun (s,t,l) -> s,t,List.map fst l) !db
+ List.map (fun (s,t,l) -> s,t,List.map (fun a,_,b -> a,b) l) !db
;;
let rec myfilter p = function
| (s,t,l)::tl ->
let l =
HExtlib.filter_map
- (fun (u,n) ->
- if p (s,t,u) then
+ (fun (u,n,saturations) ->
+ if p (s,t,u,saturations) then
if n = 1 then
None
else
- Some (u,n-1)
+ Some (u,n-1,saturations)
else
- Some (u,n))
+ Some (u,n,saturations))
l
in
if l = [] then myfilter p tl else (s,t,l)::myfilter p tl
let find_coercion f =
List.map
- fst
+ (fun uri,_,saturations -> uri,saturations)
(List.flatten
(HExtlib.filter_map (fun (s,t,l) -> if f (s,t) then Some l else None) !db))
;;
-let is_a_coercion u =
- List.exists
- (fun (_,_,xl) -> List.exists (fun (x,_) -> UriManager.eq u x) xl)
- !db
-;;
-
let get_carr uri =
try
let src, tgt, _ =
List.find
- (fun (_,_,xl) -> List.exists (fun (x,_) -> UriManager.eq uri x) xl)
+ (fun (_,_,xl) -> List.exists (fun (x,_,_) -> UriManager.eq uri x) xl)
!db
in
src, tgt
with Not_found -> assert false (* uri must be a coercion *)
;;
+let is_a_coercion u =
+ List.exists
+ (fun (_,_,xl) -> List.exists (fun (x,_,_) -> UriManager.eq u x) xl)
+ !db
+;;
+
+let is_a_coercion' t =
+ try
+ let uri = CicUtil.uri_of_term t in
+ is_a_coercion uri
+ with Invalid_argument _ -> false
+;;
+
+let is_a_coercion_to_funclass t =
+ try
+ let uri = CicUtil.uri_of_term t in
+ match snd (get_carr uri) with
+ | Fun i -> Some i
+ | _ -> None
+ with Invalid_argument _ -> None
+
+
let term_of_carr = function
| Uri u -> CicUtil.term_of_uri u
| Sort s -> Cic.Sort s
| Term _ -> assert false
;;
-let add_coercion (src,tgt,u) =
+let add_coercion (src,tgt,u,saturations) =
let f s t = eq_carr s src && eq_carr t tgt in
let where = List.filter (fun (s,t,_) -> f s t) !db in
let rest = List.filter (fun (s,t,_) -> not (f s t)) !db in
match where with
- | [] -> db := (src,tgt,[u,1]) :: !db
+ | [] -> db := (src,tgt,[u,1,saturations]) :: !db
| (src,tgt,l)::tl ->
assert (tl = []); (* not sure, this may be a feature *)
- if List.exists (fun (x,_) -> UriManager.eq u x) l then
- let l' = List.map
- (fun (x,n) -> if UriManager.eq u x then (x,n+1) else (x,n))
+ if List.exists (fun (x,_,_) -> UriManager.eq u x) l then
+ let l' = List.map
+ (fun (x,n,saturations') ->
+ if UriManager.eq u x then
+ (x,n+1,saturations)
+ else
+ (x,n,saturations))
l
in
db := (src,tgt,l')::tl @ rest
else
- db := (src,tgt,(u,1)::l)::tl @ rest
+ db := (src,tgt,(u,1,saturations)::l)::tl @ rest
;;
-
-
-