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;;
41 val db = HDB.empty, EQDB.empty
43 method set_uhint_db v = {< db = v >}
44 method set_unifhint_status
45 : 'status. < uhint_db : db; .. > as 'status -> 'self
46 = fun o -> {< db = o#uhint_db >}
49 let dummy = NCic.Const (NReference.reference_of_string "cic:/dummy_conv.dec");;
50 let pair t1 t2 = (NCic.Appl [dummy;t1;t2]) ;;
52 let index_hint hdb context t1 t2 precedence =
55 | NCic.Meta _ | NCic.Appl (NCic.Meta _ :: _) -> false | _ -> true)
58 | NCic.Meta _ | NCic.Appl (NCic.Meta _ :: _) -> false | _ -> true)
60 (* here we do not use skel_dummy since it could cause an assert false in
61 * the subst function that lives in the kernel *)
62 let hole = NCic.Meta (-1,(0,NCic.Irl 0)) in
64 List.fold_left (fun t _ -> NCicSubstitution.subst hole t) t1 context
67 List.fold_left (fun t _ -> NCicSubstitution.subst hole t) t2 context
69 let rec cleanup_skeleton () = function
70 | NCic.Meta _ -> skel_dummy
71 | t -> NCicUtils.map (fun _ () -> ()) () cleanup_skeleton t
73 let t1_skeleton = cleanup_skeleton () t1_skeleton in
74 let t2_skeleton = cleanup_skeleton () t2_skeleton in
75 let src = pair t1_skeleton t2_skeleton in
76 let ctx2abstractions context t =
80 | NCic.Decl ty -> NCic.Prod (n,ty,t)
81 | NCic.Def (b,ty) -> NCic.LetIn (n,ty,b,t))
84 let data_hint = ctx2abstractions context (pair t1 t2) in
85 let data_t1 = t2_skeleton in
86 let data_t2 = t1_skeleton in
88 debug(lazy ("INDEXING: " ^
89 NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] src ^ " |==> " ^
90 NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] data_hint));
93 HDB.index (fst (hdb#uhint_db)) src (precedence, data_hint),
95 (EQDB.index (snd (hdb#uhint_db)) t2_skeleton (precedence, data_t2))
96 t1_skeleton (precedence, data_t1))
99 let add_user_provided_hint db t precedence =
101 let rec aux ctx = function
103 (match List.rev l with
107 NCicTypeChecker.typeof ~metasenv:[] ~subst:[] ctx a
110 NCicTypeChecker.typeof ~metasenv:[] ~subst:[] ctx b
112 NCicReduction.are_convertible
113 ~metasenv:[] ~subst:[] ctx ty_a ty_b
115 NCicReduction.are_convertible
116 ~metasenv:[] ~subst:[] ctx a b
118 else raise HintNotValid
120 | NCic.Prod (n,s,t) -> aux ((n, NCic.Decl s) :: ctx) t
121 | NCic.LetIn (n,ty,t,b) -> aux ((n, NCic.Def (t,ty)) :: ctx) b
126 index_hint db c a b precedence
132 (let rec aux = function
133 | u1 :: tl -> List.map (f u1) tl :: aux tl
137 let mk_hint (u1,_,_) (u2,_,_) =
138 let l = OCic2NCic.convert_obj u1
139 (fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph u1)) in
140 let r = OCic2NCic.convert_obj u2
141 (fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph u2)) in
142 match List.hd l,List.hd r with
143 | (_,h1,_,_,NCic.Constant (_,_,Some l,_,_)),
144 (_,h2,_,_,NCic.Constant (_,_,Some r,_,_)) ->
145 let rec aux ctx t1 t2 =
147 | NCic.Lambda (n1,s1,b1), NCic.Lambda(_,s2,b2) ->
148 if NCicReduction.are_convertible ~subst:[] ~metasenv:[] ctx s1 s2
149 then aux ((n1, NCic.Decl s1) :: ctx) b1 b2
152 if NCicReduction.are_convertible ~subst:[] ~metasenv:[] ctx b1 b2
155 function 0 -> [] | n -> NCic.Rel n :: mk_rels (n-1)
158 NCic.Appl (NCic.Const(OCic2NCic.reference_of_ouri
159 u1 (NReference.Def h1)) :: mk_rels (List.length ctx))
162 NCic.Appl (NCic.Const(OCic2NCic.reference_of_ouri
163 u2 (NReference.Def h2)) :: mk_rels (List.length ctx))
165 [ctx,b1,b2; ctx,b1,n2; ctx,n1,b2; ctx,n1,n2]
175 if List.length l > 1 then
178 [] (CoercDb.to_list (CoercDb.dump ()))
180 prerr_endline "MISTERO";
184 | (ctx,b1,b2) -> index_hint db ctx b1 b2 0)
185 !user_db (List.flatten hints)
189 let saturate ?(delta=0) metasenv subst context ty goal_arity =
190 assert (goal_arity >= 0);
191 let rec aux metasenv = function
192 | NCic.Prod (name,s,t) as ty ->
193 let metasenv1, _, arg,_ =
194 NCicMetaSubst.mk_meta ~name:name metasenv context (`WithType s) in
195 let t, metasenv1, args, pno =
196 aux metasenv1 (NCicSubstitution.subst arg t)
198 if pno + 1 = goal_arity then
199 ty, metasenv, [], goal_arity+1
201 t, metasenv1, arg::args, pno+1
203 match NCicReduction.whd ~subst context ty ~delta with
204 | NCic.Prod _ as ty -> aux metasenv ty
205 | _ -> ty, metasenv, [], 0 (* differs from the other impl in this line*)
207 let res, newmetasenv, arguments, _ = aux metasenv ty in
208 res, newmetasenv, arguments
211 let eq_class_of hdb t1 =
213 if NDiscriminationTree.NCicIndexable.path_string_of t1 =
214 [Discrimination_tree.Variable]
216 [] (* if the trie is unable to handle the key, we skip the query since
217 it sould retulr the whole content of the trie *)
219 let candidates = EQDB.retrieve_unifiables (snd hdb#uhint_db) t1 in
220 let candidates = HintSet.elements candidates in
221 let candidates = List.sort (fun (x,_) (y,_) -> compare x y) candidates in
222 List.map snd candidates
224 debug(lazy("eq_class of: " ^ NCicPp.ppterm ~metasenv:[] ~context:[] ~subst:[]
225 t1 ^ " is\n" ^ String.concat "\n"
226 (List.map (NCicPp.ppterm ~subst:[] ~metasenv:[] ~context:[]) eq_class)));
230 let look_for_hint hdb metasenv subst context t1 t2 =
231 debug(lazy ("KEY1: "^NCicPp.ppterm ~metasenv ~subst ~context t1));
232 debug(lazy ("KEY2: "^NCicPp.ppterm ~metasenv ~subst ~context t2));
236 prerr_endline ("ENTRY: " ^
237 NDiscriminationTree.NCicIndexable.string_of_path p ^ " |--> " ^
238 String.concat "|" (List.map (NCicPp.ppterm ~metasenv:[] ~subst:[]
239 ~context:[]) (HintSet.elements ds))));
241 let candidates1 = HDB.retrieve_unifiables (fst hdb#uhint_db) (pair t1 t2) in
242 let candidates2 = HDB.retrieve_unifiables (fst hdb#uhint_db) (pair t2 t1) in
244 List.map (fun (prec,ty) ->
245 prec,true,saturate ~delta:max_int metasenv subst context ty 0)
246 (HintSet.elements candidates1)
249 List.map (fun (prec,ty) ->
250 prec,false,saturate ~delta:max_int metasenv subst context ty 0)
251 (HintSet.elements candidates2)
255 (fun (p,b,(t,m,_)) ->
256 let rec aux () (m,l as acc) = function
257 | NCic.Meta _ as t -> acc, t
258 | NCic.LetIn (name,ty,bo,t) ->
260 NCicMetaSubst.mk_meta ~name m context (`WithType ty)in
261 let t = NCicSubstitution.subst i t in
262 aux () (m, (i,bo)::l) t
263 | t -> NCicUntrusted.map_term_fold_a (fun _ () -> ()) () aux acc t
265 let (m,l), t = aux () (m,[]) t in
267 (candidates1 @ candidates2)
272 | (prec,true,(NCic.Appl [_; t1; t2],metasenv,l))-> prec,metasenv,(t1,t2),l
273 | (prec,false,(NCic.Appl [_; t1; t2],metasenv,l))-> prec,metasenv,(t2,t1),l
278 List.sort (fun (x,_,_,_) (y,_,_,_) -> Pervasives.compare x y) rc
280 let rc = List.map (fun (_,x,y,z) -> x,y,z) rc in
282 debug(lazy ("Hints:"^
283 String.concat "\n" (List.map
284 (fun (metasenv, (t1, t2), premises) ->
285 ("\t" ^ String.concat "; "
286 (List.map (fun (a,b) ->
287 NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context a ^
289 NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context b)
292 NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context t1 ^
293 " = "^NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context t2))