\ / This software is distributed as is, NO WARRANTY.
V_______________________________________________________________ *)
-module U = NUri
-module C = Cps
-module H = Hierarchy
-module Y = Entity
-module A = Alpha
-module X = XmlLibrary
-module D = Crg
+module U = NUri
+module C = Cps
+module H = Hierarchy
+module Y = Entity
+module R = Alpha
+module XL = XmlLibrary
+module D = Crg
(* internal functions *******************************************************)
let f s = Y.Name (s, true) :: a in
H.string_of_sort err f l
in
- let attrs = [X.position l; X.name a] in
- X.tag X.sort attrs out tab
+ let attrs = [XL.position l; XL.name a] in
+ XL.tag XL.sort attrs out tab
| D.TLRef (a, i, j) ->
let a =
let err _ = a in
let f n r = Y.Name (n, r) :: a in
D.get_name err f i j e
in
- let attrs = [X.position i; X.offset j; X.name a] in
- X.tag X.lref attrs out tab
+ let attrs = [XL.position i; XL.offset j; XL.name a] in
+ XL.tag XL.lref attrs out tab
| D.TGRef (a, n) ->
let a = Y.Name (U.name_of_uri n, true) :: a in
- let attrs = [X.uri n; X.name a] in
- X.tag X.gref attrs out tab
+ let attrs = [XL.uri n; XL.name a] in
+ XL.tag XL.gref attrs out tab
| D.TCast (a, u, t) ->
let attrs = [] in
- X.tag X.cast attrs ~contents:(exp_term e u) out tab;
+ XL.tag XL.cast attrs ~contents:(exp_term e u) out tab;
exp_term e t out tab
| D.TAppl (a, vs, t) ->
- let attrs = [X.arity (List.length vs)] in
- X.tag X.appl attrs ~contents:(list_iter (exp_term e) vs) out tab;
+ let attrs = [XL.arity (List.length vs)] in
+ XL.tag XL.appl attrs ~contents:(list_iter (exp_term e) vs) out tab;
exp_term e t out tab
| D.TProj (a, lenv, t) ->
let attrs = [] in
- X.tag X.proj attrs ~contents:(lenv_iter (exp_bind e) (exp_eproj e) lenv) out tab;
+ XL.tag XL.proj attrs ~contents:(lenv_iter (exp_bind e) (exp_eproj e) lenv) out tab;
exp_term (D.push_proj C.start e a lenv) t out tab
| D.TBind (a, b, t) ->
(* NOTE: the inner binders are alpha-converted first *)
-(* so undesirable renamings might occur *)
-(* EX: we rename [x][x]x to [x][x_]x_ *)
-(* whereas [x_][x]x would be more desirable *)
- let a = A.alpha (D.names_of_lenv [] e) a in
+ let a = R.alpha (D.names_of_lenv [] e) a in
exp_bind e a b out tab;
exp_term (D.push_bind C.start e a b) t out tab
match b with
| D.Abst ws ->
let e = D.push_bind C.start e a (D.Abst []) in
- let attrs = [X.name ns; X.mark a; X.arity (List.length ws)] in
- X.tag X.abst attrs ~contents:(list_rev_iter exp_term e ns ws) out tab
+ let attrs = [XL.name ns; XL.mark a; XL.arity (List.length ws)] in
+ XL.tag XL.abst attrs ~contents:(list_rev_iter exp_term e ns ws) out tab
| D.Abbr vs ->
let e = D.push_bind C.start e a (D.Abbr []) in
- let attrs = [X.name ns; X.mark a; X.arity (List.length vs)] in
- X.tag X.abbr attrs ~contents:(list_rev_iter exp_term e ns vs) out tab
+ let attrs = [XL.name ns; XL.mark a; XL.arity (List.length vs)] in
+ XL.tag XL.abbr attrs ~contents:(list_rev_iter exp_term e ns vs) out tab
| D.Void n ->
- let attrs = [X.name a; X.mark a; X.arity n] in
- X.tag X.void attrs out tab
+ let attrs = [XL.name a; XL.mark a; XL.arity n] in
+ XL.tag XL.void attrs out tab
and exp_eproj e a lenv out tab =
let attrs = [] in
- X.tag X.proj attrs ~contents:(lenv_iter (exp_bind e) (exp_eproj e) lenv) out tab
+ XL.tag XL.proj attrs ~contents:(lenv_iter (exp_bind e) (exp_eproj e) lenv) out tab
(* interface functions ******************************************************)