-
Notifications
You must be signed in to change notification settings - Fork 78
/
printer.ml
executable file
·591 lines (543 loc) · 25.6 KB
/
printer.ml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
(* ========================================================================= *)
(* Simplistic HOL Light prettyprinter, using the OCaml "Format" library. *)
(* *)
(* John Harrison, University of Cambridge Computer Laboratory *)
(* *)
(* (c) Copyright, University of Cambridge 1998 *)
(* (c) Copyright, John Harrison 1998-2007 *)
(* (c) Copyright, Marco Maggesi 2017 *)
(* (c) Copyright, Andrea Gabrielli, Marco Maggesi 2017-2018 *)
(* ========================================================================= *)
needs "nets.ml";;
(* ------------------------------------------------------------------------- *)
(* Character discrimination. *)
(* ------------------------------------------------------------------------- *)
let isspace,issep,isbra,issymb,isalpha,isnum,isalnum =
let charcode s = Char.code(String.get s 0) in
let spaces = " \t\n\r"
and separators = ",;"
and brackets = "()[]{}"
and symbs = "\\!@#$%^&*-+|\\<=>/?~.:"
and alphas = "'abcdefghijklmnopqrstuvwxyz_ABCDEFGHIJKLMNOPQRSTUVWXYZ"
and nums = "0123456789" in
let allchars = spaces^separators^brackets^symbs^alphas^nums in
let csetsize = itlist (max o charcode) (explode allchars) 256 in
let ctable = Array.make csetsize 0 in
do_list (fun c -> Array.set ctable (charcode c) 1) (explode spaces);
do_list (fun c -> Array.set ctable (charcode c) 2) (explode separators);
do_list (fun c -> Array.set ctable (charcode c) 4) (explode brackets);
do_list (fun c -> Array.set ctable (charcode c) 8) (explode symbs);
do_list (fun c -> Array.set ctable (charcode c) 16) (explode alphas);
do_list (fun c -> Array.set ctable (charcode c) 32) (explode nums);
let isspace c = Array.get ctable (charcode c) = 1
and issep c = Array.get ctable (charcode c) = 2
and isbra c = Array.get ctable (charcode c) = 4
and issymb c = Array.get ctable (charcode c) = 8
and isalpha c = Array.get ctable (charcode c) = 16
and isnum c = Array.get ctable (charcode c) = 32
and isalnum c = Array.get ctable (charcode c) >= 16 in
isspace,issep,isbra,issymb,isalpha,isnum,isalnum;;
(* ------------------------------------------------------------------------- *)
(* Reserved words. *)
(* ------------------------------------------------------------------------- *)
let reserve_words,unreserve_words,is_reserved_word,reserved_words =
let reswords = ref ["("; ")"; "["; "]"; "{"; "}";
":"; ";"; "."; "|";
"let"; "in"; "and"; "if"; "then"; "else";
"match"; "with"; "function"; "->"; "when"] in
(fun ns -> reswords := union (!reswords) ns),
(fun ns -> reswords := subtract (!reswords) ns),
(fun n -> mem n (!reswords)),
(fun () -> !reswords);;
(* ------------------------------------------------------------------------- *)
(* Functions to access the global tables controlling special parse status. *)
(* *)
(* o List of binders; *)
(* *)
(* o List of prefixes (right-associated unary functions like negation). *)
(* *)
(* o List of infixes with their precedences and associations. *)
(* *)
(* Note that these tables are independent of constant/variable status or *)
(* whether an identifier is symbolic. *)
(* ------------------------------------------------------------------------- *)
let unparse_as_binder,parse_as_binder,parses_as_binder,binders =
let binder_list = ref ([]:string list) in
(fun n -> binder_list := subtract (!binder_list) [n]),
(fun n -> binder_list := union (!binder_list) [n]),
(fun n -> mem n (!binder_list)),
(fun () -> !binder_list);;
let unparse_as_prefix,parse_as_prefix,is_prefix,prefixes =
let prefix_list = ref ([]:string list) in
(fun n -> prefix_list := subtract (!prefix_list) [n]),
(fun n -> prefix_list := union (!prefix_list) [n]),
(fun n -> mem n (!prefix_list)),
(fun () -> !prefix_list);;
let unparse_as_infix,parse_as_infix,get_infix_status,infixes =
let cmp (s,(x,a)) (t,(y,b)) =
x < y || x = y && a > b || x = y && a = b && s < t in
let infix_list = ref ([]:(string * (int * string)) list) in
(fun n -> infix_list := filter (((<>) n) o fst) (!infix_list)),
(fun (n,d) -> infix_list := sort cmp
((n,d)::(filter (((<>) n) o fst) (!infix_list)))),
(fun n -> assoc n (!infix_list)),
(fun () -> !infix_list);;
(* ------------------------------------------------------------------------- *)
(* Interface mapping. *)
(* ------------------------------------------------------------------------- *)
let the_interface = ref ([] :(string * (string * hol_type)) list);;
let the_overload_skeletons = ref ([] : (string * hol_type) list);;
(* ------------------------------------------------------------------------- *)
(* Now the printer. *)
(* ------------------------------------------------------------------------- *)
include Format;;
set_max_boxes 100;;
(* ------------------------------------------------------------------------- *)
(* Flag determining whether interface/overloading is reversed on printing. *)
(* ------------------------------------------------------------------------- *)
let reverse_interface_mapping = ref true;;
(* ------------------------------------------------------------------------- *)
(* Determine binary operators that print without surrounding spaces. *)
(* ------------------------------------------------------------------------- *)
let unspaced_binops = ref [","; ".."; "$"];;
(* ------------------------------------------------------------------------- *)
(* Binary operators to print at start of line when breaking. *)
(* ------------------------------------------------------------------------- *)
let prebroken_binops = ref ["==>"];;
(* ------------------------------------------------------------------------- *)
(* Force explicit indications of bound variables in set abstractions. *)
(* ------------------------------------------------------------------------- *)
let print_unambiguous_comprehensions = ref false;;
(* ------------------------------------------------------------------------- *)
(* Print the universal set UNIV:A->bool as "(:A)". *)
(* ------------------------------------------------------------------------- *)
let typify_universal_set = ref true;;
(* ------------------------------------------------------------------------- *)
(* Flag controlling whether hypotheses print. *)
(* ------------------------------------------------------------------------- *)
let print_all_thm = ref true;;
(* ------------------------------------------------------------------------- *)
(* Flag controlling whether types of subterms must be printed. *)
(* 0: Do not print the types of subterms *)
(* 1 (defualt) : Only print types containing invented type variables *)
(* 2: Print the types of constants and variables *)
(* ------------------------------------------------------------------------- *)
let print_types_of_subterms = ref 1;;
(* ------------------------------------------------------------------------- *)
(* Get the name of a constant or variable. *)
(* ------------------------------------------------------------------------- *)
let name_of tm =
match tm with
Var(x,ty) | Const(x,ty) -> x
| _ -> "";;
(* ------------------------------------------------------------------------- *)
(* Printer for types. *)
(* ------------------------------------------------------------------------- *)
let pp_print_type,pp_print_qtype =
let soc sep flag ss =
if ss = [] then "" else
let s = end_itlist (fun s1 s2 -> s1^sep^s2) ss in
if flag then "("^s^")" else s in
let rec sot pr ty =
try dest_vartype ty with Failure _ ->
try string_of_num(dest_finty ty) with Failure _ ->
match dest_type ty with
con,[] -> con
| "fun",[ty1;ty2] -> soc "->" (pr > 0) [sot 1 ty1; sot 0 ty2]
| "sum",[ty1;ty2] -> soc "+" (pr > 2) [sot 3 ty1; sot 2 ty2]
| "prod",[ty1;ty2] -> soc "#" (pr > 4) [sot 5 ty1; sot 4 ty2]
| "cart",[ty1;ty2] -> soc "^" (pr > 6) [sot 6 ty1; sot 7 ty2]
| con,args -> (soc "," true (map (sot 0) args))^con in
(fun fmt ty -> pp_print_string fmt (sot 0 ty)),
(fun fmt ty -> pp_print_string fmt ("`:" ^ sot 0 ty ^ "`"));;
(* ------------------------------------------------------------------------- *)
(* Allow the installation of user printers. Must fail quickly if N/A. *)
(* ------------------------------------------------------------------------- *)
let install_user_printer,delete_user_printer,try_user_printer =
let user_printers = ref ([]:(string*(formatter->term->unit))list) in
(fun pr -> user_printers := pr::(!user_printers)),
(fun s -> user_printers := snd(remove (fun (s',_) -> s = s')
(!user_printers))),
(fun fmt -> fun tm -> tryfind (fun (_,pr) -> pr fmt tm) (!user_printers));;
(* ------------------------------------------------------------------------- *)
(* Printer for terms. *)
(* ------------------------------------------------------------------------- *)
let pp_print_term =
let reverse_interface (s0,ty0) =
if not(!reverse_interface_mapping) then s0 else
try fst(find (fun (s,(s',ty)) -> s' = s0 && can (type_match ty ty0) [])
(!the_interface))
with Failure _ -> s0 in
let DEST_BINARY c tm =
try let il,r = dest_comb tm in
let i,l = dest_comb il in
if i = c ||
(is_const i && is_const c &&
reverse_interface(dest_const i) = reverse_interface(dest_const c))
then l,r else fail()
with Failure _ -> failwith "DEST_BINARY"
and ARIGHT s =
match snd(get_infix_status s) with
"right" -> true | _ -> false in
let rec powerof10 n =
if abs_num n </ num 1 then false
else if n =/ num 1 then true
else powerof10 (n // num 10) in
let bool_of_term t =
match t with
Const("T",_) -> true
| Const("F",_) -> false
| _ -> failwith "bool_of_term" in
let code_of_term t =
let f,tms = strip_comb t in
if not(is_const f && fst(dest_const f) = "ASCII")
|| not(length tms = 8) then failwith "code_of_term"
else
itlist (fun b f -> if b then 1 + 2 * f else 2 * f)
(map bool_of_term (rev tms)) 0 in
let rec dest_clause tm =
let pbod = snd(strip_exists(body(body tm))) in
let s,args = strip_comb pbod in
if name_of s = "_UNGUARDED_PATTERN" && length args = 2 then
[rand(rator(hd args));rand(rator(hd(tl args)))]
else if name_of s = "_GUARDED_PATTERN" && length args = 3 then
[rand(rator(hd args)); hd(tl args); rand(rator(hd(tl(tl args))))]
else failwith "dest_clause" in
let rec dest_clauses tm =
let s,args = strip_comb tm in
if name_of s = "_SEQPATTERN" && length args = 2 then
dest_clause (hd args)::dest_clauses(hd(tl args))
else [dest_clause tm] in
let pdest_cond tm =
match tm with
Comb(Comb(Comb(Const("COND",_),i),t),e) -> (i,t),e
| _ -> failwith "pdest_cond" in
fun fmt ->
let rec print_term prec tm =
try try_user_printer fmt tm with Failure _ ->
try pp_print_string fmt (string_of_num(dest_numeral tm))
with Failure _ ->
try (let tms = dest_list tm in
try if fst(dest_type(hd(snd(dest_type(type_of tm))))) <> "char"
then fail() else
let ccs = map (String.make 1 o Char.chr o code_of_term) tms in
let s = "\"" ^ String.escaped (implode ccs) ^ "\"" in
pp_print_string fmt s
with Failure _ ->
pp_open_box fmt 0; pp_print_string fmt "[";
pp_open_box fmt 0; print_term_sequence true ";" 0 tms;
pp_close_box fmt (); pp_print_string fmt "]";
pp_close_box fmt ())
with Failure _ ->
if is_gabs tm then print_binder prec tm else
let hop,args = strip_comb tm in
let s0 = name_of hop
and ty0 = type_of hop in
let s = reverse_interface (s0,ty0) in
try if s = "EMPTY" && is_const tm && args = [] then
pp_print_string fmt "{}" else fail()
with Failure _ ->
try if s = "UNIV" && !typify_universal_set && is_const tm && args = []
then
let ty = fst(dest_fun_ty(type_of tm)) in
(pp_print_string fmt "(:";
pp_print_type fmt ty;
pp_print_string fmt ")")
else fail()
with Failure _ ->
try if s <> "INSERT" then fail() else
let mems,oth = splitlist (dest_binary "INSERT") tm in
if is_const oth && fst(dest_const oth) = "EMPTY" then
(pp_open_box fmt 0; pp_print_string fmt "{"; pp_open_box fmt 0;
print_term_sequence true "," 14 mems;
pp_close_box fmt (); pp_print_string fmt "}"; pp_close_box fmt ())
else fail()
with Failure _ ->
try if not (s = "GSPEC") then fail() else
let evs,bod = strip_exists(body(rand tm)) in
let bod1,fabs = dest_comb bod in
let bod2,babs = dest_comb bod1 in
let c = rator bod2 in
if fst(dest_const c) <> "SETSPEC" then fail() else
pp_print_string fmt "{";
print_term 0 fabs;
pp_print_string fmt " | ";
(let fvs = frees fabs and bvs = frees babs in
if not(!print_unambiguous_comprehensions) &&
set_eq evs
(if (length fvs <= 1 || bvs = []) then fvs
else intersect fvs bvs)
then ()
else (print_term_sequence false "," 14 evs;
pp_print_string fmt " | "));
print_term 0 babs;
pp_print_string fmt "}"
with Failure _ ->
try let eqs,bod = dest_let tm in
(if prec = 0 then pp_open_hvbox fmt 0
else (pp_open_hvbox fmt 1; pp_print_string fmt "(");
pp_print_string fmt "let ";
print_term 0 (mk_eq(hd eqs));
do_list (fun (v,t) -> pp_print_break fmt 1 0;
pp_print_string fmt "and ";
print_term 0 (mk_eq(v,t)))
(tl eqs);
pp_print_string fmt " in";
pp_print_break fmt 1 0;
print_term 0 bod;
if prec = 0 then () else pp_print_string fmt ")";
pp_close_box fmt ())
with Failure _ -> try
if s <> "DECIMAL" then fail() else
let n_num = dest_numeral (hd args)
and n_den = dest_numeral (hd(tl args)) in
if not(powerof10 n_den) then fail() else
let s_num = string_of_num(quo_num n_num n_den) in
let s_den = implode(tl(explode(string_of_num
(n_den +/ (mod_num n_num n_den))))) in
pp_print_string fmt
("#"^s_num^(if n_den = num 1 then "" else ".")^s_den)
with Failure _ -> try
if s <> "_MATCH" || length args <> 2 then failwith "" else
let cls = dest_clauses(hd(tl args)) in
(if prec = 0 then () else pp_print_string fmt "(";
pp_open_hvbox fmt 0;
pp_print_string fmt "match ";
print_term 0 (hd args);
pp_print_string fmt " with";
pp_print_break fmt 1 2;
print_clauses cls;
pp_close_box fmt ();
if prec = 0 then () else pp_print_string fmt ")")
with Failure _ -> try
if s <> "_FUNCTION" || length args <> 1 then failwith "" else
let cls = dest_clauses(hd args) in
(if prec = 0 then () else pp_print_string fmt "(";
pp_open_hvbox fmt 0;
pp_print_string fmt "function";
pp_print_break fmt 1 2;
print_clauses cls;
pp_close_box fmt ();
if prec = 0 then () else pp_print_string fmt ")")
with Failure _ ->
if s = "COND" && length args = 3 then
((if prec = 0 then () else pp_print_string fmt "(");
pp_open_hvbox fmt (-1);
(let ccls,ecl = splitlist pdest_cond tm in
if length ccls <= 4 then
(pp_print_string fmt "if ";
print_term 0 (hd args);
pp_print_break fmt 0 0;
pp_print_string fmt " then ";
print_term 0 (hd(tl args));
pp_print_break fmt 0 0;
pp_print_string fmt " else ";
print_term 0 (hd(tl(tl args)))
)
else
(pp_print_string fmt "if ";
print_term 0 (fst(hd ccls));
pp_print_string fmt " then ";
print_term 0 (snd(hd ccls));
pp_print_break fmt 0 0;
do_list (fun (i,t) ->
pp_print_string fmt " else if ";
print_term 0 i;
pp_print_string fmt " then ";
print_term 0 t;
pp_print_break fmt 0 0) (tl ccls);
pp_print_string fmt " else ";
print_term 0 ecl));
pp_close_box fmt ();
(if prec = 0 then () else pp_print_string fmt ")"))
else if is_prefix s && length args = 1 then
(if prec = 1000 then pp_print_string fmt "(" else ();
pp_print_string fmt s;
(if isalnum s ||
s = "--" &&
length args = 1 &&
(try let l,r = dest_comb(hd args) in
let s0 = name_of l and ty0 = type_of l in
reverse_interface (s0,ty0) = "--" ||
mem (fst(dest_const l)) ["real_of_num"; "int_of_num"]
with Failure _ -> false) ||
s = "~" && length args = 1 && is_neg(hd args)
then pp_print_string fmt " " else ());
print_term 999 (hd args);
if prec = 1000 then pp_print_string fmt ")" else ())
else if parses_as_binder s && length args = 1 && is_gabs (hd args) then
print_binder prec tm
else if can get_infix_status s && length args = 2 then
let bargs =
if ARIGHT s then
let tms,tmt = splitlist (DEST_BINARY hop) tm in tms@[tmt]
else
let tmt,tms = rev_splitlist (DEST_BINARY hop) tm in tmt::tms in
let newprec = fst(get_infix_status s) in
(if newprec <= prec then
(pp_open_hvbox fmt 1; pp_print_string fmt "(")
else pp_open_hvbox fmt 0;
print_term newprec (hd bargs);
do_list (fun x -> if mem s (!unspaced_binops) then ()
else if mem s (!prebroken_binops)
then pp_print_break fmt 1 0
else pp_print_string fmt " ";
pp_print_string fmt s;
if mem s (!unspaced_binops)
then pp_print_break fmt 0 0
else if mem s (!prebroken_binops)
then pp_print_string fmt " "
else pp_print_break fmt 1 0;
print_term newprec x) (tl bargs);
if newprec <= prec then pp_print_string fmt ")" else ();
pp_close_box fmt ())
else if (is_const hop || is_var hop) && args = [] then
let s' = if parses_as_binder s || can get_infix_status s || is_prefix s
then "("^s^")" else s in
let rec has_invented_typevar (ty:hol_type): bool =
if is_vartype ty then (dest_vartype ty).[0] = '?'
else List.exists has_invented_typevar (snd (dest_type ty)) in
if !print_types_of_subterms = 2 ||
(!print_types_of_subterms = 1 && has_invented_typevar (type_of hop))
then
(pp_open_box fmt 0;
pp_print_string fmt "(";
pp_print_string fmt s';
pp_print_string fmt ":";
pp_print_type fmt (type_of hop);
pp_print_string fmt ")";
pp_close_box fmt ())
else
pp_print_string fmt s'
else
let l,r = dest_comb tm in
(pp_open_hvbox fmt 0;
if prec = 1000 then pp_print_string fmt "(" else ();
print_term 999 l;
(if try mem (fst(dest_const l)) ["real_of_num"; "int_of_num"]
with Failure _ -> false
then () else pp_print_space fmt ());
print_term 1000 r;
if prec = 1000 then pp_print_string fmt ")" else ();
pp_close_box fmt ())
and print_term_sequence break sep prec tms =
if tms = [] then () else
(print_term prec (hd tms);
let ttms = tl tms in
if ttms = [] then () else
(pp_print_string fmt sep;
(if break then pp_print_space fmt ());
print_term_sequence break sep prec ttms))
and print_binder prec tm =
let absf = is_gabs tm in
let s,s' = if absf then "\\","\\" else
let bt = rator tm in
let sn = name_of bt in
sn,reverse_interface(sn,type_of bt) in
let rec collectvs tm =
if absf then
if is_abs tm then
let v,t = dest_abs tm in
let vs,bod = collectvs t in (false,v)::vs,bod
else if is_gabs tm then
let v,t = dest_gabs tm in
let vs,bod = collectvs t in (true,v)::vs,bod
else [],tm
else if is_comb tm && name_of(rator tm) = s then
if is_abs(rand tm) then
let v,t = dest_abs(rand tm) in
let vs,bod = collectvs t in (false,v)::vs,bod
else if is_gabs(rand tm) then
let v,t = dest_gabs(rand tm) in
let vs,bod = collectvs t in (true,v)::vs,bod
else [],tm
else [],tm in
let vs,bod = collectvs tm in
((if prec = 0 then pp_open_hvbox fmt 4
else (pp_open_hvbox fmt 5; pp_print_string fmt "("));
pp_print_string fmt s';
(if isalnum s' then pp_print_string fmt " " else ());
do_list (fun (b,x) ->
(if b then pp_print_string fmt "(" else ());
print_term 0 x;
(if b then pp_print_string fmt ")" else ());
pp_print_string fmt " ") (butlast vs);
(if fst(last vs) then pp_print_string fmt "(" else ());
print_term 0 (snd(last vs));
(if fst(last vs) then pp_print_string fmt ")" else ());
pp_print_string fmt ".";
pp_print_space fmt ();
print_term 0 bod;
(if prec = 0 then () else pp_print_string fmt ")");
pp_close_box fmt ())
and print_clauses cls =
match cls with
[c] -> print_clause c
| c::cs -> (print_clause c;
pp_print_break fmt 1 0;
pp_print_string fmt "| ";
print_clauses cs)
and print_clause cl =
match cl with
[p;g;r] -> (print_term 1 p;
pp_print_string fmt " when ";
print_term 1 g;
pp_print_string fmt " -> ";
print_term 1 r)
| [p;r] -> (print_term 1 p;
pp_print_string fmt " -> ";
print_term 1 r)
in print_term 0;;
(* ------------------------------------------------------------------------- *)
(* Print term with quotes. *)
(* ------------------------------------------------------------------------- *)
let pp_print_qterm fmt tm =
pp_print_string fmt "`";
pp_print_term fmt tm;
pp_print_string fmt "`";;
(* ------------------------------------------------------------------------- *)
(* Printer for theorems. *)
(* ------------------------------------------------------------------------- *)
let pp_print_thm fmt th =
let asl,tm = dest_thm th in
(if not (asl = []) then
(if !print_all_thm then
(pp_print_term fmt (hd asl);
do_list (fun x -> pp_print_string fmt ",";
pp_print_space fmt ();
pp_print_term fmt x)
(tl asl))
else pp_print_string fmt "...";
pp_print_space fmt ())
else ();
pp_open_hbox fmt();
pp_print_string fmt "|- ";
pp_print_term fmt tm;
pp_close_box fmt ());;
(* ------------------------------------------------------------------------- *)
(* Print on standard output. *)
(* ------------------------------------------------------------------------- *)
let print_type = pp_print_type std_formatter;;
let print_qtype = pp_print_qtype std_formatter;;
let print_term = pp_print_term std_formatter;;
let print_qterm = pp_print_qterm std_formatter;;
let print_thm = pp_print_thm std_formatter;;
(* ------------------------------------------------------------------------- *)
(* Conversions to string. *)
(* ------------------------------------------------------------------------- *)
let print_to_string printer =
let buf = Buffer.create 16 in
let fmt = formatter_of_buffer buf in
let () = pp_set_max_boxes fmt 100 in
let print = printer fmt in
let flush = pp_print_flush fmt in
fun x ->
let () = pp_set_margin fmt (get_margin ()) in
let () = print x in
let () = flush () in
let s = Buffer.contents buf in
let () = Buffer.reset buf in
s;;
let string_of_type = print_to_string pp_print_type;;
let string_of_term = print_to_string pp_print_term;;
let string_of_thm = print_to_string pp_print_thm;;