(* ||M|| This file is part of HELM, an Hypertextual, Electronic ||A|| Library of Mathematics, developed at the Computer Science ||T|| Department, University of Bologna, Italy. ||I|| ||T|| HELM is free software; you can redistribute it and/or ||A|| modify it under the terms of the GNU General Public License \ / version 2 or (at your option) any later version. \ / This software is distributed as is, NO WARRANTY. V_______________________________________________________________ *) (* $Id: nCicRefiner.mli 9227 2008-11-21 16:00:06Z tassi $ *) let debug s = prerr_endline (Lazy.force s);; let debug _ = ();; module COT : Set.OrderedType with type t = NCic.term * int * int * NCic.term * NCic.term = struct type t = NCic.term * int * int * NCic.term * NCic.term let compare = Pervasives.compare end module CoercionSet = Set.Make(COT) module DB = Discrimination_tree.Make(NDiscriminationTree.NCicIndexable)(CoercionSet) type db = DB.t * DB.t let empty_db = DB.empty,DB.empty class status = object inherit NCicUnifHint.status val db = empty_db method coerc_db = db method set_coerc_db v = {< db = v >} method set_coercion_status : 'status. < coerc_db : db; uhint_db: NCicUnifHint.db; .. > as 'status -> 'self = fun o -> {< db = o#coerc_db >}#set_unifhint_status o end let index_coercion status c src tgt arity arg = let db_src,db_tgt = status#coerc_db in let data = (c,arity,arg,src,tgt) in let debug s = prerr_endline (Lazy.force s) in debug (lazy ("INDEX:" ^ NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] src ^ " ===> " ^ NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] tgt ^ " := " ^ NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] c ^ " " ^ string_of_int arg ^ " " ^ string_of_int arity)); let db_src = DB.index db_src src data in let db_tgt = DB.index db_tgt tgt data in status#set_coerc_db (db_src, db_tgt) ;; let index_old_db odb (status : #status) = List.fold_left (fun status (_,tgt,clist) -> List.fold_left (fun status (uri,_,arg) -> try let c=fst (OCic2NCic.convert_term uri (CicUtil.term_of_uri uri)) in let arity = match tgt with | CoercDb.Fun i -> i | _ -> 0 in let src, tgt = let cty = NCicTypeChecker.typeof ~subst:[] ~metasenv:[] [] c in let scty, metasenv,_ = NCicMetaSubst.saturate ~delta:max_int [] [] [] cty (arity+1) in match scty with | NCic.Prod (_, src, tgt) -> let tgt = NCicSubstitution.subst (NCic.Meta (-1,(0,NCic.Irl 0))) tgt in (* debug (lazy (Printf.sprintf "indicizzo %s (%d)) : %s ===> %s" (NCicPp.ppterm ~metasenv ~subst:[] ~context:[] scty) (arity+1) (NCicPp.ppterm ~metasenv ~subst:[] ~context:[] src) (NCicPp.ppterm ~metasenv ~subst:[] ~context:[] tgt)); *) src, tgt | t -> debug (lazy ( NCicPp.ppterm ~metasenv ~subst:[] ~context:[] t)); assert false in index_coercion status c src tgt arity arg with | NCicEnvironment.BadDependency _ | NCicTypeChecker.TypeCheckerFailure _ -> status) status clist) status (CoercDb.to_list odb) ;; let look_for_coercion status metasenv subst context infty expty = let db_src,db_tgt = status#coerc_db in match infty, expty with | (NCic.Meta _ | NCic.Appl (NCic.Meta _::_)), (NCic.Meta _ | NCic.Appl (NCic.Meta _::_)) -> [] | _ -> debug (lazy ("LOOK FOR COERCIONS: " ^ NCicPp.ppterm ~metasenv ~subst ~context infty ^ " |===> " ^ NCicPp.ppterm ~metasenv ~subst ~context expty)); let src_class = infty :: NCicUnifHint.eq_class_of status infty in let tgt_class = expty :: NCicUnifHint.eq_class_of status expty in let set_src = List.fold_left (fun set infty -> CoercionSet.union (DB.retrieve_unifiables db_src infty) set) CoercionSet.empty src_class in let set_tgt = List.fold_left (fun set expty -> CoercionSet.union (DB.retrieve_unifiables db_tgt expty) set) CoercionSet.empty tgt_class in let candidates = CoercionSet.inter set_src set_tgt in debug (lazy ("CANDIDATES: " ^ String.concat "," (List.map (fun (t,_,_,_,_) -> NCicPp.ppterm ~metasenv ~subst ~context t) (CoercionSet.elements candidates)))); List.map (fun (t,arity,arg,_,_) -> let ty = try NCicTypeChecker.typeof ~metasenv:[] ~subst:[] [] t with NCicTypeChecker.TypeCheckerFailure s -> prerr_endline ("illtyped coercion: "^Lazy.force s); prerr_endline (NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] t); assert false in let ty, metasenv, args = NCicMetaSubst.saturate ~delta:max_int metasenv subst context ty arity in debug (lazy ( NCicPp.ppterm ~metasenv ~subst:[] ~context:[] ty ^ " --- " ^ NCicPp.ppterm ~metasenv ~subst ~context (NCicUntrusted.mk_appl t args) ^ " --- " ^ string_of_int (List.length args) ^ " == " ^ string_of_int arg)); metasenv, NCicUntrusted.mk_appl t args, ty, List.nth args arg) (CoercionSet.elements candidates) ;; (* CSC: very inefficient implementation! Enrico, can we use a discrimination tree here? *) let match_coercion status ~metasenv ~subst ~context t = let db = DB.fold (fst (status#coerc_db)) (fun _ v l -> (CoercionSet.elements v)@l) [] in (HExtlib.list_findopt (fun (p,arity,cpos,_,_) _ -> try let t = match p,t with NCic.Appl lp, NCic.Appl lt -> (match fst (HExtlib.split_nth (List.length lp) lt) with [t] -> t | l -> NCic.Appl l) | _,NCic.Appl (he::_) -> he | _,_ -> t in let b = NCicReduction.alpha_eq metasenv subst context p t in if not b then None else let ty = NCicTypeChecker.typeof ~metasenv:[] ~subst:[] [] p in let pis = let rec aux = function NCic.Prod (_,_,t) -> 1+aux t | _ -> 0 in aux ty in Some (p,pis - arity - cpos - 1,cpos) with Failure _ -> None (* raised by split_nth *) ) db) ;; let generate_dot_file status = let module Pp = GraphvizPp.Dot in let buf = Buffer.create 10240 in let fmt = Format.formatter_of_buffer buf in Pp.header ~node_attrs:["fontsize", "9"; "width", ".4"; "height", ".4"] ~edge_attrs:["fontsize", "10"] fmt; let src_db, _ = status#coerc_db in let edges = ref [] in DB.iter src_db (fun _ dataset -> edges := !edges @ List.map (fun (t,a,g,sk,dk) -> prerr_endline (let p = NCicPp.ppterm ~metasenv:[] ~context:[] ~subst:[] in p t ^ " ::: " ^ p sk ^ " |--> " ^ p dk); let eq_s=List.sort compare (sk::NCicUnifHint.eq_class_of status sk) in let eq_t=List.sort compare (dk::NCicUnifHint.eq_class_of status dk) in (t,a,g),eq_s,eq_t ) (CoercionSet.elements dataset); ); let nodes = HExtlib.list_uniq (List.sort compare (List.flatten (List.map (fun (_,a,b) -> [a;b] ) !edges))) in let names = ref [] in let id = ref 0 in let mangle l = try List.assoc l !names with Not_found -> incr id; names := (l,"node"^string_of_int!id) :: !names; List.assoc l !names in List.iter (fun cl -> Pp.node (mangle cl) ~attrs:["label",String.concat "\\n" (List.map (fun t-> NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] t ~margin:max_int ) cl)] fmt) nodes; List.iter (fun ((t,a,b),src,tgt) -> Pp.edge (mangle src) (mangle tgt) ~attrs:["label", NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] t] fmt) !edges; Pp.trailer fmt; Buffer.contents buf ;;