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_______________________________________________________________ *)
12 (* $Id: nCicRefiner.mli 9227 2008-11-21 16:00:06Z tassi $ *)
14 let debug s = prerr_endline (Lazy.force s);;
17 module COT : Set.OrderedType with type t = int * NCic.term =
19 type t = int * NCic.term
20 let compare = Pervasives.compare
23 module HintSet = Set.Make(COT)
26 Discrimination_tree.Make(NDiscriminationTree.NCicIndexable)(HintSet)
29 Discrimination_tree.Make(NDiscriminationTree.NCicIndexable)(HintSet)
32 HDB.t * (* hint database: (dummy A B)[?] |-> \forall X.(summy a b)[X] *)
33 EQDB.t (* eqclass DB: A[?] |-> \forall X.B[X] and viceversa *)
35 exception HintNotValid
37 let skel_dummy = NCic.Implicit `Type;;
46 val db = HDB.empty, EQDB.empty
48 method set_uhint_db v = {< db = v >}
49 method set_unifhint_status
50 : 'status. #g_status as 'status -> 'self
51 = fun o -> {< db = o#uhint_db >}
54 let dummy = NCic.Const (NReference.reference_of_string "cic:/dummy_conv.dec");;
55 let pair t1 t2 = (NCic.Appl [dummy;t1;t2]) ;;
57 let index_hint hdb context t1 t2 precedence =
60 | NCic.Meta _ | NCic.Appl (NCic.Meta _ :: _) -> false | _ -> true)
63 | NCic.Meta _ | NCic.Appl (NCic.Meta _ :: _) -> false | _ -> true)
65 (* here we do not use skel_dummy since it could cause an assert false in
66 * the subst function that lives in the kernel *)
67 let hole = NCic.Meta (-1,(0,NCic.Irl 0)) in
69 List.fold_left (fun t _ -> NCicSubstitution.subst hole t) t1 context
72 List.fold_left (fun t _ -> NCicSubstitution.subst hole t) t2 context
74 let rec cleanup_skeleton () = function
75 | NCic.Meta _ -> skel_dummy
76 | t -> NCicUtils.map (fun _ () -> ()) () cleanup_skeleton t
78 let t1_skeleton = cleanup_skeleton () t1_skeleton in
79 let t2_skeleton = cleanup_skeleton () t2_skeleton in
80 let src = pair t1_skeleton t2_skeleton in
81 let ctx2abstractions context t =
85 | NCic.Decl ty -> NCic.Prod (n,ty,t)
86 | NCic.Def (b,ty) -> NCic.LetIn (n,ty,b,t))
89 let data_hint = ctx2abstractions context (pair t1 t2) in
90 let data_t1 = t2_skeleton in
91 let data_t2 = t1_skeleton in
93 debug(lazy ("INDEXING: " ^
94 NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] src ^ " |==> " ^
95 NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] data_hint));
98 HDB.index (fst (hdb#uhint_db)) src (precedence, data_hint),
100 (EQDB.index (snd (hdb#uhint_db)) t2_skeleton (precedence, data_t2))
101 t1_skeleton (precedence, data_t1))
104 let add_user_provided_hint db t precedence =
106 let rec aux ctx = function
108 (match List.rev l with
112 NCicTypeChecker.typeof ~metasenv:[] ~subst:[] ctx a
115 NCicTypeChecker.typeof ~metasenv:[] ~subst:[] ctx b
117 NCicReduction.are_convertible
118 ~metasenv:[] ~subst:[] ctx ty_a ty_b
120 NCicReduction.are_convertible
121 ~metasenv:[] ~subst:[] ctx a b
123 else raise HintNotValid
125 | NCic.Prod (n,s,t) -> aux ((n, NCic.Decl s) :: ctx) t
126 | NCic.LetIn (n,ty,t,b) -> aux ((n, NCic.Def (t,ty)) :: ctx) b
131 index_hint db c a b precedence
137 (let rec aux = function
138 | u1 :: tl -> List.map (f u1) tl :: aux tl
142 let mk_hint (u1,_,_) (u2,_,_) =
143 let l = OCic2NCic.convert_obj u1
144 (fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph u1)) in
145 let r = OCic2NCic.convert_obj u2
146 (fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph u2)) in
147 match List.hd l,List.hd r with
148 | (_,h1,_,_,NCic.Constant (_,_,Some l,_,_)),
149 (_,h2,_,_,NCic.Constant (_,_,Some r,_,_)) ->
150 let rec aux ctx t1 t2 =
152 | NCic.Lambda (n1,s1,b1), NCic.Lambda(_,s2,b2) ->
153 if NCicReduction.are_convertible ~subst:[] ~metasenv:[] ctx s1 s2
154 then aux ((n1, NCic.Decl s1) :: ctx) b1 b2
157 if NCicReduction.are_convertible ~subst:[] ~metasenv:[] ctx b1 b2
160 function 0 -> [] | n -> NCic.Rel n :: mk_rels (n-1)
163 NCic.Appl (NCic.Const(OCic2NCic.reference_of_ouri
164 u1 (NReference.Def h1)) :: mk_rels (List.length ctx))
167 NCic.Appl (NCic.Const(OCic2NCic.reference_of_ouri
168 u2 (NReference.Def h2)) :: mk_rels (List.length ctx))
170 [ctx,b1,b2; ctx,b1,n2; ctx,n1,b2; ctx,n1,n2]
180 if List.length l > 1 then
183 [] (CoercDb.to_list (CoercDb.dump ()))
185 prerr_endline "MISTERO";
189 | (ctx,b1,b2) -> index_hint db ctx b1 b2 0)
190 !user_db (List.flatten hints)
194 let saturate ?(delta=0) metasenv subst context ty goal_arity =
195 assert (goal_arity >= 0);
196 let rec aux metasenv = function
197 | NCic.Prod (name,s,t) as ty ->
198 let metasenv1, _, arg,_ =
199 NCicMetaSubst.mk_meta ~name:name metasenv context (`WithType s) in
200 let t, metasenv1, args, pno =
201 aux metasenv1 (NCicSubstitution.subst arg t)
203 if pno + 1 = goal_arity then
204 ty, metasenv, [], goal_arity+1
206 t, metasenv1, arg::args, pno+1
208 match NCicReduction.whd ~subst context ty ~delta with
209 | NCic.Prod _ as ty -> aux metasenv ty
210 | _ -> ty, metasenv, [], 0 (* differs from the other impl in this line*)
212 let res, newmetasenv, arguments, _ = aux metasenv ty in
213 res, newmetasenv, arguments
216 let eq_class_of hdb t1 =
218 if NDiscriminationTree.NCicIndexable.path_string_of t1 =
219 [Discrimination_tree.Variable]
221 [] (* if the trie is unable to handle the key, we skip the query since
222 it sould retulr the whole content of the trie *)
224 let candidates = EQDB.retrieve_unifiables (snd hdb#uhint_db) t1 in
225 let candidates = HintSet.elements candidates in
226 let candidates = List.sort (fun (x,_) (y,_) -> compare x y) candidates in
227 List.map snd candidates
229 debug(lazy("eq_class of: " ^ NCicPp.ppterm ~metasenv:[] ~context:[] ~subst:[]
230 t1 ^ " is\n" ^ String.concat "\n"
231 (List.map (NCicPp.ppterm ~subst:[] ~metasenv:[] ~context:[]) eq_class)));
235 let look_for_hint hdb metasenv subst context t1 t2 =
236 debug(lazy ("KEY1: "^NCicPp.ppterm ~metasenv ~subst ~context t1));
237 debug(lazy ("KEY2: "^NCicPp.ppterm ~metasenv ~subst ~context t2));
241 prerr_endline ("ENTRY: " ^
242 NDiscriminationTree.NCicIndexable.string_of_path p ^ " |--> " ^
243 String.concat "|" (List.map (NCicPp.ppterm ~metasenv:[] ~subst:[]
244 ~context:[]) (HintSet.elements ds))));
246 let candidates1 = HDB.retrieve_unifiables (fst hdb#uhint_db) (pair t1 t2) in
247 let candidates2 = HDB.retrieve_unifiables (fst hdb#uhint_db) (pair t2 t1) in
249 List.map (fun (prec,ty) ->
250 prec,true,saturate ~delta:max_int metasenv subst context ty 0)
251 (HintSet.elements candidates1)
254 List.map (fun (prec,ty) ->
255 prec,false,saturate ~delta:max_int metasenv subst context ty 0)
256 (HintSet.elements candidates2)
260 (fun (p,b,(t,m,_)) ->
261 let rec aux () (m,l as acc) = function
262 | NCic.Meta _ as t -> acc, t
263 | NCic.LetIn (name,ty,bo,t) ->
265 NCicMetaSubst.mk_meta ~name m context (`WithType ty)in
266 let t = NCicSubstitution.subst i t in
267 aux () (m, (i,bo)::l) t
268 | t -> NCicUntrusted.map_term_fold_a (fun _ () -> ()) () aux acc t
270 let (m,l), t = aux () (m,[]) t in
272 (candidates1 @ candidates2)
277 | (prec,true,(NCic.Appl [_; t1; t2],metasenv,l))-> prec,metasenv,(t1,t2),l
278 | (prec,false,(NCic.Appl [_; t1; t2],metasenv,l))-> prec,metasenv,(t2,t1),l
283 List.sort (fun (x,_,_,_) (y,_,_,_) -> Pervasives.compare x y) rc
285 let rc = List.map (fun (_,x,y,z) -> x,y,z) rc in
287 debug(lazy ("Hints:"^
288 String.concat "\n" (List.map
289 (fun (metasenv, (t1, t2), premises) ->
290 ("\t" ^ String.concat "; "
291 (List.map (fun (a,b) ->
292 NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context a ^
294 NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context b)
297 NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context t1 ^
298 " = "^NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context t2))