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 = NotationPt
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)
42 { sort: (cic_id, Ast.sort_kind) Hashtbl.t;
43 uri: (cic_id, UriManager.uri) Hashtbl.t;
46 (* persistent state *)
48 let initial_level2_patterns32 () = Hashtbl.create 211
49 let initial_interpretations () = Hashtbl.create 211
51 let level2_patterns32 = ref (initial_level2_patterns32 ())
52 (* symb -> id list ref *)
53 let interpretations = ref (initial_interpretations ())
54 let pattern32_matrix = ref []
56 let find_level2_patterns32 pid = Hashtbl.find !level2_patterns32 pid;;
61 stack := (!counter,!level2_patterns32,!interpretations,!pattern32_matrix)::!stack;
63 level2_patterns32 := initial_level2_patterns32 ();
64 interpretations := initial_interpretations ();
65 pattern32_matrix := []
71 | (ocounter,olevel2_patterns32,ointerpretations,opattern32_matrix)::old ->
74 level2_patterns32 := olevel2_patterns32;
75 interpretations := ointerpretations;
76 pattern32_matrix := opattern32_matrix
80 List.fold_right (fun idref t -> Ast.AttributedTerm (`IdRef idref, t))
82 let instantiate32 term_info idrefs env symbol args =
83 let rec instantiate_arg = function
84 | Ast.IdentArg (n, name) ->
86 try List.assoc name env
87 with Not_found -> prerr_endline ("name not found in env: "^name);
90 let rec count_lambda = function
91 | Ast.AttributedTerm (_, t) -> count_lambda t
92 | Ast.Binder (`Lambda, _, body) -> 1 + count_lambda body
95 let rec add_lambda t n =
97 let name = NotationUtil.fresh_name () in
98 Ast.Binder (`Lambda, (Ast.Ident (name, None), None),
99 Ast.Appl [add_lambda t (n - 1); Ast.Ident (name, None)])
103 add_lambda t (n - count_lambda t)
106 let symbol = Ast.Symbol (symbol, 0) in
107 add_idrefs idrefs symbol
109 if args = [] then head
110 else Ast.Appl (head :: List.map instantiate_arg args)
112 let load_patterns32s = ref [];;
114 let add_load_patterns32 f = load_patterns32s := f :: !load_patterns32s;;
120 let add_interpretation dsc (symbol, args) appl_pattern =
121 let id = fresh_id () in
122 Hashtbl.add !level2_patterns32 id (dsc, symbol, args, appl_pattern);
123 pattern32_matrix := (true, appl_pattern, id) :: !pattern32_matrix;
124 List.iter (fun f -> f !pattern32_matrix) !load_patterns32s;
126 let ids = Hashtbl.find !interpretations symbol in
128 with Not_found -> Hashtbl.add !interpretations symbol (ref [id]));
131 let get_all_interpretations () =
133 (function (_, _, id) ->
136 Hashtbl.find !level2_patterns32 id
137 with Not_found -> assert false
142 let get_active_interpretations () =
143 HExtlib.filter_map (function (true, _, id) -> Some id | _ -> None)
146 let set_active_interpretations ids =
147 let pattern32_matrix' =
150 | (_, ap, id) when List.mem id ids -> (true, ap, id)
151 | (_, ap, id) -> (false, ap, id))
154 pattern32_matrix := pattern32_matrix';
155 List.iter (fun f -> f !pattern32_matrix) !load_patterns32s
157 exception Interpretation_not_found
159 let lookup_interpretations ?(sorted=true) symbol =
164 let (dsc, _, args, appl_pattern) =
166 Hashtbl.find !level2_patterns32 id
167 with Not_found -> assert false
169 dsc, args, appl_pattern
171 !(Hashtbl.find !interpretations symbol)
173 if sorted then HExtlib.list_uniq (List.sort Pervasives.compare raw)
175 with Not_found -> raise Interpretation_not_found
177 let remove_interpretation id =
179 let dsc, symbol, _, _ = Hashtbl.find !level2_patterns32 id in
180 let ids = Hashtbl.find !interpretations symbol in
181 ids := List.filter ((<>) id) !ids;
182 Hashtbl.remove !level2_patterns32 id;
183 with Not_found -> raise Interpretation_not_found);
185 List.filter (fun (_, _, id') -> id <> id') !pattern32_matrix;
186 List.iter (fun f -> f !pattern32_matrix) !load_patterns32s
188 let init () = List.iter (fun f -> f []) !load_patterns32s
190 let instantiate_appl_pattern
191 ~mk_appl ~mk_implicit ~term_of_uri ~term_of_nref env appl_pattern
194 try List.assoc name env
196 prerr_endline (sprintf "Name %s not found" name);
199 let rec aux = function
200 | Ast.UriPattern uri -> term_of_uri uri
201 | Ast.NRefPattern nref -> term_of_nref nref
202 | Ast.ImplicitPattern -> mk_implicit false
203 | Ast.VarPattern name -> lookup name
204 | Ast.ApplPattern terms -> mk_appl (List.map aux terms)