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 module COT : Set.OrderedType with type t = int * NCic.term =
16 type t = int * NCic.term
17 let compare = Pervasives.compare
20 module HintSet = Set.Make(COT)
23 Discrimination_tree.Make(NDiscriminationTree.NCicIndexable)(HintSet)
31 method set_uhint_db v = {< db = v >}
32 method set_unifhint_status
33 : 'status. < uhint_db : db; .. > as 'status -> 'self
34 = fun o -> {< db = o#uhint_db >}
37 let dummy = NCic.Const (NReference.reference_of_string "cic:/dummy_conv.dec");;
38 let pair t1 t2 = (NCic.Appl [dummy;t1;t2]) ;;
40 let index_hint hdb context t1 t2 precedence =
43 | NCic.Meta _ | NCic.Appl (NCic.Meta _ :: _) -> false | _ -> true)
46 | NCic.Meta _ | NCic.Appl (NCic.Meta _ :: _) -> false | _ -> true)
48 let pair' = pair t1 t2 in
53 | NCic.Decl ty -> NCic.Prod (n,ty,t)
54 | NCic.Def (b,ty) -> NCic.LetIn (n,ty,b,t))
61 NCicSubstitution.subst (NCic.Meta (-1,(0,NCic.Irl 0))) t
63 NCicSubstitution.subst (NCic.Meta (-1,(0,NCic.Irl 0))) t)
66 prerr_endline ("INDEXING: " ^
67 NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] src ^ " |==> " ^
68 NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] data);
70 hdb#set_uhint_db (DB.index hdb#uhint_db src (precedence, data))
73 let add_user_provided_hint db t precedence =
75 let rec aux ctx = function
77 (match List.rev l with
78 | b::a::_ -> ctx, a, b
80 | NCic.Prod (n,s,t) -> aux ((n, NCic.Decl s) :: ctx) t
81 | NCic.LetIn (n,ty,t,b) -> aux ((n, NCic.Def (t,ty)) :: ctx) b
86 index_hint db c a b precedence
92 (let rec aux = function
93 | u1 :: tl -> List.map (f u1) tl :: aux tl
97 let mk_hint (u1,_,_) (u2,_,_) =
98 let l = OCic2NCic.convert_obj u1
99 (fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph u1)) in
100 let r = OCic2NCic.convert_obj u2
101 (fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph u2)) in
102 match List.hd l,List.hd r with
103 | (_,h1,_,_,NCic.Constant (_,_,Some l,_,_)),
104 (_,h2,_,_,NCic.Constant (_,_,Some r,_,_)) ->
105 let rec aux ctx t1 t2 =
107 | NCic.Lambda (n1,s1,b1), NCic.Lambda(_,s2,b2) ->
108 if NCicReduction.are_convertible ~subst:[] ~metasenv:[] ctx s1 s2
109 then aux ((n1, NCic.Decl s1) :: ctx) b1 b2
112 if NCicReduction.are_convertible ~subst:[] ~metasenv:[] ctx b1 b2
115 prerr_endline ("hint: " ^ NCicPp.ppterm ~metasenv:[] ~subst:[]
116 ~context:ctx b1 ^ " === " ^ NCicPp.ppterm ~metasenv:[]
117 ~subst:[] ~context:ctx b2);
120 function 0 -> [] | n -> NCic.Rel n :: mk_rels (n-1)
123 NCic.Appl (NCic.Const(OCic2NCic.reference_of_ouri
124 u1 (NReference.Def h1)) :: mk_rels (List.length ctx))
127 NCic.Appl (NCic.Const(OCic2NCic.reference_of_ouri
128 u2 (NReference.Def h2)) :: mk_rels (List.length ctx))
130 [ctx,b1,b2; ctx,b1,n2; ctx,n1,b2; ctx,n1,n2]
140 if List.length l > 1 then
143 [] (CoercDb.to_list (CoercDb.dump ()))
145 prerr_endline "MISTERO";
149 | (ctx,b1,b2) -> index_hint db ctx b1 b2 0)
150 !user_db (List.flatten hints)
154 let saturate ?(delta=0) metasenv subst context ty goal_arity =
155 assert (goal_arity >= 0);
156 let rec aux metasenv = function
157 | NCic.Prod (name,s,t) as ty ->
158 let metasenv1, _, arg,_ =
159 NCicMetaSubst.mk_meta ~name:name metasenv context (`WithType s) in
160 let t, metasenv1, args, pno =
161 aux metasenv1 (NCicSubstitution.subst arg t)
163 if pno + 1 = goal_arity then
164 ty, metasenv, [], goal_arity+1
166 t, metasenv1, arg::args, pno+1
168 match NCicReduction.whd ~subst context ty ~delta with
169 | NCic.Prod _ as ty -> aux metasenv ty
170 | _ -> ty, metasenv, [], 0 (* differs from the other impl in this line*)
172 let res, newmetasenv, arguments, _ = aux metasenv ty in
173 res, newmetasenv, arguments
176 let look_for_hint hdb metasenv subst context t1 t2 =
178 prerr_endline ("KEY1: "^NCicPp.ppterm ~metasenv ~subst ~context (pair t1 t2));
179 prerr_endline ("KEY2: "^NCicPp.ppterm ~metasenv ~subst ~context (pair t2 t1));
182 prerr_endline ("ENTRY: " ^
183 NDiscriminationTree.NCicIndexable.string_of_path p ^ " |--> " ^
184 String.concat "|" (List.map (NCicPp.ppterm ~metasenv:[] ~subst:[]
185 ~context:[]) (HintSet.elements ds))));
187 let candidates1 = DB.retrieve_unifiables hdb#uhint_db (pair t1 t2) in
188 let candidates2 = DB.retrieve_unifiables hdb#uhint_db (pair t2 t1) in
190 List.map (fun (prec,ty) ->
191 prec,true,saturate ~delta:max_int metasenv subst context ty 0)
192 (HintSet.elements candidates1)
195 List.map (fun (prec,ty) ->
196 prec,false,saturate ~delta:max_int metasenv subst context ty 0)
197 (HintSet.elements candidates2)
201 (fun (p,b,(t,m,_)) ->
202 let rec aux () (m,l as acc) = function
203 | NCic.Meta _ as t -> acc, t
204 | NCic.LetIn (name,ty,bo,t) ->
206 NCicMetaSubst.mk_meta ~name m context (`WithType ty)in
207 let t = NCicSubstitution.subst i t in
208 aux () (m, (i,bo)::l) t
209 | t -> NCicUntrusted.map_term_fold_a (fun _ () -> ()) () aux acc t
211 let (m,l), t = aux () (m,[]) t in
213 (candidates1 @ candidates2)
218 | (prec,true,(NCic.Appl [_; t1; t2],metasenv,l))-> prec,metasenv,(t1,t2),l
219 | (prec,false,(NCic.Appl [_; t1; t2],metasenv,l))-> prec,metasenv,(t2,t1),l
224 List.sort (fun (x,_,_,_) (y,_,_,_) -> Pervasives.compare x y) rc
226 let rc = List.map (fun (_,x,y,z) -> x,y,z) rc in
228 prerr_endline "Hints:";
230 (fun (metasenv, (t1, t2), premises) ->
232 ("\t" ^ String.concat "; "
233 (List.map (fun (a,b) ->
234 NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context a ^
236 NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context b)
239 NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context t1 ^
240 " = "^NCicPp.ppterm ~margin:max_int ~metasenv ~subst ~context t2))