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_______________________________________________________________ *)
17 type id = string (* identifier *)
19 type name = id * bool (* token, real? *)
21 type names = name list
23 type attr = Name of name (* name *)
24 | Apix of int (* additional position index *)
25 | Mark of int (* node marker *)
26 | Meta of string (* metaliguistic annotation *)
27 | Priv (* private global definition *)
29 type attrs = attr list (* attributes *)
31 type 'term bind = Abst of N.level * 'term (* declaration: level, domain *)
32 | Abbr of 'term (* definition: body *)
33 | Void (* exclusion *)
35 type 'term entity = attrs * uri * 'term bind (* attrs, name, binder *)
37 (* helpers ******************************************************************)
39 let common f (a, u, _) = f a u
41 let rec name err f = function
42 | Name (n, r) :: _ -> f n r
43 | _ :: tl -> name err f tl
47 let rec aux f i a = function
49 | Name (n, r) :: tl -> aux (map f i n r) false a tl
50 | _ :: tl -> aux f i a tl
54 let rec get_name err f j = function
56 | Name (n, r) :: _ when j = 0 -> f n r
57 | Name _ :: tl -> get_name err f (pred j) tl
58 | _ :: tl -> get_name err f j tl
60 let rec get_names f = function
62 | Name _ as n :: tl ->
63 let f a ns = f a (n :: ns) in get_names f tl
65 let f a = f (e :: a) in get_names f tl
68 let rec aux k = function
70 | Name _ :: tl -> aux (succ k) tl
75 let rec apix err f = function
77 | _ :: tl -> apix err f tl
80 let rec mark err f = function
82 | _ :: tl -> mark err f tl
85 let rec priv err f = function
87 | _ :: tl -> priv err f tl
90 let rec meta err f = function
92 | _ :: tl -> meta err f tl
95 let resolve err f name a =
96 let rec aux i = function
97 | Name (n, true) :: _ when n = name -> f i
98 | _ :: tl -> aux (succ i) tl
103 let rec rev_append_names ns = function
105 | Name n :: tl -> rev_append_names (n :: ns) tl
106 | _ :: tl -> rev_append_names ns tl
108 let xlate f xlate_term = function
109 | a, uri, Abst (n, t) ->
110 let f t = f (a, uri, Abst (n, t)) in xlate_term f t
112 let f t = f (a, uri, Abbr t) in xlate_term f t