1 (* Copyright (C) 2005, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://cs.unibo.it/helm/.
26 let _profiler = <:profiler<_profiler>>;;
33 let check_disjoint_invariant subst metasenv msg =
35 (fun (i,_,_) -> (Subst.is_in_subst i subst)) metasenv)
38 prerr_endline ("not disjoint: " ^ msg);
43 let rec check_irl start = function
45 | None::tl -> check_irl (start+1) tl
46 | (Some (Cic.Rel x))::tl ->
47 if x = start then check_irl (start+1) tl else false
51 let rec is_simple_term = function
52 | Cic.Appl ((Cic.Meta _)::_) -> false
53 | Cic.Appl l -> List.for_all is_simple_term l
54 | Cic.Meta (i, l) -> let l = [] in check_irl 1 l
57 | Cic.MutInd (_, _, []) -> true
58 | Cic.MutConstruct (_, _, _, []) -> true
63 List.exists (fun (j,_,_) -> i = j) menv
66 let unification_simple locked_menv metasenv context t1 t2 ugraph =
68 let module M = CicMetaSubst in
69 let module U = CicUnification in
70 let lookup = Subst.lookup_subst in
71 let rec occurs_check subst what where =
73 | t when what = t -> true
74 | C.Appl l -> List.exists (occurs_check subst what) l
76 let t = lookup where subst in
77 if t <> where then occurs_check subst what t else false
80 let rec unif subst menv s t =
81 let s = match s with C.Meta _ -> lookup s subst | _ -> s
82 and t = match t with C.Meta _ -> lookup t subst | _ -> t
86 | s, t when s = t -> subst, menv
87 | C.Meta (i, _), C.Meta (j, _)
88 when (locked locked_menv i) &&(locked locked_menv j) ->
90 (U.UnificationFailure (lazy "Inference.unification.unif"))
91 | C.Meta (i, _), C.Meta (j, _) when (locked locked_menv i) ->
93 | C.Meta (i, _), C.Meta (j, _) when (i > j) && not (locked locked_menv j) ->
95 | C.Meta _, t when occurs_check subst s t ->
97 (U.UnificationFailure (lazy "Inference.unification.unif"))
98 | C.Meta (i, l), t when (locked locked_menv i) ->
100 (U.UnificationFailure (lazy "Inference.unification.unif"))
101 | C.Meta (i, l), t -> (
103 let _, _, ty = CicUtil.lookup_meta i menv in
104 assert (not (Subst.is_in_subst i subst));
105 let subst = Subst.buildsubst i context t ty subst in
106 let menv = menv in (* List.filter (fun (m, _, _) -> i <> m) menv in *)
108 with CicUtil.Meta_not_found m ->
109 let names = names_of_context context in
111 (lazy*) prerr_endline
112 (Printf.sprintf "Meta_not_found %d!: %s %s\n%s\n\n%s" m
113 (CicPp.pp t1 names) (CicPp.pp t2 names)
114 (print_metasenv menv) (print_metasenv metasenv));
117 | _, C.Meta _ -> unif subst menv t s
118 | C.Appl (hds::_), C.Appl (hdt::_) when hds <> hdt ->
119 raise (U.UnificationFailure (lazy "Inference.unification.unif"))
120 | C.Appl (hds::tls), C.Appl (hdt::tlt) -> (
123 (fun (subst', menv) s t -> unif subst' menv s t)
124 (subst, menv) tls tlt
125 with Invalid_argument _ ->
126 raise (U.UnificationFailure (lazy "Inference.unification.unif"))
129 raise (U.UnificationFailure (lazy "Inference.unification.unif"))
131 let subst, menv = unif Subst.empty_subst metasenv t1 t2 in
132 let menv = Subst.filter subst menv in
136 let profiler = HExtlib.profile "P/Inference.unif_simple[flatten]"
137 let profiler2 = HExtlib.profile "P/Inference.unif_simple[flatten_fast]"
138 let profiler3 = HExtlib.profile "P/Inference.unif_simple[resolve_meta]"
139 let profiler4 = HExtlib.profile "P/Inference.unif_simple[filter]"
141 let unification_aux b metasenv1 metasenv2 context t1 t2 ugraph =
143 HExtlib.list_uniq (List.sort Pervasives.compare (metasenv1 @ metasenv2))
144 (* metasenv1 @ metasenv2 *)
146 let subst, menv, ug =
147 if not (is_simple_term t1) || not (is_simple_term t2) then (
150 (Printf.sprintf "NOT SIMPLE TERMS: %s %s"
151 (CicPp.ppterm t1) (CicPp.ppterm t2)));
152 raise (CicUnification.UnificationFailure (lazy "Inference.unification.unif"))
155 (* full unification *)
156 unification_simple [] metasenv context t1 t2 ugraph
158 (* matching: metasenv1 is locked *)
159 unification_simple metasenv1 metasenv context t1 t2 ugraph
161 if Utils.debug_res then
162 ignore(check_disjoint_invariant subst menv "unif");
163 (* let flatten subst =
165 (fun (i, (context, term, ty)) ->
166 let context = apply_subst_context subst context in
167 let term = apply_subst subst term in
168 let ty = apply_subst subst ty in
169 (i, (context, term, ty))) subst
171 let flatten subst = profiler.HExtlib.profile flatten subst in
172 let subst = flatten subst in *)
176 exception MatchingFailure;;
178 (** matching takes in input the _disjoint_ metasenv of t1 and t2;
179 it perform unification in the union metasenv, then check that
180 the first metasenv has not changed *)
181 let matching metasenv1 metasenv2 context t1 t2 ugraph =
183 unification_aux false metasenv1 metasenv2 context t1 t2 ugraph
185 CicUnification.UnificationFailure _ ->
186 raise MatchingFailure
189 let unification m1 m2 c t1 t2 ug =
191 unification_aux true m1 m2 c t1 t2 ug
197 let check_eq context msg eq =
198 let w, proof, (eq_ty, left, right, order), metas = eq in
199 if not (fst (CicReduction.are_convertible ~metasenv:metas context eq_ty
200 (fst (CicTypeChecker.type_of_aux' metas context left CicUniv.empty_ugraph))
201 CicUniv.empty_ugraph))
210 let find_equalities context proof =
211 let module C = Cic in
212 let module S = CicSubstitution in
213 let module T = CicTypeChecker in
214 let newmeta = ProofEngineHelpers.new_meta_of_proof ~proof in
215 let ok_types ty menv =
216 List.for_all (fun (_, _, mt) -> mt = ty) menv
218 let rec aux index newmeta = function
220 | (Some (_, C.Decl (term)))::tl ->
221 let do_find context term =
223 | C.Prod (name, s, t) ->
224 let (head, newmetas, args, newmeta) =
225 ProofEngineHelpers.saturate_term newmeta []
226 context (S.lift index term) 0
229 if List.length args = 0 then
232 C.Appl ((C.Rel index)::args)
235 | C.Appl [C.MutInd (uri, _, _); ty; t1; t2]
236 when (LibraryObjects.is_eq_URI uri) &&
237 (ok_types ty newmetas) ->
240 (Printf.sprintf "OK: %s" (CicPp.ppterm term)));
241 let o = !Utils.compare_terms t1 t2 in
242 let stat = (ty,t1,t2,o) in
243 let w = compute_equality_weight stat in
244 let proof = Equality.Exact p in
245 let e = Equality.mk_equality (w, proof, stat, newmetas) in
249 | C.Appl [C.MutInd (uri, _, _); ty; t1; t2]
250 when LibraryObjects.is_eq_URI uri ->
251 let ty = S.lift index ty in
252 let t1 = S.lift index t1 in
253 let t2 = S.lift index t2 in
254 let o = !Utils.compare_terms t1 t2 in
255 let stat = (ty,t1,t2,o) in
256 let w = compute_equality_weight stat in
257 let p = C.Rel index in
258 let proof = Equality.Exact p in
259 let e = Equality.mk_equality (w, proof,stat,[]) in
263 match do_find context term with
265 let tl, newmeta' = (aux (index+1) newmeta tl) in
266 if newmeta' < newmeta then
267 prerr_endline "big trouble";
268 (index, p)::tl, newmeta' (* max???? *)
270 aux (index+1) newmeta tl
273 aux (index+1) newmeta tl
275 let il, maxm = aux 1 newmeta context in
276 let indexes, equalities = List.split il in
277 (* ignore (List.iter (check_eq context "find") equalities); *)
278 indexes, equalities, maxm
283 let equations_blacklist =
285 (fun s u -> UriManager.UriSet.add (UriManager.uri_of_string u) s)
286 UriManager.UriSet.empty [
287 "cic:/Coq/Init/Logic/eq.ind#xpointer(1/1/1)";
288 "cic:/Coq/Init/Logic/trans_eq.con";
289 "cic:/Coq/Init/Logic/f_equal.con";
290 "cic:/Coq/Init/Logic/f_equal2.con";
291 "cic:/Coq/Init/Logic/f_equal3.con";
292 "cic:/Coq/Init/Logic/f_equal4.con";
293 "cic:/Coq/Init/Logic/f_equal5.con";
294 "cic:/Coq/Init/Logic/sym_eq.con";
295 "cic:/Coq/Init/Logic/eq_ind.con";
296 "cic:/Coq/Init/Logic/eq_ind_r.con";
297 "cic:/Coq/Init/Logic/eq_rec.con";
298 "cic:/Coq/Init/Logic/eq_rec_r.con";
299 "cic:/Coq/Init/Logic/eq_rect.con";
300 "cic:/Coq/Init/Logic/eq_rect_r.con";
301 "cic:/Coq/Logic/Eqdep/UIP.con";
302 "cic:/Coq/Logic/Eqdep/UIP_refl.con";
303 "cic:/Coq/Logic/Eqdep_dec/eq2eqT.con";
304 "cic:/Coq/ZArith/Zcompare/rename.con";
305 (* ALB !!!! questo e` imbrogliare, ma x ora lo lasciamo cosi`...
306 perche' questo cacchio di teorema rompe le scatole :'( *)
307 "cic:/Rocq/SUBST/comparith/mult_n_2.con";
309 "cic:/matita/logic/equality/eq_f.con";
310 "cic:/matita/logic/equality/eq_f2.con";
311 "cic:/matita/logic/equality/eq_rec.con";
312 "cic:/matita/logic/equality/eq_rect.con";
316 let equations_blacklist = UriManager.UriSet.empty;;
319 let _ = <:start<tty_of_u>> in
320 let t = CicUtil.term_of_uri u in
321 let ty, _ = CicTypeChecker.type_of_aux' [] [] t CicUniv.empty_ugraph in
322 let _ = <:stop<tty_of_u>> in
327 let t,ty = tty_of_u u in
331 let find_library_equalities dbd context status maxmeta =
332 let module C = Cic in
333 let module S = CicSubstitution in
334 let module T = CicTypeChecker in
335 let _ = <:start<equations_for_goal>> in
336 let eqs = (MetadataQuery.equations_for_goal ~dbd status) in
337 let _ = <:stop<equations_for_goal>> in
341 if LibraryObjects.is_eq_refl_URI uri ||
342 LibraryObjects.is_sym_eq_URI uri ||
343 LibraryObjects.is_trans_eq_URI uri ||
344 LibraryObjects.is_eq_ind_URI uri ||
345 LibraryObjects.is_eq_ind_r_URI uri
352 let ok_types ty menv =
353 List.for_all (fun (_, _, mt) -> mt = ty) menv
355 let rec has_vars = function
356 | C.Meta _ | C.Rel _ | C.Const _ -> false
358 | C.Appl l -> List.exists has_vars l
359 | C.Prod (_, s, t) | C.Lambda (_, s, t)
360 | C.LetIn (_, s, t) | C.Cast (s, t) ->
361 (has_vars s) || (has_vars t)
364 let rec aux newmeta = function
366 | (uri, term, termty)::tl ->
369 (Printf.sprintf "Examining: %s (%s)"
370 (CicPp.ppterm term) (CicPp.ppterm termty)));
373 | C.Prod (name, s, t) when not (has_vars termty) ->
374 let head, newmetas, args, newmeta =
375 ProofEngineHelpers.saturate_term newmeta [] context termty 0
378 if List.length args = 0 then
384 | C.Appl [C.MutInd (uri, _, _); ty; t1; t2]
385 when (LibraryObjects.is_eq_URI uri ||
386 LibraryObjects.is_eq_refl_URI uri) &&
387 (ok_types ty newmetas) ->
390 (Printf.sprintf "OK: %s" (CicPp.ppterm term)));
391 let o = !Utils.compare_terms t1 t2 in
392 let stat = (ty,t1,t2,o) in
393 let w = compute_equality_weight stat in
394 let proof = Equality.Exact p in
395 let e = Equality.mk_equality (w, proof, stat, newmetas) in
399 | C.Appl [C.MutInd (uri, _, _); ty; t1; t2]
401 (LibraryObjects.is_eq_URI uri ||
402 LibraryObjects.is_eq_refl_URI uri) &&
403 not (has_vars termty) ->
404 let o = !Utils.compare_terms t1 t2 in
405 let stat = (ty,t1,t2,o) in
406 let w = compute_equality_weight stat in
407 let proof = Equality.Exact term in
408 let e = Equality.mk_equality (w, proof, stat, []) in
414 let tl, newmeta' = aux newmeta tl in
415 if newmeta' < newmeta then
416 prerr_endline "big trouble";
417 (uri, e)::tl, newmeta' (* max???? *)
421 let found, maxm = aux maxmeta candidates in
423 let mceq = Equality.meta_convertibility_eq in
425 (fun (s, l) (u, e) ->
426 if List.exists (mceq e) (List.map snd l) then (
429 (Printf.sprintf "NO!! %s already there!"
430 (Equality.string_of_equality e)));
431 (UriManager.UriSet.add u s, l)
432 ) else (UriManager.UriSet.add u s, (u, e)::l))
433 (UriManager.UriSet.empty, []) found)
439 let find_library_theorems dbd env status equalities_uris =
440 let module C = Cic in
441 let module S = CicSubstitution in
442 let module T = CicTypeChecker in
446 if LibraryObjects.is_sym_eq_URI uri ||
447 LibraryObjects.is_trans_eq_URI uri ||
448 LibraryObjects.is_eq_ind_URI uri ||
449 LibraryObjects.is_eq_ind_r_URI uri
452 (let t,ty = tty_of_u uri in t, ty, [] )::l)
453 [] (MetadataQuery.signature_of_goal ~dbd status)
457 match LibraryObjects.eq_URI () with
461 (ProofEngineTypes.Fail
462 (lazy "No default eq defined when running find_library_theorems"))
464 let t = CicUtil.term_of_uri (LibraryObjects.eq_refl_URI ~eq) in
465 let ty, _ = CicTypeChecker.type_of_aux' [] [] t CicUniv.empty_ugraph in
468 let res = refl_equal::candidates in
473 let find_context_hypotheses env equalities_indexes =
474 let metasenv, context, ugraph = env in
481 if List.mem n equalities_indexes then
486 CicTypeChecker.type_of_aux' metasenv context t ugraph in
487 (n+1, (t, ty, [])::l))
493 let get_stats () = <:show<Inference.>> ;;