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_______________________________________________________________ *)
18 (* Internal functions *******************************************************)
20 let rec xlate_term c f = function
22 let f h = f (B.Sort ([], h)) in
23 if s then f 0 else f 1
26 | M.GRef (_, uri, vs) ->
27 let map f t v = f (B.appl [] v t) in
28 let f vs = C.list_fold_left f map (B.GRef ([], uri)) vs in
29 C.list_map f (xlate_term c) vs
31 let f v t = f (B.Appl ([], v, t)) in
32 let f v = xlate_term c (f v) t in
34 | M.Abst (id, w, t) ->
36 let a = [E.Name (id, true)] in
37 let f t = f (B.Bind (a, B.Abst (N.infinite, w), t)) in
38 xlate_term (B.push c B.empty a (B.Abst (N.infinite, w))) f t
42 let xlate_pars f pars =
44 let a = [E.Name (id, true)] in
45 let f w = f (B.push c B.empty a (B.Abst (N.infinite, w))) in
48 C.list_fold_right f map pars B.empty
50 let unwind_to_xlate_term f c t =
51 let map t a b = B.bind a b t in
52 let f t = f (B.fold_left map t c) in
55 let xlate_entry f = function
57 let f c = unwind_to_xlate_term f c u in
60 let f u t = f (B.Cast ([], u, t)) in
61 let f c u = unwind_to_xlate_term (f u) c t in
62 let f c = unwind_to_xlate_term (f c) c u in
65 (* Interface functions ******************************************************)
67 let brg_of_meta = xlate_entry