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/
30 module Ast = CicNotationPt
33 let debug_print s = if debug then prerr_endline (Lazy.force s) else ()
35 type interpretation_id = int
37 let idref id t = Ast.AttributedTerm (`IdRef id, t)
40 { sort: (Cic.id, Ast.sort_kind) Hashtbl.t;
41 uri: (Cic.id, UriManager.uri) Hashtbl.t;
45 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
47 | Cic.InductiveDefinition (l,_,_,_) -> l
50 let name_of_inductive_type uri i =
51 let types = get_types uri in
52 let (name, _, _, _) = try List.nth types i with Not_found -> assert false in
55 (* returns <name, type> pairs *)
56 let constructors_of_inductive_type uri i =
57 let types = get_types uri in
58 let (_, _, _, constructors) =
59 try List.nth types i with Not_found -> assert false
63 (* returns name only *)
64 let constructor_of_inductive_type uri i j =
66 fst (List.nth (constructors_of_inductive_type uri i) (j-1))
67 with Not_found -> assert false)
69 let hide_coercions = ref true;;
71 let ast_of_acic0 term_info acic k =
72 let k = k term_info in
73 let id_to_uris = term_info.uri in
74 let register_uri id uri = Hashtbl.add id_to_uris id uri in
77 Hashtbl.find term_info.sort id
79 prerr_endline (sprintf "warning: sort of id %s not found, using Type" id);
80 `Type (CicUniv.fresh ())
82 let aux_substs substs =
85 (fun (uri, annterm) -> (UriManager.name_of_uri uri, k annterm))
88 let aux_context context =
92 | Some annterm -> Some (k annterm))
96 | Cic.ARel (id,_,_,b) -> idref id (Ast.Ident (b, None))
97 | Cic.AVar (id,uri,substs) ->
99 idref id (Ast.Ident (UriManager.name_of_uri uri, aux_substs substs))
100 | Cic.AMeta (id,n,l) -> idref id (Ast.Meta (n, aux_context l))
101 | Cic.ASort (id,Cic.Prop) -> idref id (Ast.Sort `Prop)
102 | Cic.ASort (id,Cic.Set) -> idref id (Ast.Sort `Set)
103 | Cic.ASort (id,Cic.Type u) -> idref id (Ast.Sort (`Type u))
104 | Cic.ASort (id,Cic.CProp) -> idref id (Ast.Sort `CProp)
105 | Cic.AImplicit (id, Some `Hole) -> idref id Ast.UserInput
106 | Cic.AImplicit (id, _) -> idref id Ast.Implicit
107 | Cic.AProd (id,n,s,t) ->
109 match sort_of_id id with
110 | `Set | `Type _ -> `Pi
111 | `Prop | `CProp -> `Forall
113 idref id (Ast.Binder (binder_kind,
114 (CicNotationUtil.name_of_cic_name n, Some (k s)), k t))
115 | Cic.ACast (id,v,t) -> idref id (Ast.Cast (k v, k t))
116 | Cic.ALambda (id,n,s,t) ->
117 idref id (Ast.Binder (`Lambda,
118 (CicNotationUtil.name_of_cic_name n, Some (k s)), k t))
119 | Cic.ALetIn (id,n,s,t) ->
120 idref id (Ast.LetIn ((CicNotationUtil.name_of_cic_name n, None),
122 | Cic.AAppl (aid,(Cic.AConst _ as he::tl as args))
123 | Cic.AAppl (aid,(Cic.AMutInd _ as he::tl as args))
124 | Cic.AAppl (aid,(Cic.AMutConstruct _ as he::tl as args)) ->
125 if CoercGraph.is_a_coercion (Deannotate.deannotate_term he) &&
134 idref aid (k (last tl))
136 idref aid (Ast.Appl (List.map k args))
137 | Cic.AAppl (aid,args) ->
138 idref aid (Ast.Appl (List.map k args))
139 | Cic.AConst (id,uri,substs) ->
141 idref id (Ast.Ident (UriManager.name_of_uri uri, aux_substs substs))
142 | Cic.AMutInd (id,uri,i,substs) ->
143 let name = name_of_inductive_type uri i in
144 let uri_str = UriManager.string_of_uri uri in
145 let puri_str = sprintf "%s#xpointer(1/%d)" uri_str (i+1) in
146 register_uri id (UriManager.uri_of_string puri_str);
147 idref id (Ast.Ident (name, aux_substs substs))
148 | Cic.AMutConstruct (id,uri,i,j,substs) ->
149 let name = constructor_of_inductive_type uri i j in
150 let uri_str = UriManager.string_of_uri uri in
151 let puri_str = sprintf "%s#xpointer(1/%d/%d)" uri_str (i + 1) j in
152 register_uri id (UriManager.uri_of_string puri_str);
153 idref id (Ast.Ident (name, aux_substs substs))
154 | Cic.AMutCase (id,uri,typeno,ty,te,patterns) ->
155 let name = name_of_inductive_type uri typeno in
156 let uri_str = UriManager.string_of_uri uri in
157 let puri_str = sprintf "%s#xpointer(1/%d)" uri_str (typeno+1) in
159 UriManager.uri_of_string
160 (sprintf "%s#xpointer(1/%d/%d)" uri_str (typeno+1) j)
162 let case_indty = name, Some (UriManager.uri_of_string puri_str) in
163 let constructors = constructors_of_inductive_type uri typeno in
164 let rec eat_branch ty pat =
166 | Cic.Prod (_, _, t), Cic.ALambda (_, name, s, t') ->
167 let (cv, rhs) = eat_branch t t' in
168 (CicNotationUtil.name_of_cic_name name, Some (k s)) :: cv, rhs
175 (fun (name, ty) pat ->
177 let (capture_variables, rhs) = eat_branch ty pat in
178 ((name, Some (ctor_puri !j), capture_variables), rhs))
179 constructors patterns
180 with Invalid_argument _ -> assert false
182 idref id (Ast.Case (k te, Some case_indty, Some (k ty), patterns))
183 | Cic.AFix (id, no, funs) ->
186 (fun (_, n, decr_idx, ty, bo) ->
187 ((Ast.Ident (n, None), Some (k ty)), k bo, decr_idx))
192 (match List.nth defs no with
193 | (Ast.Ident (n, _), _), _, _ when n <> "_" -> n
195 with Not_found -> assert false
197 idref id (Ast.LetRec (`Inductive, defs, Ast.Ident (name, None)))
198 | Cic.ACoFix (id, no, funs) ->
201 (fun (_, n, ty, bo) ->
202 ((Ast.Ident (n, None), Some (k ty)), k bo, 0))
207 (match List.nth defs no with
208 | (Ast.Ident (n, _), _), _, _ when n <> "_" -> n
210 with Not_found -> assert false
212 idref id (Ast.LetRec (`CoInductive, defs, Ast.Ident (name, None)))
216 (* persistent state *)
218 let level2_patterns32 = Hashtbl.create 211
219 let interpretations = Hashtbl.create 211 (* symb -> id list ref *)
221 let compiled32 = ref None
222 let pattern32_matrix = ref []
224 let get_compiled32 () =
225 match !compiled32 with
226 | None -> assert false
227 | Some f -> Lazy.force f
229 let set_compiled32 f = compiled32 := Some f
232 List.fold_right (fun idref t -> Ast.AttributedTerm (`IdRef idref, t))
234 let instantiate32 term_info idrefs env symbol args =
235 let rec instantiate_arg = function
236 | Ast.IdentArg (n, name) ->
237 let t = (try List.assoc name env with Not_found -> assert false) in
238 let rec count_lambda = function
239 | Ast.AttributedTerm (_, t) -> count_lambda t
240 | Ast.Binder (`Lambda, _, body) -> 1 + count_lambda body
243 let rec add_lambda t n =
245 let name = CicNotationUtil.fresh_name () in
246 Ast.Binder (`Lambda, (Ast.Ident (name, None), None),
247 Ast.Appl [add_lambda t (n - 1); Ast.Ident (name, None)])
251 add_lambda t (n - count_lambda t)
254 let symbol = Ast.Symbol (symbol, 0) in
255 add_idrefs idrefs symbol
257 if args = [] then head
258 else Ast.Appl (head :: List.map instantiate_arg args)
260 let rec ast_of_acic1 term_info annterm =
261 let id_to_uris = term_info.uri in
262 let register_uri id uri = Hashtbl.add id_to_uris id uri in
263 match (get_compiled32 ()) annterm with
264 | None -> ast_of_acic0 term_info annterm ast_of_acic1
265 | Some (env, ctors, pid) ->
269 let idref = CicUtil.id_of_annterm annterm in
272 (CicUtil.uri_of_term (Deannotate.deannotate_term annterm))
273 with Invalid_argument _ -> ());
278 List.map (fun (name, term) -> (name, ast_of_acic1 term_info term)) env
280 let _, symbol, args, _ =
282 Hashtbl.find level2_patterns32 pid
283 with Not_found -> assert false
285 let ast = instantiate32 term_info idrefs env' symbol args in
286 Ast.AttributedTerm (`IdRef (CicUtil.id_of_annterm annterm), ast)
288 let load_patterns32 t =
290 HExtlib.filter_map (function (true, ap, id) -> Some (ap, id) | _ -> None) t
292 set_compiled32 (lazy (Acic2astMatcher.Matcher32.compiler t))
294 let ast_of_acic id_to_sort annterm =
295 debug_print (lazy ("ast_of_acic <- "
296 ^ CicPp.ppterm (Deannotate.deannotate_term annterm)));
297 let term_info = { sort = id_to_sort; uri = Hashtbl.create 211 } in
298 let ast = ast_of_acic1 term_info annterm in
299 debug_print (lazy ("ast_of_acic -> " ^ CicNotationPp.pp_term ast));
303 let counter = ref ~-1 in
308 let add_interpretation dsc (symbol, args) appl_pattern =
309 let id = fresh_id () in
310 Hashtbl.add level2_patterns32 id (dsc, symbol, args, appl_pattern);
311 pattern32_matrix := (true, appl_pattern, id) :: !pattern32_matrix;
312 load_patterns32 !pattern32_matrix;
314 let ids = Hashtbl.find interpretations symbol in
316 with Not_found -> Hashtbl.add interpretations symbol (ref [id]));
319 let get_all_interpretations () =
321 (function (_, _, id) ->
324 Hashtbl.find level2_patterns32 id
325 with Not_found -> assert false
330 let get_active_interpretations () =
331 HExtlib.filter_map (function (true, _, id) -> Some id | _ -> None)
334 let set_active_interpretations ids =
335 let pattern32_matrix' =
338 | (_, ap, id) when List.mem id ids -> (true, ap, id)
339 | (_, ap, id) -> (false, ap, id))
342 pattern32_matrix := pattern32_matrix';
343 load_patterns32 !pattern32_matrix
345 exception Interpretation_not_found
347 let lookup_interpretations symbol =
350 (List.sort Pervasives.compare
353 let (dsc, _, args, appl_pattern) =
355 Hashtbl.find level2_patterns32 id
356 with Not_found -> assert false
358 dsc, args, appl_pattern)
359 !(Hashtbl.find interpretations symbol)))
360 with Not_found -> raise Interpretation_not_found
362 let remove_interpretation id =
364 let _, symbol, _, _ = Hashtbl.find level2_patterns32 id in
365 let ids = Hashtbl.find interpretations symbol in
366 ids := List.filter ((<>) id) !ids;
367 Hashtbl.remove level2_patterns32 id;
368 with Not_found -> raise Interpretation_not_found);
370 List.filter (fun (_, _, id') -> id <> id') !pattern32_matrix;
371 load_patterns32 !pattern32_matrix
373 let _ = load_patterns32 []
375 let instantiate_appl_pattern env appl_pattern =
377 try List.assoc name env
379 prerr_endline (sprintf "Name %s not found" name);
382 let rec aux = function
383 | Ast.UriPattern uri -> CicUtil.term_of_uri uri
384 | Ast.ImplicitPattern -> Cic.Implicit None
385 | Ast.VarPattern name -> lookup name
386 | Ast.ApplPattern terms -> Cic.Appl (List.map aux terms)