2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
21 (* qualified identifier: uri, name, qualifiers *)
22 type qid = D.uri * D.id * D.id list
24 type context = E.attrs * D.term list
26 type context_node = qid option (* context node: None = root *)
29 path: D.id list; (* current section path *)
30 node: context_node; (* current context node *)
31 nodes: context_node list; (* context node list *)
32 line: int; (* line number *)
33 mk_uri: G.uri_generator; (* uri generator *)
36 type resolver = Local of int
39 let henv_size, hcnt_size = 7000, 4300 (* hash tables initial sizes *)
41 let henv = K.create henv_size (* optimized global environment *)
43 let hcnt = K.create hcnt_size (* optimized context *)
45 (* Internal functions *******************************************************)
47 let empty_cnt = D.ESort
49 let add_abst cnt id w =
50 D.EBind (cnt, [E.Name (id, true)], D.Abst (N.infinite, w))
52 let mk_lref f i = f (D.TLRef ([], i))
54 let id_of_name (id, _, _) = id
56 let mk_qid f st id path =
57 let str = String.concat "/" path in
58 let str = Filename.concat str id in
59 let str = st.mk_uri str in
60 f (U.uri_of_string str, id, path)
62 let uri_of_qid (uri, _, _) = uri
64 let complete_qid f st (id, is_local, qs) =
65 let f path = C.list_rev_append (mk_qid f st id) path ~tail:qs in
66 let rec skip f = function
67 | phd :: ptl, qshd :: _ when phd = qshd -> f ptl
68 | _ :: ptl, _ :: _ -> skip f (ptl, qs)
71 if is_local then f st.path else skip f (st.path, qs)
73 let relax_qid f st (_, id, path) =
75 | _ :: tl -> C.list_rev (mk_qid f st id) tl
80 let relax_opt_qid f st = function
82 | Some qid -> let f qid = f (Some qid) in relax_qid f st qid
84 let resolve_gref err f st qid =
85 try let age, cnt = K.find henv (uri_of_qid qid) in f qid age cnt
86 with Not_found -> err qid
88 let resolve_gref_relaxed f st qid =
89 (* this is not tail recursive *)
90 let rec err qid = relax_qid (resolve_gref err f st) st qid in
91 resolve_gref err f st qid
93 let get_cnt err f st = function
96 try let cnt = K.find hcnt (uri_of_qid qid) in f cnt
97 with Not_found -> err node
99 let get_cnt_relaxed f st =
100 (* this is not tail recursive *)
101 let rec err node = relax_opt_qid (get_cnt err f st) st node in
102 get_cnt err f st st.node
104 let push_abst f a w lenv =
105 let bw = D.Abst (N.infinite, w) in
106 D.push_bind f a bw lenv
108 let add_proj e t = match e with
110 | D.EBind (D.ESort, a, b) -> D.TBind (a, b, t)
111 | _ -> D.TProj ([], e, t)
113 let lenv_of_cnt cnt = cnt
115 (* this is not tail recursive in the GRef branch *)
116 let rec xlate_term f st lenv = function
118 let f h = f (D.TSort ([], h)) in
119 if s then f 0 else f 1
121 let f vv tt = f (D.TAppl ([], vv, tt)) in
122 let f vv = xlate_term (f vv) st lenv t in
123 xlate_term f st lenv v
124 | A.Abst (name, w, t) ->
126 let a = [E.Name (name, true)] in
128 let b = D.Abst (N.infinite, ww) in
129 f (D.TBind (a, b, tt))
131 let f lenv = xlate_term f st lenv t in
132 push_abst f a ww lenv
134 xlate_term f st lenv w
135 | A.GRef (name, args) ->
137 let f id _ = A.GRef ((id, true, []), []) :: args in
140 let map2 f arg args =
141 let f arg = f (D.EAppl (args, [], arg)) in
142 xlate_term f st lenv arg
145 let gref = D.TGRef ([age], uri_of_qid qid) in
146 if cnt = D.ESort then f gref else
148 | D.EAppl (D.ESort, a, v) -> f (D.TAppl (a, v, gref))
149 | args -> f (D.TProj ([], args, gref))
151 let f args = C.list_fold_right f map2 args D.ESort in
152 D.sub_list_strict (D.fold_attrs f map1 args) cnt args
154 let g qid = resolve_gref_relaxed g st qid in
155 let err () = complete_qid g st name in
156 D.resolve_lref err (mk_lref f) (id_of_name name) lenv
158 let xlate_entity err f st = function
159 | A.Section (Some (_, name)) ->
160 err {st with path = name :: st.path; nodes = st.node :: st.nodes}
162 begin match st.path, st.nodes with
163 | _ :: ptl, nhd :: ntl ->
164 err {st with path = ptl; node = nhd; nodes = ntl}
168 err {st with node = None}
169 | A.Context (Some name) ->
170 let f name = err {st with node = Some name} in
171 complete_qid f st name
172 | A.Block (name, w) ->
176 K.add hcnt (uri_of_qid qid) (add_abst cnt name ww);
177 err {st with node = Some qid}
179 xlate_term f st cnt w
183 complete_qid f st (name, true, [])
184 | A.Decl (name, w) ->
186 let lenv = lenv_of_cnt cnt in
189 let age = E.Apix st.line in
190 K.add henv (uri_of_qid qid) (age, cnt);
191 let t = add_proj lenv ww in
193 print_newline (); CrgOutput.pp_term print_string t;
195 let b = E.Abst (N.infinite, t) in
196 let entity = [age], uri_of_qid qid, b in
197 f {st with line = succ st.line} entity
199 xlate_term f st lenv w
201 complete_qid f st (name, true, [])
204 | A.Def (name, w, trans, v) ->
206 let lenv = lenv_of_cnt cnt in
210 let age = E.Apix st.line in
211 K.add henv (uri_of_qid qid) (age, cnt);
212 let t = add_proj lenv (D.TCast ([], ww, vv)) in
214 print_newline (); CrgOutput.pp_term print_string t;
217 let a = age :: if trans then [] else [E.Meta [E.Private]] in
218 let entity = a, uri_of_qid qid, b in
219 f {st with line = succ st.line} entity
221 xlate_term f st lenv v
223 xlate_term f st lenv w
225 complete_qid f st (name, true, [])
229 (* Interface functions ******************************************************)
231 let initial_status () =
232 K.clear henv; K.clear hcnt; {
233 path = []; node = None; nodes = []; line = 1; mk_uri = G.get_mk_uri ()
236 let refresh_status st = {st with
237 mk_uri = G.get_mk_uri ()
240 let crg_of_aut = xlate_entity