1 (* Copyright (C) 2004, 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/
30 let symbol_table = Hashtbl.create 1024
32 let sort_of_string = function
40 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
42 | Cic.Constant _ -> assert false
43 | Cic.Variable _ -> assert false
44 | Cic.CurrentProof _ -> assert false
45 | Cic.InductiveDefinition (l,_,_) -> l
47 let name_of_inductive_type uri i =
48 let types = get_types uri in
49 let (name, _, _, _) = try List.nth types i with Not_found -> assert false in
52 (* returns <name, type> pairs *)
53 let constructors_of_inductive_type uri i =
54 let types = get_types uri in
55 let (_, _, _, constructors) =
56 try List.nth types i with Not_found -> assert false
60 (* returns name only *)
61 let constructor_of_inductive_type uri i j =
63 fst (List.nth (constructors_of_inductive_type uri i) (j-1))
64 with Not_found -> assert false)
66 let ast_of_acic ids_to_inner_sorts acic =
67 let ids_to_uris = Hashtbl.create 503 in
68 let register_uri id uri = Hashtbl.add ids_to_uris id uri in
71 sort_of_string (Hashtbl.find ids_to_inner_sorts id)
72 with Not_found -> assert false
74 let idref id t = Ast.AttributedTerm (`IdRef id, t) in
77 | Cic.ARel (id,_,_,b) -> idref id (Ast.Ident (b, None))
78 | Cic.AVar (id,uri,subst) ->
79 register_uri id (UriManager.string_of_uri uri);
81 (Ast.Ident (UriManager.name_of_uri uri, astsubst_of_cicsubst subst))
82 | Cic.AMeta (id,n,l) -> idref id (Ast.Meta (n, astcontext_of_ciccontext l))
83 | Cic.ASort (id,Cic.Prop) -> idref id (Ast.Sort `Prop)
84 | Cic.ASort (id,Cic.Set) -> idref id (Ast.Sort `Set)
85 | Cic.ASort (id,Cic.Type _) -> idref id (Ast.Sort `Type) (* TASSI *)
86 | Cic.ASort (id,Cic.CProp) -> idref id (Ast.Sort `CProp)
87 | Cic.AImplicit _ -> assert false
88 | Cic.AProd (id,n,s,t) ->
90 match sort_of_id id with
92 | `Prop | `CProp -> `Forall
94 idref id (Ast.Binder (binder_kind, (n, Some (aux s)), aux t))
95 | Cic.ACast (id,v,t) ->
96 idref id (Ast.Appl [idref id (Ast.Symbol ("cast", -1)); aux v; aux t])
97 | Cic.ALambda (id,n,s,t) ->
98 idref id (Ast.Binder (`Lambda, (n, Some (aux s)), aux t))
99 | Cic.ALetIn (id,n,s,t) -> idref id (Ast.LetIn ((n, None), aux s, aux t))
100 | Cic.AAppl (aid,Cic.AConst (sid,uri,subst)::tl) ->
101 let uri_str = UriManager.string_of_uri uri in
102 register_uri sid uri_str;
104 let f = Hashtbl.find symbol_table uri_str in
109 (Ast.Ident (UriManager.name_of_uri uri,
110 astsubst_of_cicsubst subst)) :: (List.map aux tl))))
111 | Cic.AAppl (aid,Cic.AMutInd (sid,uri,i,subst)::tl) ->
112 let name = name_of_inductive_type uri i in
113 let uri_str = UriManager.string_of_uri uri in
115 uri_str ^ "#xpointer(1/" ^ (string_of_int (i + 1)) ^ ")" in
116 register_uri sid puri_str;
118 (let f = Hashtbl.find symbol_table puri_str in
124 astsubst_of_cicsubst subst)) :: (List.map aux tl))))
125 | Cic.AAppl (id,li) -> idref id (Ast.Appl (List.map aux li))
126 | Cic.AConst (id,uri,subst) ->
127 let uri_str = UriManager.string_of_uri uri in
128 register_uri id uri_str;
130 let f = Hashtbl.find symbol_table uri_str in
135 (UriManager.name_of_uri uri, astsubst_of_cicsubst subst)))
136 | Cic.AMutInd (id,uri,i,subst) ->
137 let name = name_of_inductive_type uri i in
138 let uri_str = UriManager.string_of_uri uri in
140 uri_str ^ "#xpointer(1/" ^ (string_of_int (i + 1)) ^ ")" in
141 register_uri id puri_str;
143 let f = Hashtbl.find symbol_table puri_str in
146 idref id (Ast.Ident (name, astsubst_of_cicsubst subst)))
147 | Cic.AMutConstruct (id,uri,i,j,subst) ->
148 let name = constructor_of_inductive_type uri i j in
149 let uri_str = UriManager.string_of_uri uri in
150 let puri_str = sprintf "%s#xpointer(1/%d/%d)" uri_str (i + 1) j in
151 register_uri id puri_str;
153 let f = Hashtbl.find symbol_table puri_str in
156 idref id (Ast.Ident (name, astsubst_of_cicsubst subst)))
157 | Cic.AMutCase (id,uri,typeno,ty,te,patterns) ->
158 let name = name_of_inductive_type uri typeno in
159 let constructors = constructors_of_inductive_type uri typeno in
160 let rec eat_branch ty pat =
162 | Cic.Prod (_, _, t), Cic.ALambda (_, name, s, t') ->
163 let (cv, rhs) = eat_branch t t' in
164 (name, Some (aux s)) :: cv, rhs
165 | _, _ -> [], aux pat
169 (fun (name, ty) pat ->
170 let (capture_variables, rhs) = eat_branch ty pat in
171 ((name, capture_variables), rhs))
172 constructors patterns
174 idref id (Ast.Case (aux te, Some name, Some (aux ty), patterns))
175 | Cic.AFix (id, no, funs) ->
178 (fun (_, n, decr_idx, ty, bo) ->
179 ((Cic.Name n, Some (aux ty)), aux bo, decr_idx))
184 (match List.nth defs no with
185 | (Cic.Name n, _), _, _ -> n
187 with Not_found -> assert false
189 idref id (Ast.LetRec (`Inductive, defs, Ast.Ident (name, None)))
190 | Cic.ACoFix (id, no, funs) ->
193 (fun (_, n, ty, bo) -> ((Cic.Name n, Some (aux ty)), aux bo, 0))
198 (match List.nth defs no with
199 | (Cic.Name n, _), _, _ -> n
201 with Not_found -> assert false
203 idref id (Ast.LetRec (`CoInductive, defs, Ast.Ident (name, None)))
205 and astsubst_of_cicsubst subst =
207 (List.map (fun (uri, annterm) ->
208 (UriManager.name_of_uri uri, aux annterm))
211 and astcontext_of_ciccontext context =
215 | Some annterm -> Some (aux annterm))
219 aux acic, ids_to_uris
221 let _ = (** fill symbol_table *)
222 let add_symbol name uri =
223 Hashtbl.add symbol_table uri
224 (fun aid sid args acic2ast ->
225 Ast.AttributedTerm (`IdRef aid,
226 Ast.Appl (Ast.AttributedTerm (`IdRef sid, Ast.Symbol (name, -1)) ::
227 List.map acic2ast args)))
230 Hashtbl.add symbol_table HelmLibraryObjects.Logic.eq_XURI
231 (fun aid sid args acic2ast ->
232 Ast.AttributedTerm (`IdRef aid,
234 Ast.AttributedTerm (`IdRef sid, Ast.Symbol ("eq", -1)) ::
235 List.map acic2ast (List.tl args))));
237 Hashtbl.add symbol_table HelmLibraryObjects.Logic.ex_XURI
238 (fun aid sid args acic2ast ->
239 match (List.tl args) with
240 [Cic.ALambda (_,Cic.Name n,s,t)] ->
241 Ast.AttributedTerm (`IdRef aid,
242 Ast.Binder (`Exists, (Cic.Name n, Some (acic2ast s)), acic2ast t))
243 | _ -> raise Not_found);
244 add_symbol "and" HelmLibraryObjects.Logic.and_XURI;
245 add_symbol "or" HelmLibraryObjects.Logic.or_XURI;
246 add_symbol "iff" HelmLibraryObjects.Logic.iff_SURI;
247 add_symbol "not" HelmLibraryObjects.Logic.not_SURI;
248 add_symbol "inv" HelmLibraryObjects.Reals.rinv_SURI;
249 add_symbol "opp" HelmLibraryObjects.Reals.ropp_SURI;
250 add_symbol "leq" HelmLibraryObjects.Peano.le_XURI;
251 add_symbol "leq" HelmLibraryObjects.Reals.rle_SURI;
252 add_symbol "lt" HelmLibraryObjects.Peano.lt_SURI;
253 add_symbol "lt" HelmLibraryObjects.Reals.rlt_SURI;
254 add_symbol "geq" HelmLibraryObjects.Peano.ge_SURI;
255 add_symbol "geq" HelmLibraryObjects.Reals.rge_SURI;
256 add_symbol "gt" HelmLibraryObjects.Peano.gt_SURI;
257 add_symbol "gt" HelmLibraryObjects.Reals.rgt_SURI;
258 add_symbol "plus" HelmLibraryObjects.Peano.plus_SURI;
259 add_symbol "plus" HelmLibraryObjects.BinInt.zplus_SURI;
260 add_symbol "times" HelmLibraryObjects.Peano.mult_SURI;
261 add_symbol "times" HelmLibraryObjects.Reals.rmult_SURI;
262 add_symbol "minus" HelmLibraryObjects.Peano.minus_SURI;
263 add_symbol "minus" HelmLibraryObjects.Reals.rminus_SURI;
264 add_symbol "div" HelmLibraryObjects.Reals.rdiv_SURI;
265 Hashtbl.add symbol_table HelmLibraryObjects.Reals.r0_SURI
266 (fun aid sid args acic2ast ->
267 Ast.AttributedTerm (`IdRef sid, Ast.Num ("0", -1)));
268 Hashtbl.add symbol_table HelmLibraryObjects.Reals.r1_SURI
269 (fun aid sid args acic2ast ->
270 Ast.AttributedTerm (`IdRef sid, Ast.Num ("1", -1)));
272 Hashtbl.add symbol_table HelmLibraryObjects.Reals.rplus_SURI
273 (fun aid sid args acic2ast ->
275 Ast.AttributedTerm (`IdRef aid,
277 Ast.AttributedTerm (`IdRef sid, Ast.Symbol ("plus", -1)) ::
278 List.map acic2ast args))
280 let rec aux acc = function
281 | [ Cic.AConst (nid, uri, []); n] when
282 UriManager.eq uri HelmLibraryObjects.Reals.r1_URI ->
284 | Cic.AConst (_, uri, []) when
285 UriManager.eq uri HelmLibraryObjects.Reals.r1_URI ->
286 Ast.AttributedTerm (`IdRef aid,
287 Ast.Num (string_of_int (acc + 2), -1))
288 | Cic.AAppl (_, Cic.AConst (_, uri, []) :: args) when
289 UriManager.eq uri HelmLibraryObjects.Reals.rplus_URI ->