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_______________________________________________________________ *)
24 (* nodes count **************************************************************)
45 let initial_counters = {
46 eabsts = 0; eabbrs = 0; evoids = 0;
47 tsorts = 0; tlrefs = 0; tgrefs = 0; tcasts = 0; tappls = 0;
48 tabsts = 0; tabbrs = 0; tvoids = 0;
49 uris = []; nodes = 0; xnodes = 0
52 let rec count_term_binder f c e = function
54 let c = {c with tabsts = succ c.tabsts; nodes = succ c.nodes} in
57 let c = {c with tabbrs = succ c.tabbrs; xnodes = succ c.xnodes} in
60 let c = {c with tvoids = succ c.tvoids; xnodes = succ c.xnodes} in
63 and count_term f c e = function
65 f {c with tsorts = succ c.tsorts; nodes = succ c.nodes}
67 begin match B.get e i with
70 f {c with tlrefs = succ c.tlrefs; nodes = succ c.nodes}
71 | _, _, _, B.Abbr _ ->
72 f {c with tlrefs = succ c.tlrefs; xnodes = succ c.xnodes}
76 if Cps.list_mem ~eq:U.eq u c.uris
77 then {c with nodes = succ c.nodes}
78 else {c with xnodes = succ c.xnodes}
80 f {c with tgrefs = succ c.tgrefs}
82 let c = {c with tcasts = succ c.tcasts} in
83 let f c = count_term f c e t in
86 let c = {c with tappls = succ c.tappls; nodes = succ c.nodes} in
87 let f c = count_term f c e t in
90 let f c = count_term f c (B.push e B.empty a b) t in
91 count_term_binder f c e b
93 let count_entity f c = function
94 | _, u, E.Abst (_, w) ->
96 eabsts = succ c.eabsts; nodes = succ c.nodes; uris = u :: c.uris
98 count_term f c B.empty w
100 let c = {c with eabbrs = succ c.eabbrs; xnodes = succ c.xnodes} in
101 count_term f c B.empty v
102 | _, _, E.Void -> assert false
104 let print_counters f c =
106 c.tsorts + c.tgrefs + c.tgrefs + c.tcasts + c.tappls + c.tabsts +
109 let items = c.eabsts + c.eabbrs in
110 let nodes = c.nodes + c.xnodes in
111 L.warn level (P.sprintf "Kernel representation summary (basic_rg)");
112 L.warn level (P.sprintf " Total entry items: %7u" items);
113 L.warn level (P.sprintf " Declaration items: %7u" c.eabsts);
114 L.warn level (P.sprintf " Definition items: %7u" c.eabbrs);
115 L.warn level (P.sprintf " Total term items: %7u" terms);
116 L.warn level (P.sprintf " Sort items: %7u" c.tsorts);
117 L.warn level (P.sprintf " Local reference items: %7u" c.tlrefs);
118 L.warn level (P.sprintf " Global reference items: %7u" c.tgrefs);
119 L.warn level (P.sprintf " Explicit Cast items: %7u" c.tcasts);
120 L.warn level (P.sprintf " Application items: %7u" c.tappls);
121 L.warn level (P.sprintf " Abstraction items: %7u" c.tabsts);
122 L.warn level (P.sprintf " Abbreviation items: %7u" c.tabbrs);
123 L.warn level (P.sprintf " Global Int. Complexity: %7u" c.nodes);
124 L.warn level (P.sprintf " + Abbreviation nodes: %7u" nodes);
127 (* supplementary annotation *************************************************)
129 let rec does_not_occur f n r = function
131 | B.Cons (e, _, a, _) ->
133 if n1 = n && r1 = r then f false else does_not_occur f n r e
138 let rec aux f e n r =
141 | false -> aux f e (n ^ "_") r
143 does_not_occur f n r e
146 let f n r = if n = n0 && r = r0 then f a else f (E.Name (n, r) :: a) in
151 (* lenv/term pretty printing ************************************************)
155 | true -> P.fprintf och "%s" n
156 | false -> P.fprintf och "-%s" n
161 if N.is_infinite n then () else P.fprintf och "^%s" (N.to_string n)
163 let rec pp_term e och = function
165 let err _ = P.fprintf och "*%u" h in
166 let f s = P.fprintf och "%s" s in
167 H.string_of_sort err f h
169 let err _ = P.fprintf och "#%u" i in
170 if !G.indexes then err () else
171 let _, _, a, b = B.get e i in
172 P.fprintf och "%a" (name err) a
174 P.fprintf och "$%s" (U.string_of_uri s)
175 | B.Cast (_, u, t) ->
176 P.fprintf och "{%a}.%a" (pp_term e) u (pp_term e) t
177 | B.Appl (_, v, t) ->
178 P.fprintf och "(%a).%a" (pp_term e) v (pp_term e) t
179 | B.Bind (a, B.Abst (n, w), t) ->
181 let ee = B.push e B.empty a (B.abst n w) in
182 P.fprintf och "[%a:%a]%a.%a" (name C.err) a (pp_term e) w pp_level n (pp_term ee) t
185 | B.Bind (a, B.Abbr v, t) ->
187 let ee = B.push e B.empty a (B.abbr v) in
188 P.fprintf och "[%a=%a].%a" (name C.err) a (pp_term e) v (pp_term ee) t
191 | B.Bind (a, B.Void, t) ->
193 let ee = B.push e B.empty a B.Void in
194 P.fprintf och "[%a].%a" (name C.err) a (pp_term ee) t
199 let pp_entry f e c a b x = f x (* match b with
201 let f a = P.fprintf och "%a : %a\n" (name C.err) a (pp_term e) w; f a in
204 let f a = P.fprintf och "%a = %a\n" (name C.err) a (pp_term e) v; f a in
207 let f a = P.fprintf och "%a\n" (name C.err) a; f a in
211 if e = B.empty then P.fprintf och "%s\n" "not shown" else
212 B.fold_right ignore pp_entry e B.empty
215 L.pp_term = pp_term; L.pp_lenv = pp_lenv
218 (* term xml printing ********************************************************)
221 BD.crg_of_brg XD.export_term