1 (* Copyright (C) 2000, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://cs.unibo.it/helm/.
26 (***************************************************************************)
30 (* Andrea Asperti <asperti@cs.unibo.it> *)
33 (***************************************************************************)
38 split (n-1) (List.tl l) in
43 let is_big_general countterm p =
44 let maxsize = Cexpr2pres.maxsize in
45 let module Con = Content in
46 let rec countp current_size p =
47 if current_size > maxsize then current_size
49 let c1 = (countcontext current_size p.Con.proof_context) in
50 if c1 > maxsize then c1
52 let c2 = (countapplycontext c1 p.Con.proof_apply_context) in
53 if c2 > maxsize then c2
55 countconclude c2 p.Con.proof_conclude
58 countcontext current_size c =
59 List.fold_left countcontextitem current_size c
61 countcontextitem current_size e =
62 if current_size > maxsize then maxsize
66 (match d.Con.dec_name with
67 Some s -> current_size + 4 + (String.length s)
68 | None -> prerr_endline "NO NAME!!"; assert false)
70 (match h.Con.dec_name with
71 Some s -> current_size + 4 + (String.length s)
72 | None -> prerr_endline "NO NAME!!"; assert false)
73 | `Proof p -> countp current_size p
75 (match d.Con.def_name with
77 let c1 = (current_size + 4 + (String.length s)) in
78 (countterm c1 d.Con.def_term)
80 prerr_endline "NO NAME!!"; assert false)
81 | `Joint ho -> maxsize + 1) (* we assume is big *)
83 countapplycontext current_size ac =
84 List.fold_left countp current_size ac
86 countconclude current_size co =
87 if current_size > maxsize then current_size
89 let c1 = countargs current_size co.Con.conclude_args in
90 if c1 > maxsize then c1
92 (match co.Con.conclude_conclusion with
93 Some concl -> countterm c1 concl
96 countargs current_size args =
97 List.fold_left countarg current_size args
99 countarg current_size arg =
100 if current_size > maxsize then current_size
103 Con.Aux _ -> current_size
104 | Con.Premise prem ->
105 (match prem.Con.premise_binder with
106 Some s -> current_size + (String.length s)
107 | None -> current_size + 7)
109 current_size + (String.length lemma.Con.lemma_name)
110 | Con.Term t -> countterm current_size t
111 | Con.ArgProof p -> countp current_size p
112 | Con.ArgMethod s -> (maxsize + 1)) in
113 let size = (countp 0 p) in
117 let is_big = is_big_general (Cexpr2pres.countterm)
121 let module Con = Content in
124 | `Hypothesis d -> d.Con.dec_id
125 | `Proof p -> p.Con.proof_id
126 | `Definition d -> d.Con.def_id
127 | `Joint jo -> jo.Con.joint_id
130 let make_row ?(attrs=[]) items concl =
131 let module P = Mpresentation in
133 P.Mtable _ -> (* big! *)
134 P.Mtable (attrs@[None,"align","baseline 1"; None,"equalrows","false";
135 None,"columnalign","left"],
136 [P.Mtr([],[P.Mtd ([],P.Mrow([],items))]);
137 P.Mtr ([],[P.Mtd ([],P.indented concl)])])
139 P.Mrow(attrs,items@[P.Mspace([None,"width","0.1cm"]);concl]))
142 let make_concl ?(attrs=[]) verb concl =
143 let module P = Mpresentation in
145 P.Mtable _ -> (* big! *)
146 P.Mtable (attrs@[None,"align","baseline 1"; None,"equalrows","false";
147 None,"columnalign","left"],
148 [P.Mtr([],[P.Mtd ([],P.Mtext([None,"mathcolor","Red"],verb))]);
149 P.Mtr ([],[P.Mtd ([],P.indented concl)])])
152 [P.Mtext([None,"mathcolor","Red"],verb);
153 P.Mspace([None,"width","0.1cm"]);
157 let make_args_for_apply term2pres args =
158 let module Con = Content in
159 let module P = Mpresentation in
160 let make_arg_for_apply is_first arg row =
163 Con.Aux n -> assert false
164 | Con.Premise prem ->
166 (match prem.Con.premise_binder with
171 P.Mi([],lemma.Con.lemma_name)::row
175 else P.Mi([],"_")::row
180 if is_first then res else P.smallskip::res
184 make_arg_for_apply true hd
185 (List.fold_right (make_arg_for_apply false) tl [])
189 let rec justification term2pres p =
190 let module Con = Content in
191 let module P = Mpresentation in
192 if ((p.Con.proof_conclude.Con.conclude_method = "Exact") or
193 ((p.Con.proof_context = []) &
194 (p.Con.proof_apply_context = []) &
195 (p.Con.proof_conclude.Con.conclude_method = "Apply"))) then
197 make_args_for_apply term2pres p.Con.proof_conclude.Con.conclude_args in
199 P.Mtext([None,"mathcolor","Red"],"by")::P.Mspace([None,"width","0.1cm"])::
200 P.Mo([],"(")::pres_args@[P.Mo([],")")])
201 else proof2pres term2pres p
203 and proof2pres term2pres p =
204 let rec proof2pres p =
205 let module Con = Content in
206 let module P = Mpresentation in
211 | `Hypothesis _ -> true
213 ((List.filter is_decl p.Con.proof_context) != []) in
214 let omit_conclusion = (not indent) && (p.Con.proof_context != []) in
216 (match p.Con.proof_conclude.Con.conclude_conclusion with
218 | Some t -> Some (term2pres t)) in
221 conclude2pres p.Con.proof_conclude indent omit_conclusion in
223 acontext2pres p.Con.proof_apply_context presconclude indent in
224 context2pres p.Con.proof_context presacontext in
225 match p.Con.proof_name with
233 ([None,"actiontype","toggle" ; None,"selection","1"],
234 [P.Mtext [] "proof" ; body])
238 ([None,"actiontype","toggle" ; None,"selection","1"],
239 [(make_concl ~attrs:[Some "helm", "xref", p.Con.proof_id]
240 "proof of" ac); body])
242 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
243 None,"columnalign","left"],
244 [P.Mtr ([],[P.Mtd ([],P.Mfenced([],[P.Mtext ([],name)]))]);
245 P.Mtr ([],[P.Mtd ([], P.indented action)])])
247 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
248 None,"columnalign","left";Some "helm", "xref", p.Con.proof_id],
249 [P.Mtr ([],[P.Mtd ([],P.Mfenced([],[P.Mtext ([],name)]))]);
250 P.Mtr ([],[P.Mtd ([], P.indented action)])]) *)
252 and context2pres c continuation =
253 (* we generate a subtable for each context element, for selection
255 The table generated by the head-element does not have an xref;
256 the whole context-proof is already selectable *)
257 let module P = Mpresentation in
263 (fun ce continuation ->
264 let xref = get_xref ce in
265 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
266 None,"columnalign","left"; Some "helm", "xref", xref ],
267 [P.Mtr([Some "helm", "xref", "ce_"^xref],[P.Mtd ([],ce2pres ce)]);
268 P.Mtr([],[P.Mtd ([], continuation)])])) tl continuation in
269 let hd_xref= get_xref hd in
270 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
271 None,"columnalign","left"],
272 [P.Mtr([Some "helm", "xref", "ce_"^hd_xref],
273 [P.Mtd ([],ce2pres hd)]);
274 P.Mtr([],[P.Mtd ([], continuation')])])
277 let module P = Mpresentation in
278 let module Con = Content in
281 (match d.Con.dec_name with
283 let ty = term2pres d.Con.dec_type in
285 [P.Mtext([None,"mathcolor","Red"],"Assume");
286 P.Mspace([None,"width","0.1cm"]);
291 prerr_endline "NO NAME!!"; assert false)
293 (match h.Con.dec_name with
295 let ty = term2pres h.Con.dec_type in
297 [P.Mtext([None,"mathcolor","Red"],"Suppose");
298 P.Mspace([None,"width","0.1cm"]);
302 P.Mspace([None,"width","0.1cm"]);
305 prerr_endline "NO NAME!!"; assert false)
309 (match d.Con.def_name with
311 let term = term2pres d.Con.def_term in
318 prerr_endline "NO NAME!!"; assert false)
320 P.Mtext ([],"jointdef")
322 and acontext2pres ac continuation indent =
323 let module Con = Content in
324 let module P = Mpresentation in
326 (fun p continuation ->
329 P.indented (proof2pres p)
332 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
333 None,"columnalign","left"; Some "helm","xref",p.Con.proof_id],
334 [P.Mtr([Some "helm","xref","ace_"^p.Con.proof_id],[P.Mtd ([],hd)]);
335 P.Mtr([],[P.Mtd ([], continuation)])])) ac continuation
337 and conclude2pres conclude indent omit_conclusion =
338 let module Con = Content in
339 let module P = Mpresentation in
341 match conclude.Con.conclude_conclusion with
342 Some t when not omit_conclusion ->
343 let concl = (term2pres t) in
344 if conclude.Con.conclude_method = "BU_Conversion" then
345 make_concl "that is equivalent to" concl
346 else if conclude.Con.conclude_method = "FalseInd" then
347 (* false ind is in charge to add the conclusion *)
350 let conclude_body = conclude_aux conclude in
352 if conclude.Con.conclude_method = "TD_Conversion" then
353 make_concl "that is equivalent to" concl
354 else make_concl "we conclude" concl in
355 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
356 None,"columnalign","left"],
357 [P.Mtr ([],[P.Mtd ([],conclude_body)]);
358 P.Mtr ([],[P.Mtd ([],ann_concl)])])
359 | _ -> conclude_aux conclude in
361 P.indented (P.Mrow ([Some "helm", "xref", conclude.Con.conclude_id],
364 P.Mrow ([Some "helm", "xref", conclude.Con.conclude_id],[tconclude_body])
367 and conclude_aux conclude =
368 let module Con = Content in
369 let module P = Mpresentation in
370 if conclude.Con.conclude_method = "TD_Conversion" then
372 (match conclude.Con.conclude_conclusion with
373 None -> P.Mtext([],"NO EXPECTED!!!")
374 | Some c -> term2pres c) in
376 (match conclude.Con.conclude_args with
377 [Con.ArgProof p] -> p
378 | _ -> assert false) in
380 (match subproof.Con.proof_conclude.Con.conclude_conclusion with
381 None -> P.Mtext([],"NO SYNTH!!!")
382 | Some c -> (term2pres c)) in
384 ([None,"align","baseline 1"; None,"equalrows","false"; None,"columnalign","left"],
385 [P.Mtr([],[P.Mtd([],make_concl "we must prove" expected)]);
386 P.Mtr([],[P.Mtd([],make_concl "or equivalently" synth)]);
387 P.Mtr([],[P.Mtd([],proof2pres subproof)])])
388 else if conclude.Con.conclude_method = "BU_Conversion" then
390 else if conclude.Con.conclude_method = "Exact" then
392 (match conclude.Con.conclude_args with
393 [Con.Term t] -> term2pres t
394 | _ -> assert false) in
395 (match conclude.Con.conclude_conclusion with
398 [P.Mtext [None, "mathcolor", "red"] "Consider" ; P.smallskip; arg]
399 | Some c -> let conclusion = term2pres c in
401 [arg; P.Mspace([None,"width","0.1cm"]);P.Mtext([],"proves")]
404 else if conclude.Con.conclude_method = "Intros+LetTac" then
405 (match conclude.Con.conclude_args with
406 [Con.ArgProof p] -> proof2pres p
410 (match conclude.Con.conclude_conclusion with
411 None -> P.Mtext([],"NO Conclusion!!!")
412 | Some c -> term2pres c) in
413 (match conclude.Con.conclude_args with
416 ([None,"align","baseline 1"; None,"equalrows","false";
417 None,"columnalign","left"],
418 [P.Mtr([],[P.Mtd([],proof2pres p)]);
420 (make_concl "we proved 1" conclusion))])]);
423 else if (conclude.Con.conclude_method = "ByInduction") then
425 else if (conclude.Con.conclude_method = "Exists") then
427 else if (conclude.Con.conclude_method = "AndInd") then
429 else if (conclude.Con.conclude_method = "FalseInd") then
431 else if (conclude.Con.conclude_method = "Rewrite") then
433 (match (List.nth conclude.Con.conclude_args 6) with
434 Con.ArgProof p -> justification term2pres p
435 | _ -> assert false) in
437 (match List.nth conclude.Con.conclude_args 2 with
438 Con.Term t -> term2pres t
439 | _ -> assert false) in
441 (match List.nth conclude.Con.conclude_args 5 with
442 Con.Term t -> term2pres t
443 | _ -> assert false) in
444 P.Mtable ([None,"align","baseline 1";None,"equalrows","false";
445 None,"columnalign","left"],
446 [P.Mtr ([],[P.Mtd ([],P.Mrow([],[
447 P.Mtext([None,"mathcolor","Red"],"rewrite");
448 P.Mspace([None,"width","0.1cm"]);term1;
449 P.Mspace([None,"width","0.1cm"]);
450 P.Mtext([None,"mathcolor","Red"],"with");
451 P.Mspace([None,"width","0.1cm"]);term2]))]);
452 P.Mtr ([],[P.Mtd ([],P.indented justif)])]);
453 else if conclude.Con.conclude_method = "Apply" then
455 make_args_for_apply term2pres conclude.Con.conclude_args in
457 P.Mtext([None,"mathcolor","Red"],"by")::
458 P.Mspace([None,"width","0.1cm"])::
459 P.Mo([],"(")::pres_args@[P.Mo([],")")])
462 ([None,"align","baseline 1"; None,"equalrows","false"; None,"columnalign","left"],
463 [P.Mtr ([],[P.Mtd ([],P.Mtext([],"Apply method" ^ conclude.Con.conclude_method ^ " to"))]);
468 ([None,"align","baseline 1"; None,"equalrows","false";
469 None,"columnalign","left"],
470 args2pres conclude.Con.conclude_args))))])])
473 let module P = Mpresentation in
475 (function a -> P.Mtr ([], [P.Mtd ([], arg2pres a)])) l
478 let module P = Mpresentation in
479 let module Con = Content in
482 P.Mtext ([],"aux " ^ n)
483 | Con.Premise prem ->
484 P.Mtext ([],"premise")
492 P.Mtext ([],"method")
494 and byinduction conclude =
495 let module P = Mpresentation in
496 let module Con = Content in
497 let proof_conclusion =
498 (match conclude.Con.conclude_conclusion with
499 None -> P.Mtext([],"No conclusion???")
500 | Some t -> term2pres t) in
501 let inductive_arg,args_for_cases =
502 (match conclude.Con.conclude_args with
504 let l1,l2 = split (int_of_string n) tl in
505 let last_pos = (List.length l2)-1 in
506 List.nth l2 last_pos,l1
507 | _ -> assert false) in
510 (match inductive_arg with
512 P.Mtext ([],"an aux???")
513 | Con.Premise prem ->
514 (match prem.Con.premise_binder with
515 None -> P.Mtext ([],"the previous result")
516 | Some n -> P.Mi([],n))
517 | Con.Lemma lemma -> P.Mi([],lemma.Con.lemma_name)
521 P.Mtext ([],"a proof???")
523 P.Mtext ([],"a method???")) in
524 (make_concl "we proceede by induction on" arg) in
526 (make_concl "to prove" proof_conclusion) in
528 ([None,"align","baseline 1"; None,"equalrows","false";
529 None,"columnalign","left"],
530 P.Mtr ([],[P.Mtd ([],induction_on)])::
531 P.Mtr ([],[P.Mtd ([],to_prove)])::
532 (make_cases args_for_cases))
534 and make_cases args_for_cases =
535 let module P = Mpresentation in
537 (fun p -> P.Mtr ([],[P.Mtd ([],make_case p)])) args_for_cases
540 let module P = Mpresentation in
541 let module Con = Content in
545 (match p.Con.proof_name with
546 None -> P.Mtext([],"no name for case!!")
547 | Some n -> P.Mi([],n)) in
551 `Hypothesis h -> h.Con.dec_inductive
552 | _ -> false) p.Con.proof_context in
561 (match h.Con.dec_name with
564 [P.Mspace([None,"width","0.1cm"]);
567 (term2pres h.Con.dec_type)]
568 | _ -> [P.Mtext ([],"???")]) in
571 P.Mtr ([],[P.Mtd ([],P.Mrow([],
572 P.Mtext([],"Case")::P.Mspace([None,"width","0.1cm"])::name::pattern_aux@
573 [P.Mspace([None,"width","0.1cm"]);
574 P.Mtext([],"->")]))]) in
576 (match p.Con.proof_conclude.Con.conclude_conclusion with
577 None -> P.Mtext([],"No conclusion!!!")
578 | Some t -> term2pres t) in
581 P.indented (make_concl "the thesis becomes" subconcl))]) in
582 let induction_hypothesis =
587 P.Mtr([],[P.Mtd([], P.indented
588 (P.Mtext([],"by induction hypothesis we know:")))]) in
593 (match h.Con.dec_name with
596 P.indented (P.Mrow ([],
600 P.Mspace([None,"width","0.1cm"]);
601 term2pres h.Con.dec_type]))
602 | _ -> assert false in
605 (function ce -> P.Mtr ([], [P.Mtd ([], make_hyp ce)]))
609 acontext2pres_old p.Con.proof_apply_context true in *)
610 let body = conclude2pres p.Con.proof_conclude true false in
613 match p.Con.proof_apply_context with
614 [] -> p.Con.proof_conclude.Con.conclude_id
615 | {Con.proof_id = id}::_ -> id
617 P.Maction([None,"actiontype","toggle" ; None,"selection","1"],
620 ([None,"mathcolor","Red" ;
621 Some "helm", "xref", acontext_id],"Proof")) ;
622 acontext2pres p.Con.proof_apply_context body true]) in
623 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
624 None,"columnalign","left"],
625 pattern::asubconcl::induction_hypothesis@
626 [P.Mtr([],[P.Mtd([],presacontext)])])
629 and falseind conclude =
630 let module P = Mpresentation in
631 let module Con = Content in
632 let proof_conclusion =
633 (match conclude.Con.conclude_conclusion with
634 None -> P.Mtext([],"No conclusion???")
635 | Some t -> term2pres t) in
637 (match conclude.Con.conclude_args with
638 [Con.Aux(n);_;case_arg] -> case_arg
641 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
645 Con.Aux n -> assert false
646 | Con.Premise prem ->
647 (match prem.Con.premise_binder with
648 None -> [P.Mtext([],"Contradiction, hence")]
650 [P.Mi([],n);P.smallskip;P.Mtext([],"is contradictory, hence")])
652 [P.Mi([],lemma.Con.lemma_name);P.smallskip;P.Mtext([],"is contradictory, hence")]
653 | _ -> assert false) in
654 (* let body = proof2pres {proof with Con.proof_context = tl} in *)
655 make_row arg proof_conclusion
657 and andind conclude =
658 let module P = Mpresentation in
659 let module Con = Content in
660 let proof_conclusion =
661 (match conclude.Con.conclude_conclusion with
662 None -> P.Mtext([],"No conclusion???")
663 | Some t -> term2pres t) in
665 (match conclude.Con.conclude_args with
666 [Con.Aux(n);_;Con.ArgProof proof;case_arg] -> proof,case_arg
669 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
673 Con.Aux n -> assert false
674 | Con.Premise prem ->
675 (match prem.Con.premise_binder with
677 | Some n -> [P.Mtext([],"by");P.smallskip;P.Mi([],n)])
679 [P.Mtext([],"by");P.smallskip;P.Mi([],lemma.Con.lemma_name)]
680 | _ -> assert false) in
681 match proof.Con.proof_context with
682 `Hypothesis hyp1::`Hypothesis hyp2::tl ->
684 (match hyp.Con.dec_name with
690 P.Mi([],get_name hyp1);
693 term2pres hyp1.Con.dec_type]) in
697 P.Mi([],get_name hyp2);
700 term2pres hyp2.Con.dec_type]) in
701 (* let body = proof2pres {proof with Con.proof_context = tl} in *)
702 let body = conclude2pres proof.Con.proof_conclude false true in
704 acontext2pres proof.Con.proof_apply_context body false in
706 ([None,"align","baseline 1"; None,"equalrows","false";
707 None,"columnalign","left"],
708 [P.Mtr ([],[P.Mtd ([],
709 P.Mrow([],arg@[P.smallskip;P.Mtext([],"we have")]))]);
710 P.Mtr ([],[P.Mtd ([],preshyp1)]);
711 P.Mtr ([],[P.Mtd ([],P.Mtext([],"and"))]);
712 P.Mtr ([],[P.Mtd ([],preshyp2)]);
713 P.Mtr ([],[P.Mtd ([],presacontext)])]);
716 and exists conclude =
717 let module P = Mpresentation in
718 let module Con = Content in
719 let proof_conclusion =
720 (match conclude.Con.conclude_conclusion with
721 None -> P.Mtext([],"No conclusion???")
722 | Some t -> term2pres t) in
724 (match conclude.Con.conclude_args with
725 [Con.Aux(n);_;Con.ArgProof proof;_] -> proof
728 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
730 match proof.Con.proof_context with
731 `Declaration decl::`Hypothesis hyp::tl
732 | `Hypothesis decl::`Hypothesis hyp::tl ->
734 (match decl.Con.dec_name with
739 [P.Mtext([None,"mathcolor","Red"],"let");
741 P.Mi([],get_name decl);
742 P.Mtext([],":"); term2pres decl.Con.dec_type]) in
745 [P.Mtext([None,"mathcolor","Red"],"such that");
748 P.Mi([],get_name hyp);
751 term2pres hyp.Con.dec_type]) in
752 (* let body = proof2pres {proof with Con.proof_context = tl} in *)
753 let body = conclude2pres proof.Con.proof_conclude false true in
755 acontext2pres proof.Con.proof_apply_context body false in
757 ([None,"align","baseline 1"; None,"equalrows","false";
758 None,"columnalign","left"],
759 [P.Mtr ([],[P.Mtd ([],presdecl)]);
760 P.Mtr ([],[P.Mtd ([],suchthat)]);
761 P.Mtr ([],[P.Mtd ([],presacontext)])]);
762 | _ -> assert false in
769 let content2pres term2pres (id,params,metasenv,obj) =
770 let module K = Content in
771 let module P = Mpresentation in
773 `Def (K.Const,thesis,`Proof p) ->
775 [None,"align","baseline 1";
776 None,"equalrows","false";
777 None,"columnalign","left";
778 None,"helm:xref","id"]
783 ("UNFINISHED PROOF" ^ id ^"(" ^
784 String.concat " ; " (List.map UriManager.string_of_uri params)^
789 [P.Mtext [] "THESIS:"])] ;
795 term2pres thesis])]] @
801 (* Conjectures are in their own table to make *)
802 (* diffing the DOM trees easier. *)
804 [None,"align","baseline 1";
805 None,"equalrows","false";
806 None,"columnalign","left"]
810 [P.Mtext [] "CONJECTURES:"])])::
816 (P.Mrow [Some "helm", "xref", id]
824 | Some (`Declaration d)
825 | Some (`Hypothesis d) ->
827 { K.dec_name = dec_name ;
828 K.dec_type = ty } = d
837 | Some (`Definition d) ->
839 { K.def_name = def_name ;
840 K.def_term = bo } = d
850 let proof_name = p.K.proof_name in
853 (match proof_name with
857 proof2pres term2pres p]
858 ) (List.rev context) @
860 [ P.Mi [] (string_of_int n) ;
871 [proof2pres term2pres p])]])
875 let content2pres ~ids_to_inner_sorts =
878 (Cexpr2pres.cexpr2pres_charcount
879 (Content_expressions.acic2cexpr ids_to_inner_sorts p)))