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 ast_of_acic0 term_info acic k =
70 let k = k term_info in
71 let id_to_uris = term_info.uri in
72 let register_uri id uri = Hashtbl.add id_to_uris id uri in
75 Hashtbl.find term_info.sort id
77 prerr_endline (sprintf "warning: sort of id %s not found, using Type" id);
78 `Type (CicUniv.fresh ())
80 let aux_substs substs =
83 (fun (uri, annterm) -> (UriManager.name_of_uri uri, k annterm))
86 let aux_context context =
90 | Some annterm -> Some (k annterm))
94 | Cic.ARel (id,_,_,b) -> idref id (Ast.Ident (b, None))
95 | Cic.AVar (id,uri,substs) ->
97 idref id (Ast.Ident (UriManager.name_of_uri uri, aux_substs substs))
98 | Cic.AMeta (id,n,l) -> idref id (Ast.Meta (n, aux_context l))
99 | Cic.ASort (id,Cic.Prop) -> idref id (Ast.Sort `Prop)
100 | Cic.ASort (id,Cic.Set) -> idref id (Ast.Sort `Set)
101 | Cic.ASort (id,Cic.Type u) -> idref id (Ast.Sort (`Type u))
102 | Cic.ASort (id,Cic.CProp) -> idref id (Ast.Sort `CProp)
103 | Cic.AImplicit (id, Some `Hole) -> idref id Ast.UserInput
104 | Cic.AImplicit (id, _) -> idref id Ast.Implicit
105 | Cic.AProd (id,n,s,t) ->
107 match sort_of_id id with
108 | `Set | `Type _ -> `Pi
109 | `Prop | `CProp -> `Forall
111 idref id (Ast.Binder (binder_kind,
112 (CicNotationUtil.name_of_cic_name n, Some (k s)), k t))
113 | Cic.ACast (id,v,t) -> idref id (Ast.Cast (k v, k t))
114 | Cic.ALambda (id,n,s,t) ->
115 idref id (Ast.Binder (`Lambda,
116 (CicNotationUtil.name_of_cic_name n, Some (k s)), k t))
117 | Cic.ALetIn (id,n,s,t) ->
118 idref id (Ast.LetIn ((CicNotationUtil.name_of_cic_name n, None),
120 | Cic.AAppl (aid,args) -> idref aid (Ast.Appl (List.map k args))
121 | Cic.AConst (id,uri,substs) ->
123 idref id (Ast.Ident (UriManager.name_of_uri uri, aux_substs substs))
124 | Cic.AMutInd (id,uri,i,substs) ->
125 let name = name_of_inductive_type uri i in
126 let uri_str = UriManager.string_of_uri uri in
127 let puri_str = sprintf "%s#xpointer(1/%d)" uri_str (i+1) in
128 register_uri id (UriManager.uri_of_string puri_str);
129 idref id (Ast.Ident (name, aux_substs substs))
130 | Cic.AMutConstruct (id,uri,i,j,substs) ->
131 let name = constructor_of_inductive_type uri i j in
132 let uri_str = UriManager.string_of_uri uri in
133 let puri_str = sprintf "%s#xpointer(1/%d/%d)" uri_str (i + 1) j in
134 register_uri id (UriManager.uri_of_string puri_str);
135 idref id (Ast.Ident (name, aux_substs substs))
136 | Cic.AMutCase (id,uri,typeno,ty,te,patterns) ->
137 let name = name_of_inductive_type uri typeno in
138 let uri_str = UriManager.string_of_uri uri in
139 let puri_str = sprintf "%s#xpointer(1/%d)" uri_str (typeno+1) in
141 UriManager.uri_of_string
142 (sprintf "%s#xpointer(1/%d/%d)" uri_str (typeno+1) j)
144 let case_indty = name, Some (UriManager.uri_of_string puri_str) in
145 let constructors = constructors_of_inductive_type uri typeno in
146 let rec eat_branch ty pat =
148 | Cic.Prod (_, _, t), Cic.ALambda (_, name, s, t') ->
149 let (cv, rhs) = eat_branch t t' in
150 (CicNotationUtil.name_of_cic_name name, Some (k s)) :: cv, rhs
157 (fun (name, ty) pat ->
159 let (capture_variables, rhs) = eat_branch ty pat in
160 ((name, Some (ctor_puri !j), capture_variables), rhs))
161 constructors patterns
162 with Invalid_argument _ -> assert false
164 idref id (Ast.Case (k te, Some case_indty, Some (k ty), patterns))
165 | Cic.AFix (id, no, funs) ->
168 (fun (_, n, decr_idx, ty, bo) ->
169 ((Ast.Ident (n, None), Some (k ty)), k bo, decr_idx))
174 (match List.nth defs no with
175 | (Ast.Ident (n, _), _), _, _ when n <> "_" -> n
177 with Not_found -> assert false
179 idref id (Ast.LetRec (`Inductive, defs, Ast.Ident (name, None)))
180 | Cic.ACoFix (id, no, funs) ->
183 (fun (_, n, ty, bo) ->
184 ((Ast.Ident (n, None), Some (k ty)), k bo, 0))
189 (match List.nth defs no with
190 | (Ast.Ident (n, _), _), _, _ when n <> "_" -> n
192 with Not_found -> assert false
194 idref id (Ast.LetRec (`CoInductive, defs, Ast.Ident (name, None)))
198 (* persistent state *)
200 let level2_patterns32 = Hashtbl.create 211
201 let interpretations = Hashtbl.create 211 (* symb -> id list ref *)
203 let compiled32 = ref None
204 let pattern32_matrix = ref []
206 let get_compiled32 () =
207 match !compiled32 with
208 | None -> assert false
209 | Some f -> Lazy.force f
211 let set_compiled32 f = compiled32 := Some f
214 List.fold_right (fun idref t -> Ast.AttributedTerm (`IdRef idref, t))
216 let instantiate32 term_info idrefs env symbol args =
217 let rec instantiate_arg = function
218 | Ast.IdentArg (n, name) ->
219 let t = (try List.assoc name env with Not_found -> assert false) in
220 let rec count_lambda = function
221 | Ast.AttributedTerm (_, t) -> count_lambda t
222 | Ast.Binder (`Lambda, _, body) -> 1 + count_lambda body
225 let rec add_lambda t n =
227 let name = CicNotationUtil.fresh_name () in
228 Ast.Binder (`Lambda, (Ast.Ident (name, None), None),
229 Ast.Appl [add_lambda t (n - 1); Ast.Ident (name, None)])
233 add_lambda t (n - count_lambda t)
236 let symbol = Ast.Symbol (symbol, 0) in
237 add_idrefs idrefs symbol
239 if args = [] then head
240 else Ast.Appl (head :: List.map instantiate_arg args)
242 let rec ast_of_acic1 term_info annterm =
243 let id_to_uris = term_info.uri in
244 let register_uri id uri = Hashtbl.add id_to_uris id uri in
245 match (get_compiled32 ()) annterm with
246 | None -> ast_of_acic0 term_info annterm ast_of_acic1
247 | Some (env, ctors, pid) ->
251 let idref = CicUtil.id_of_annterm annterm in
254 (CicUtil.uri_of_term (Deannotate.deannotate_term annterm))
255 with Invalid_argument _ -> ());
260 List.map (fun (name, term) -> (name, ast_of_acic1 term_info term)) env
262 let _, symbol, args, _ =
264 Hashtbl.find level2_patterns32 pid
265 with Not_found -> assert false
267 let ast = instantiate32 term_info idrefs env' symbol args in
268 Ast.AttributedTerm (`IdRef (CicUtil.id_of_annterm annterm), ast)
270 let load_patterns32 t =
272 HExtlib.filter_map (function (true, ap, id) -> Some (ap, id) | _ -> None) t
274 set_compiled32 (lazy (Acic2astMatcher.Matcher32.compiler t))
276 let ast_of_acic id_to_sort annterm =
277 debug_print (lazy ("ast_of_acic <- "
278 ^ CicPp.ppterm (Deannotate.deannotate_term annterm)));
279 let term_info = { sort = id_to_sort; uri = Hashtbl.create 211 } in
280 let ast = ast_of_acic1 term_info annterm in
281 debug_print (lazy ("ast_of_acic -> " ^ CicNotationPp.pp_term ast));
285 let counter = ref ~-1 in
290 let add_interpretation dsc (symbol, args) appl_pattern =
291 let id = fresh_id () in
292 Hashtbl.add level2_patterns32 id (dsc, symbol, args, appl_pattern);
293 pattern32_matrix := (true, appl_pattern, id) :: !pattern32_matrix;
294 load_patterns32 !pattern32_matrix;
296 let ids = Hashtbl.find interpretations symbol in
298 with Not_found -> Hashtbl.add interpretations symbol (ref [id]));
301 let get_all_interpretations () =
303 (function (_, _, id) ->
306 Hashtbl.find level2_patterns32 id
307 with Not_found -> assert false
312 let get_active_interpretations () =
313 HExtlib.filter_map (function (true, _, id) -> Some id | _ -> None)
316 let set_active_interpretations ids =
317 let pattern32_matrix' =
320 | (_, ap, id) when List.mem id ids -> (true, ap, id)
321 | (_, ap, id) -> (false, ap, id))
324 pattern32_matrix := pattern32_matrix';
325 load_patterns32 !pattern32_matrix
327 exception Interpretation_not_found
329 let lookup_interpretations symbol =
332 (List.sort Pervasives.compare
335 let (dsc, _, args, appl_pattern) =
337 Hashtbl.find level2_patterns32 id
338 with Not_found -> assert false
340 dsc, args, appl_pattern)
341 !(Hashtbl.find interpretations symbol)))
342 with Not_found -> raise Interpretation_not_found
344 let remove_interpretation id =
346 let _, symbol, _, _ = Hashtbl.find level2_patterns32 id in
347 let ids = Hashtbl.find interpretations symbol in
348 ids := List.filter ((<>) id) !ids;
349 Hashtbl.remove level2_patterns32 id;
350 with Not_found -> raise Interpretation_not_found);
352 List.filter (fun (_, _, id') -> id <> id') !pattern32_matrix;
353 load_patterns32 !pattern32_matrix
355 let _ = load_patterns32 []
357 let instantiate_appl_pattern env appl_pattern =
359 try List.assoc name env
361 prerr_endline (sprintf "Name %s not found" name);
364 let rec aux = function
365 | Ast.UriPattern uri -> CicUtil.term_of_uri uri
366 | Ast.ImplicitPattern -> Cic.Implicit None
367 | Ast.VarPattern name -> lookup name
368 | Ast.ApplPattern terms -> Cic.Appl (List.map aux terms)