sorts = 0; grefs = 0; appls = 0; absts = 0; pars = 0; xnodes = 0
}
+IFDEF SUMMARY THEN
+
let rec count_term f c = function
| A.Sort _ ->
f {c with sorts = succ c.sorts; xnodes = succ c.xnodes}
L.warn level (KP.sprintf " + Abbreviation nodes: %7u" c.xnodes);
f ()
+IFDEF PREPROCESS THEN
+
let print_process_counters f c =
let f iao iar iac iag =
L.warn level (KP.sprintf "Automath process summary");
f ()
in
AA.get_counters f c
+
+END
+
+END