2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
15 module Ref = NReference
17 exception CircularDependency of string Lazy.t;;
18 exception ObjectNotFound of string Lazy.t;;
19 exception BadDependency of string Lazy.t * exn;;
20 exception BadConstraint of string Lazy.t;;
25 HExtlib.list_uniq ~eq:(fun (b1,u1) (b2,u2) -> b1=b2 && NUri.eq u1 u2)
26 (List.sort (fun (b1,u1) (b2,u2) ->
27 let res = compare b1 b2 in if res = 0 then NUri.compare u1 u2 else res)
30 let le_constraints = ref [] (* strict,a,b *)
32 let resolve_universe u =
35 prerr_endline (NUri.name_of_uri a);
36 if NUri.name_of_uri a = u then Some a
37 else if NUri.name_of_uri b = u then Some b
42 let rec le_path_uri avoid strict a b =
43 (not strict && NUri.eq a b) ||
46 NUri.eq y b && not (List.exists (NUri.eq x) avoid) &&
47 le_path_uri (x::avoid) (strict && not strict') a x
51 let leq_path a b = le_path_uri [b] (fst a) (snd a) b;;
53 let universe_leq a b =
55 | a,[(false,b)] -> List.for_all (fun a -> leq_path a b) a
58 (lazy "trying to check if a universe is less or equal than an inferred universe"))
62 | [(false,_)], [(false,_)] -> universe_leq b a && universe_leq a b
64 | [(false,_)],_ -> false
67 (lazy "trying to check if two inferred universes are equal"))
70 let pp_constraint b x y =
71 NUri.name_of_uri x ^ (if b then " < " else " <= ") ^ NUri.name_of_uri y
74 let pp_constraints () =
75 String.concat "\n" (List.map (fun (b,x,y) -> pp_constraint b x y) !le_constraints)
78 let universes = ref [];;
80 let add_constraint strict a b =
82 | [false,a2],[false,b2] ->
83 if not (le_path_uri [] strict a2 b2) then (
84 if le_path_uri [] (not strict) b2 a2 then
85 (raise(BadConstraint(lazy("universe inconsistency adding "^pp_constraint strict a2 b2
86 ^ " to:\n" ^ pp_constraints ()))));
87 universes := a2 :: b2 ::
88 List.filter (fun x -> not (NUri.eq x a2 || NUri.eq x b2)) !universes;
89 le_constraints := (strict,a2,b2) :: !le_constraints)
90 | _ -> raise (BadConstraint
91 (lazy "trying to add a constraint on an inferred universe"))
98 let bigger_than acc (s1,n1) = List.filter (le_path_uri [] s1 n1) acc in
99 let solutions = List.fold_left bigger_than !universes l in
100 let rec aux = function
103 if List.exists (fun x -> le_path_uri [] true x u) solutions then aux tl
111 let typecheck_obj,already_set = ref (fun _ -> assert false), ref false;;
112 let set_typecheck_obj f =
122 let cache = NUri.UriHash.create 313;;
123 let frozen_list = ref [];;
125 exception Propagate of NUri.uri * exn;;
127 let get_checked_obj u =
128 if List.exists (fun (k,_) -> NUri.eq u k) !frozen_list
130 raise (CircularDependency (lazy (NUri.string_of_uri u)))
133 try NUri.UriHash.find cache u
136 let saved_frozen_list = !frozen_list in
139 try NCicLibrary.get_obj u
141 NCicLibrary.ObjectNotFound m -> raise (ObjectNotFound m)
143 frozen_list := (u,obj)::saved_frozen_list;
145 frozen_list := saved_frozen_list;
146 let obj = `WellTyped obj in
147 NUri.UriHash.add cache u obj;
151 frozen_list := saved_frozen_list;
153 | Propagate (u',old_exn) as e' ->
154 frozen_list := saved_frozen_list;
155 let exn = `Exn (BadDependency (lazy (NUri.string_of_uri u ^
156 " depends (recursively) on " ^ NUri.string_of_uri u' ^
157 " which is not well-typed"),
158 match old_exn with BadDependency (_,e) -> e | _ -> old_exn)) in
159 NUri.UriHash.add cache u exn;
160 if saved_frozen_list = [] then
165 frozen_list := saved_frozen_list;
167 NUri.UriHash.add cache u exn;
168 if saved_frozen_list = [] then
171 raise (Propagate (u,e))
178 let get_checked_decl = function
179 | Ref.Ref (uri, Ref.Decl) ->
180 (match get_checked_obj uri with
181 | _,height,_,_, C.Constant (rlv,name,None,ty,att) ->
182 rlv,name,ty,att,height
183 | _,_,_,_, C.Constant (_,_,Some _,_,_) ->
184 prerr_endline "get_checked_decl on a definition"; assert false
185 | _ -> prerr_endline "get_checked_decl on a non decl 2"; assert false)
186 | _ -> prerr_endline "get_checked_decl on a non decl"; assert false
189 let get_checked_def = function
190 | Ref.Ref (uri, Ref.Def _) ->
191 (match get_checked_obj uri with
192 | _,height,_,_, C.Constant (rlv,name,Some bo,ty,att) ->
193 rlv,name,bo,ty,att,height
194 | _,_,_,_, C.Constant (_,_,None,_,_) ->
195 prerr_endline "get_checked_def on an axiom"; assert false
196 | _ -> prerr_endline "get_checked_def on a non def 2"; assert false)
197 | _ -> prerr_endline "get_checked_def on a non def"; assert false
200 let get_checked_indtys = function
201 | Ref.Ref (uri, (Ref.Ind (_,n,_)|Ref.Con (n,_,_))) ->
202 (match get_checked_obj uri with
203 | _,_,_,_, C.Inductive (inductive,leftno,tys,att) ->
204 inductive,leftno,tys,att,n
205 | _ -> prerr_endline "get_checked_indtys on a non ind 2"; assert false)
206 | _ -> prerr_endline "get_checked_indtys on a non ind"; assert false
209 let get_checked_fixes_or_cofixes = function
210 | Ref.Ref (uri, (Ref.Fix _|Ref.CoFix _))->
211 (match get_checked_obj uri with
212 | _,height,_,_, C.Fixpoint (_,funcs,att) ->
214 | _ ->prerr_endline "get_checked_(co)fix on a non (co)fix 2";assert false)
215 | _ -> prerr_endline "get_checked_(co)fix on a non (co)fix"; assert false
218 let get_relevance (Ref.Ref (_, infos) as r) =
220 Ref.Def _ -> let res,_,_,_,_,_ = get_checked_def r in res
221 | Ref.Decl -> let res,_,_,_,_ = get_checked_decl r in res
223 let _,_,tl,_,n = get_checked_indtys r in
224 let res,_,_,_ = List.nth tl n in
227 let _,_,tl,_,n = get_checked_indtys r in
228 let _,_,_,cl = List.nth tl n in
229 let res,_,_ = List.nth cl (i - 1) in
231 | Ref.Fix (fixno,_,_)
233 let fl,_,_ = get_checked_fixes_or_cofixes r in
234 let res,_,_,_,_ = List.nth fl fixno in
240 assert (!frozen_list = []);
241 NUri.UriHash.clear cache