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://helm.cs.unibo.it/
28 type coerc_carr = Uri of UriManager.uri | Sort of Cic.sort | Term of Cic.term
29 exception EqCarrNotImplemented of string Lazy.t
30 exception EqCarrOnNonMetaClosed
34 let coerc_carr_of_term t =
39 | t -> Uri (CicUtil.uri_of_term t)
40 with Invalid_argument _ ->
44 let uri_of_carr = function
48 let rec name_of_carr = function
49 | Uri u -> UriManager.name_of_uri u
50 | Sort s -> CicPp.ppsort s
51 | Term (Cic.Appl ((Cic.Const (uri, _))::_))
52 | Term (Cic.Appl ((Cic.MutInd (uri, _, _))::_))
53 | Term (Cic.Appl ((Cic.MutConstruct (uri, _, _, _))::_)) ->
54 UriManager.name_of_uri uri
55 | Term (Cic.Prod (_,_,t)) -> name_of_carr (Term t)
57 prerr_endline ("CoercDb.name_of_carr:" ^ CicPp.ppterm t);
62 | Uri src, Uri tgt -> UriManager.eq src tgt
63 | Sort (Cic.Type _), Sort (Cic.Type _) -> true
64 | Sort src, Sort tgt when src = tgt -> true
68 if CicUtil.is_meta_closed t1 && CicUtil.is_meta_closed t2 then
71 (lazy ("Unsupported carr for coercions: " ^
72 CicPp.ppterm t1 ^ " or " ^ CicPp.ppterm t2)))
73 else raise EqCarrOnNonMetaClosed
79 let rec myfilter p = function
82 let l = List.filter (fun u -> not (p (s,t,u))) l in
83 if l = [] then myfilter p tl else (s,t,l)::myfilter p tl
86 let remove_coercion p = db := myfilter p !db;;
92 (List.filter (fun (s,t,_) -> f (s,t)) !db))
96 List.exists (fun (_,_,xl) -> List.exists (UriManager.eq u) xl) !db
102 List.find (fun (_,_,xl) -> List.exists (UriManager.eq uri) xl) !db
105 with Not_found -> assert false (* uri must be a coercion *)
108 let term_of_carr = function
109 | Uri u -> CicUtil.term_of_uri u
110 | Sort s -> Cic.Sort s
111 | Term _ -> assert false
114 let add_coercion (src,tgt,u) =
115 let f s t = eq_carr s src && eq_carr t tgt in
116 let where = List.filter (fun (s,t,_) -> f s t) !db in
117 let rest = List.filter (fun (s,t,_) -> not (f s t)) !db in
119 | [] -> db := (src,tgt,[u]) :: !db
121 assert (tl = []); (* not sure, this may be a feature *)
122 db := (src,tgt,u::l)::tl @ rest