(* Copyright (C) 2000, HELM Team. * * This file is part of HELM, an Hypertextual, Electronic * Library of Mathematics, developed at the Computer Science * Department, University of Bologna, Italy. * * HELM is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * HELM is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HELM; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, * MA 02111-1307, USA. * * For details, see the HELM World-Wide-Web page, * http://cs.unibo.it/helm/. *) open Printf exception AssertFailure of string;; exception UnificationFailure of string;; let debug_print = prerr_endline let type_of_aux' metasenv subst context term = try CicMetaSubst.type_of_aux' metasenv subst context term with CicMetaSubst.MetaSubstFailure msg -> raise (AssertFailure ((sprintf "Type checking error: %s in context\n%s.\nException: %s.\nBroken invariant: unification must be invoked only on well typed terms" (CicPp.ppterm (CicMetaSubst.apply_subst subst term)) (CicMetaSubst.ppcontext subst context) msg))) (* NUOVA UNIFICAZIONE *) (* A substitution is a (int * Cic.term) list that associates a metavariable i with its body. A metaenv is a (int * Cic.term) list that associate a metavariable i with is type. fo_unif_new takes a metasenv, a context, two terms t1 and t2 and gives back a new substitution which is _NOT_ unwinded. It must be unwinded before applying it. *) let rec fo_unif_subst subst context metasenv t1 t2 = let module C = Cic in let module R = CicMetaSubst in let module S = CicSubstitution in match (t1, t2) with (C.Meta (n,ln), C.Meta (m,lm)) when n=m -> let ok = List.fold_left2 (fun b t1 t2 -> b && match t1,t2 with None,_ | _,None -> true | Some t1', Some t2' -> (* First possibility: restriction *) (* Second possibility: unification *) (* Third possibility: convertibility *) R.are_convertible metasenv subst context t1' t2' ) true ln lm in if ok then subst,metasenv else raise (UnificationFailure (sprintf "Error trying to unify %s with %s: the algorithm only tried to check convertibility of the two substitutions" (CicPp.ppterm t1) (CicPp.ppterm t2))) | (C.Meta (n,l), C.Meta (m,_)) when n>m -> fo_unif_subst subst context metasenv t2 t1 | (C.Meta (n,l), t) | (t, C.Meta (n,l)) -> let subst',metasenv' = try let oldt = (List.assoc n subst) in let lifted_oldt = S.lift_meta l oldt in fo_unif_subst subst context metasenv lifted_oldt t with Not_found -> let t',metasenv' = CicMetaSubst.delift n subst context metasenv l t in (n, t')::subst, metasenv' in let (_,_,meta_type) = CicUtil.lookup_meta n metasenv' in let tyt = type_of_aux' metasenv' subst' context t in fo_unif_subst subst' context metasenv' (S.lift_meta l meta_type) tyt | (C.Var (uri1,exp_named_subst1),C.Var (uri2,exp_named_subst2)) | (C.Const (uri1,exp_named_subst1),C.Const (uri2,exp_named_subst2)) -> if UriManager.eq uri1 uri2 then fo_unif_subst_exp_named_subst subst context metasenv exp_named_subst1 exp_named_subst2 else raise (UnificationFailure (sprintf "Can't unify %s with %s due to different constants" (CicPp.ppterm t1) (CicPp.ppterm t1))) | C.MutInd (uri1,i1,exp_named_subst1),C.MutInd (uri2,i2,exp_named_subst2) -> if UriManager.eq uri1 uri2 && i1 = i2 then fo_unif_subst_exp_named_subst subst context metasenv exp_named_subst1 exp_named_subst2 else raise (UnificationFailure (sprintf "Can't unify %s with %s due to different inductive principles" (CicPp.ppterm t1) (CicPp.ppterm t1))) | C.MutConstruct (uri1,i1,j1,exp_named_subst1), C.MutConstruct (uri2,i2,j2,exp_named_subst2) -> if UriManager.eq uri1 uri2 && i1 = i2 && j1 = j2 then fo_unif_subst_exp_named_subst subst context metasenv exp_named_subst1 exp_named_subst2 else raise (UnificationFailure (sprintf "Can't unify %s with %s due to different inductive constructors" (CicPp.ppterm t1) (CicPp.ppterm t1))) | (C.Implicit, _) | (_, C.Implicit) -> assert false | (C.Cast (te,ty), t2) -> fo_unif_subst subst context metasenv te t2 | (t1, C.Cast (te,ty)) -> fo_unif_subst subst context metasenv t1 te | (C.Prod (n1,s1,t1), C.Prod (_,s2,t2)) -> let subst',metasenv' = fo_unif_subst subst context metasenv s1 s2 in fo_unif_subst subst' ((Some (n1,(C.Decl s1)))::context) metasenv' t1 t2 | (C.Lambda (n1,s1,t1), C.Lambda (_,s2,t2)) -> let subst',metasenv' = fo_unif_subst subst context metasenv s1 s2 in fo_unif_subst subst' ((Some (n1,(C.Decl s1)))::context) metasenv' t1 t2 | (C.LetIn (_,s1,t1), t2) | (t2, C.LetIn (_,s1,t1)) -> fo_unif_subst subst context metasenv t2 (S.subst s1 t1) | (C.Appl l1, C.Appl l2) -> let lr1 = List.rev l1 in let lr2 = List.rev l2 in let rec fo_unif_l subst metasenv = function [],_ | _,[] -> assert false | ([h1],[h2]) -> fo_unif_subst subst context metasenv h1 h2 | ([h],l) | (l,[h]) -> fo_unif_subst subst context metasenv h (C.Appl (List.rev l)) | ((h1::l1),(h2::l2)) -> let subst', metasenv' = fo_unif_subst subst context metasenv h1 h2 in fo_unif_l subst' metasenv' (l1,l2) in fo_unif_l subst metasenv (lr1, lr2) | (C.MutCase (_,_,outt1,t1,pl1), C.MutCase (_,_,outt2,t2,pl2))-> let subst', metasenv' = fo_unif_subst subst context metasenv outt1 outt2 in let subst'',metasenv'' = fo_unif_subst subst' context metasenv' t1 t2 in List.fold_left2 (function (subst,metasenv) -> fo_unif_subst subst context metasenv ) (subst'',metasenv'') pl1 pl2 | (C.Rel _, _) | (_, C.Rel _) | (C.Sort _ ,_) | (_, C.Sort _) | (C.Const _, _) | (_, C.Const _) | (C.MutInd _, _) | (_, C.MutInd _) | (C.MutConstruct _, _) | (_, C.MutConstruct _) | (C.Fix _, _) | (_, C.Fix _) | (C.CoFix _, _) | (_, C.CoFix _) -> if R.are_convertible metasenv subst context t1 t2 then subst, metasenv else raise (UnificationFailure (sprintf "Can't unify %s with %s because they are not convertible" (CicPp.ppterm t1) (CicPp.ppterm t2))) | (_,_) -> if R.are_convertible metasenv subst context t1 t2 then subst, metasenv else raise (UnificationFailure (sprintf "Can't unify %s with %s because they are not convertible" (CicPp.ppterm t1) (CicPp.ppterm t2))) and fo_unif_subst_exp_named_subst subst context metasenv exp_named_subst1 exp_named_subst2 = try List.fold_left2 (fun (subst,metasenv) (uri1,t1) (uri2,t2) -> assert (uri1=uri2) ; fo_unif_subst subst context metasenv t1 t2 ) (subst,metasenv) exp_named_subst1 exp_named_subst2 with e -> let uri = UriManager.uri_of_string "cic:/dummy.var" in debug_print ("@@@: " ^ CicPp.ppterm (Cic.Var (uri,exp_named_subst1)) ^ " <==> " ^ CicPp.ppterm (Cic.Var (uri,exp_named_subst2))) ; raise e (* A substitution is a (int * Cic.term) list that associates a *) (* metavariable i with its body. *) (* metasenv is of type Cic.metasenv *) (* fo_unif takes a metasenv, a context, two terms t1 and t2 and gives back *) (* a new substitution which is already unwinded and ready to be applied and *) (* a new metasenv in which some hypothesis in the contexts of the *) (* metavariables may have been restricted. *) let fo_unif metasenv context t1 t2 = let subst_to_unwind,metasenv' = fo_unif_subst [] context metasenv t1 t2 in CicMetaSubst.unwind_subst metasenv' subst_to_unwind ;; let fo_unif_subst subst context metasenv t1 t2 = let enrich_msg msg = sprintf "Unification error unifying %s of type %s with %s of type %s in context\n%s\nand metasenv\n%s\nbecause %s" (CicPp.ppterm (CicMetaSubst.apply_subst subst t1)) (try CicPp.ppterm (type_of_aux' metasenv subst context t1) with _ -> "MALFORMED") (CicPp.ppterm (CicMetaSubst.apply_subst subst t2)) (try CicPp.ppterm (type_of_aux' metasenv subst context t2) with _ -> "MALFORMED") (CicMetaSubst.ppcontext subst context) (CicMetaSubst.ppmetasenv subst metasenv) msg in try fo_unif_subst subst context metasenv t1 t2 with | AssertFailure msg -> raise (AssertFailure (enrich_msg msg)) | UnificationFailure msg -> raise (UnificationFailure (enrich_msg msg)) ;;