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 "proof of" ac); body])
241 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
242 None,"columnalign","left"],
243 [P.Mtr ([],[P.Mtd ([],P.Mfenced([],[P.Mtext ([],name)]))]);
244 P.Mtr ([],[P.Mtd ([], P.indented action)])])
246 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
247 None,"columnalign","left";Some "helm", "xref", p.Con.proof_id],
248 [P.Mtr ([],[P.Mtd ([],P.Mfenced([],[P.Mtext ([],name)]))]);
249 P.Mtr ([],[P.Mtd ([], P.indented action)])]) *)
251 and context2pres c continuation =
252 (* we generate a subtable for each context element, for selection
254 The table generated by the head-element does not have an xref;
255 the whole context-proof is already selectable *)
256 let module P = Mpresentation in
262 (fun ce continuation ->
263 let xref = get_xref ce in
264 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
265 None,"columnalign","left"; Some "helm", "xref", xref ],
266 [P.Mtr([Some "helm", "xref", "ce_"^xref],[P.Mtd ([],ce2pres ce)]);
267 P.Mtr([],[P.Mtd ([], continuation)])])) tl continuation in
268 let hd_xref= get_xref hd in
269 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
270 None,"columnalign","left"],
271 [P.Mtr([Some "helm", "xref", "ce_"^hd_xref],
272 [P.Mtd ([],ce2pres hd)]);
273 P.Mtr([],[P.Mtd ([], continuation')])])
276 let module P = Mpresentation in
277 let module Con = Content in
280 (match d.Con.dec_name with
282 let ty = term2pres d.Con.dec_type in
284 [P.Mtext([None,"mathcolor","Red"],"Assume");
285 P.Mspace([None,"width","0.1cm"]);
290 prerr_endline "NO NAME!!"; assert false)
292 (match h.Con.dec_name with
294 let ty = term2pres h.Con.dec_type in
296 [P.Mtext([None,"mathcolor","Red"],"Suppose");
297 P.Mspace([None,"width","0.1cm"]);
301 P.Mspace([None,"width","0.1cm"]);
304 prerr_endline "NO NAME!!"; assert false)
306 (match p.Con.proof_name with
307 Some "w" -> prerr_endline ("processing w");
311 (match d.Con.def_name with
313 let term = term2pres d.Con.def_term in
320 prerr_endline "NO NAME!!"; assert false)
322 P.Mtext ([],"jointdef")
324 and acontext2pres ac continuation indent =
325 let module Con = Content in
326 let module P = Mpresentation in
328 (fun p continuation ->
331 P.indented (proof2pres p)
334 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
335 None,"columnalign","left"; Some "helm","xref",p.Con.proof_id],
336 [P.Mtr([Some "helm","xref","ace_"^p.Con.proof_id],[P.Mtd ([],hd)]);
337 P.Mtr([],[P.Mtd ([], continuation)])])) ac continuation
339 and conclude2pres conclude indent omit_conclusion =
340 let module Con = Content in
341 let module P = Mpresentation in
343 match conclude.Con.conclude_conclusion with
344 Some t when not omit_conclusion ->
345 let concl = (term2pres t) in
346 if conclude.Con.conclude_method = "BU_Conversion" then
347 make_concl "that is equivalent to" concl
349 let conclude_body = conclude_aux conclude in
351 if conclude.Con.conclude_method = "TD_Conversion" then
352 make_concl "that is equivalent to" concl
353 else make_concl "we conclude" concl in
354 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
355 None,"columnalign","left"],
356 [P.Mtr ([],[P.Mtd ([],conclude_body)]);
357 P.Mtr ([],[P.Mtd ([],ann_concl)])])
358 | _ -> conclude_aux conclude in
360 P.indented (P.Mrow ([Some "helm", "xref", conclude.Con.conclude_id],
363 P.Mrow ([Some "helm", "xref", conclude.Con.conclude_id],[tconclude_body])
366 and conclude_aux conclude =
367 let module Con = Content in
368 let module P = Mpresentation in
369 if conclude.Con.conclude_method = "TD_Conversion" then
371 (match conclude.Con.conclude_conclusion with
372 None -> P.Mtext([],"NO EXPECTED!!!")
373 | Some c -> term2pres c) in
375 (match conclude.Con.conclude_args with
376 [Con.ArgProof p] -> p
377 | _ -> assert false) in
379 (match subproof.Con.proof_conclude.Con.conclude_conclusion with
380 None -> P.Mtext([],"NO SYNTH!!!")
381 | Some c -> (term2pres c)) in
383 ([None,"align","baseline 1"; None,"equalrows","false"; None,"columnalign","left"],
384 [P.Mtr([],[P.Mtd([],make_concl "we must prove" expected)]);
385 P.Mtr([],[P.Mtd([],make_concl "or equivalently" synth)]);
386 P.Mtr([],[P.Mtd([],proof2pres subproof)])])
387 else if conclude.Con.conclude_method = "BU_Conversion" then
389 else if conclude.Con.conclude_method = "Exact" then
391 (match conclude.Con.conclude_args with
392 [Con.Term t] -> term2pres t
393 | _ -> assert false) in
394 (match conclude.Con.conclude_conclusion with
397 [P.Mtext [None, "mathcolor", "red"] "Consider" ; P.smallskip; arg]
398 | Some c -> let conclusion = term2pres c in
400 [arg; P.Mspace([None,"width","0.1cm"]);P.Mtext([],"proves")]
403 else if conclude.Con.conclude_method = "Intros+LetTac" then
404 (match conclude.Con.conclude_args with
405 [Con.ArgProof p] -> proof2pres p
409 (match conclude.Con.conclude_conclusion with
410 None -> P.Mtext([],"NO Conclusion!!!")
411 | Some c -> term2pres c) in
412 (match conclude.Con.conclude_args with
415 ([None,"align","baseline 1"; None,"equalrows","false";
416 None,"columnalign","left"],
417 [P.Mtr([],[P.Mtd([],proof2pres p)]);
419 (make_concl "we proved 1" conclusion))])]);
422 else if (conclude.Con.conclude_method = "ByInduction") then
424 else if (conclude.Con.conclude_method = "Exists") then
426 else if (conclude.Con.conclude_method = "AndInd") then
428 else if (conclude.Con.conclude_method = "Rewrite") then
430 (match (List.nth conclude.Con.conclude_args 6) with
431 Con.ArgProof p -> justification term2pres p
432 | _ -> assert false) in
434 (match List.nth conclude.Con.conclude_args 2 with
435 Con.Term t -> term2pres t
436 | _ -> assert false) in
438 (match List.nth conclude.Con.conclude_args 5 with
439 Con.Term t -> term2pres t
440 | _ -> assert false) in
441 P.Mtable ([None,"align","baseline 1";None,"equalrows","false";
442 None,"columnalign","left"],
443 [P.Mtr ([],[P.Mtd ([],P.Mrow([],[
444 P.Mtext([None,"mathcolor","Red"],"rewrite");
445 P.Mspace([None,"width","0.1cm"]);term1;
446 P.Mspace([None,"width","0.1cm"]);
447 P.Mtext([None,"mathcolor","Red"],"with");
448 P.Mspace([None,"width","0.1cm"]);term2]))]);
449 P.Mtr ([],[P.Mtd ([],P.indented justif)])]);
452 (match conclude.Con.conclude_conclusion with
453 None -> P.Mtext([],"NO Conclusion!!!")
454 | Some c -> term2pres c) in
455 P.Mtable ([None,"align","baseline 1";None,"equalrows","false";
456 None,"columnalign","left"],
457 [P.Mtr ([],[P.Mtd ([],P.Mrow([],[
458 P.Mtext([None,"mathcolor","Red"],"rewrite");
459 P.Mspace([None,"width","0.1cm"]);term1;
460 P.Mspace([None,"width","0.1cm"]);
461 P.Mtext([None,"mathcolor","Red"],"with");
462 P.Mspace([None,"width","0.1cm"]);term2]))]);
463 P.Mtr ([],[P.Mtd ([],P.indented justif)]);
464 P.Mtr ([],[P.Mtd ([],make_concl "we proved 2" conclusion)])]) *)
465 else if conclude.Con.conclude_method = "Apply" then
467 make_args_for_apply term2pres conclude.Con.conclude_args in
469 P.Mtext([None,"mathcolor","Red"],"by")::
470 P.Mspace([None,"width","0.1cm"])::
471 P.Mo([],"(")::pres_args@[P.Mo([],")")])
475 P.Mtext([None,"mathcolor","Red"],"by")::P.Mspace([None,"width","0.1cm"])::
476 P.Mo([],"(")::pres_args@[P.Mo([],")")]) in
477 match conclude.Con.conclude_conclusion with
478 None -> P.Mrow([],[P.Mtext([],"QUA");by])
480 let concl = (term2pres t) in
481 let ann_concl = make_concl "we proved 3" concl in
482 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
483 None,"columnalign","left";
484 Some "helm", "xref", conclude.Con.conclude_id],
485 [P.Mtr ([],[P.Mtd ([],by)]);
486 P.Mtr ([],[P.Mtd ([],ann_concl)])]) *)
489 ([None,"align","baseline 1"; None,"equalrows","false"; None,"columnalign","left"],
490 [P.Mtr ([],[P.Mtd ([],P.Mtext([],"Apply method" ^ conclude.Con.conclude_method ^ " to"))]);
495 ([None,"align","baseline 1"; None,"equalrows","false";
496 None,"columnalign","left"],
497 args2pres conclude.Con.conclude_args))))])])
499 match conclude.Con.conclude_conclusion with
502 let concl = (term2pres t) in
503 let ann_concl = make_concl "we proved 4" concl in
504 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
505 None,"columnalign","left"],
506 [P.Mtr ([],[P.Mtd ([],body)]);
507 P.Mtr ([],[P.Mtd ([],ann_concl)])]) *)
510 let module P = Mpresentation in
512 (function a -> P.Mtr ([], [P.Mtd ([], arg2pres a)])) l
515 let module P = Mpresentation in
516 let module Con = Content in
519 P.Mtext ([],"aux " ^ n)
520 | Con.Premise prem ->
521 P.Mtext ([],"premise")
529 P.Mtext ([],"method")
531 and byinduction conclude =
532 let module P = Mpresentation in
533 let module Con = Content in
534 let proof_conclusion =
535 (match conclude.Con.conclude_conclusion with
536 None -> P.Mtext([],"No conclusion???")
537 | Some t -> term2pres t) in
538 let inductive_arg,args_for_cases =
539 (match conclude.Con.conclude_args with
541 let l1,l2 = split (int_of_string n) tl in
542 let last_pos = (List.length l2)-1 in
543 List.nth l2 last_pos,l1
544 | _ -> assert false) in
547 (match inductive_arg with
549 P.Mtext ([],"an aux???")
550 | Con.Premise prem ->
551 (match prem.Con.premise_binder with
552 None -> P.Mtext ([],"the previous result")
553 | Some n -> P.Mi([],n))
554 | Con.Lemma lemma -> P.Mi([],lemma.Con.lemma_name)
558 P.Mtext ([],"a proof???")
560 P.Mtext ([],"a method???")) in
561 (make_concl "we proceede by induction on" arg) in
563 (make_concl "to prove" proof_conclusion) in
565 ([None,"align","baseline 1"; None,"equalrows","false";
566 None,"columnalign","left"],
567 P.Mtr ([],[P.Mtd ([],induction_on)])::
568 P.Mtr ([],[P.Mtd ([],to_prove)])::
569 (make_cases args_for_cases))
571 and make_cases args_for_cases =
572 let module P = Mpresentation in
574 (fun p -> P.Mtr ([],[P.Mtd ([],make_case p)])) args_for_cases
577 let module P = Mpresentation in
578 let module Con = Content in
582 (match p.Con.proof_name with
583 None -> P.Mtext([],"no name for case!!")
584 | Some n -> P.Mi([],n)) in
588 `Hypothesis h -> h.Con.dec_inductive
589 | _ -> false) p.Con.proof_context in
598 (match h.Con.dec_name with
601 [P.Mspace([None,"width","0.1cm"]);
604 (term2pres h.Con.dec_type)]
605 | _ -> [P.Mtext ([],"???")]) in
608 P.Mtr ([],[P.Mtd ([],P.Mrow([],
609 P.Mtext([],"Case")::P.Mspace([None,"width","0.1cm"])::name::pattern_aux@
610 [P.Mspace([None,"width","0.1cm"]);
611 P.Mtext([],"->")]))]) in
613 (match p.Con.proof_conclude.Con.conclude_conclusion with
614 None -> P.Mtext([],"No conclusion!!!")
615 | Some t -> term2pres t) in
618 P.indented (make_concl "the thesis becomes" subconcl))]) in
619 let induction_hypothesis =
624 P.Mtr([],[P.Mtd([], P.indented
625 (P.Mtext([],"by induction hypothesis we know:")))]) in
630 (match h.Con.dec_name with
633 P.indented (P.Mrow ([],
637 P.Mspace([None,"width","0.1cm"]);
638 term2pres h.Con.dec_type]))
639 | _ -> assert false in
642 (function ce -> P.Mtr ([], [P.Mtd ([], make_hyp ce)]))
646 acontext2pres_old p.Con.proof_apply_context true in *)
647 let body = conclude2pres p.Con.proof_conclude true false in
649 P.Maction([None,"actiontype","toggle" ; None,"selection","1"],
650 [P.indented (P.Mtext([None,"mathcolor","Red"],"Proof"));
651 acontext2pres p.Con.proof_apply_context body true]) in
652 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
653 None,"columnalign","left"],
654 pattern::asubconcl::induction_hypothesis@
655 [P.Mtr([],[P.Mtd([],presacontext)])])
658 and andind conclude =
659 let module P = Mpresentation in
660 let module Con = Content in
661 let proof_conclusion =
662 (match conclude.Con.conclude_conclusion with
663 None -> P.Mtext([],"No conclusion???")
664 | Some t -> term2pres t) in
666 (match conclude.Con.conclude_args with
667 [Con.Aux(n);_;Con.ArgProof proof;case_arg] -> proof,case_arg
670 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
674 Con.Aux n -> assert false
675 | Con.Premise prem ->
676 (match prem.Con.premise_binder with
678 | Some n -> [P.Mtext([],"by");P.smallskip;P.Mi([],n)])
680 [P.Mtext([],"by");P.smallskip;P.Mi([],lemma.Con.lemma_name)]
681 | _ -> assert false) in
682 match proof.Con.proof_context with
683 `Hypothesis hyp1::`Hypothesis hyp2::tl ->
685 (match hyp.Con.dec_name with
691 P.Mi([],get_name hyp1);
694 term2pres hyp1.Con.dec_type]) in
698 P.Mi([],get_name hyp2);
701 term2pres hyp2.Con.dec_type]) in
702 (* let body = proof2pres {proof with Con.proof_context = tl} in *)
703 let body = conclude2pres proof.Con.proof_conclude false true in
705 acontext2pres proof.Con.proof_apply_context body false in
707 ([None,"align","baseline 1"; None,"equalrows","false";
708 None,"columnalign","left"],
709 [P.Mtr ([],[P.Mtd ([],
710 P.Mrow([],arg@[P.smallskip;P.Mtext([],"we have")]))]);
711 P.Mtr ([],[P.Mtd ([],preshyp1)]);
712 P.Mtr ([],[P.Mtd ([],P.Mtext([],"and"))]);
713 P.Mtr ([],[P.Mtd ([],preshyp2)]);
714 P.Mtr ([],[P.Mtd ([],presacontext)])]);
717 and exists conclude =
718 let module P = Mpresentation in
719 let module Con = Content in
720 let proof_conclusion =
721 (match conclude.Con.conclude_conclusion with
722 None -> P.Mtext([],"No conclusion???")
723 | Some t -> term2pres t) in
725 (match conclude.Con.conclude_args with
726 [Con.Aux(n);_;Con.ArgProof proof;_] -> proof
729 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
731 match proof.Con.proof_context with
732 `Declaration decl::`Hypothesis hyp::tl
733 | `Hypothesis decl::`Hypothesis hyp::tl ->
735 (match decl.Con.dec_name with
740 [P.Mtext([None,"mathcolor","Red"],"let");
742 P.Mi([],get_name decl);
743 P.Mtext([],":"); term2pres decl.Con.dec_type]) in
746 [P.Mtext([None,"mathcolor","Red"],"such that");
749 P.Mi([],get_name hyp);
752 term2pres hyp.Con.dec_type]) in
753 (* let body = proof2pres {proof with Con.proof_context = tl} in *)
754 let body = conclude2pres proof.Con.proof_conclude false true in
756 acontext2pres proof.Con.proof_apply_context body false in
758 ([None,"align","baseline 1"; None,"equalrows","false";
759 None,"columnalign","left"],
760 [P.Mtr ([],[P.Mtd ([],presdecl)]);
761 P.Mtr ([],[P.Mtd ([],suchthat)]);
762 P.Mtr ([],[P.Mtd ([],presacontext)])]);
763 | _ -> assert false in
770 let content2pres term2pres (id,params,metasenv,obj) =
771 let module K = Content in
772 let module P = Mpresentation in
774 `Def (K.Const,thesis,`Proof p) ->
776 [None,"align","baseline 1";
777 None,"equalrows","false";
778 None,"columnalign","left";
779 None,"helm:xref","id"]
784 ("UNFINISHED PROOF" ^ id ^"(" ^
785 String.concat " ; " (List.map UriManager.string_of_uri params)^
790 [P.Mtext [] "THESIS:"])] ;
796 term2pres thesis])]] @
802 (* Conjectures are in their own table to make *)
803 (* diffing the DOM trees easier. *)
805 [None,"align","baseline 1";
806 None,"equalrows","false";
807 None,"columnalign","left"]
811 [P.Mtext [] "CONJECTURES:"])])::
817 (P.Mrow [Some "helm", "xref", id]
825 | (_,Some (`Declaration d))
826 | (_,Some (`Hypothesis d)) ->
828 { K.dec_name = dec_name ;
829 K.dec_type = ty } = d
838 | (_,Some (`Definition d)) ->
840 { K.def_name = def_name ;
841 K.def_term = bo } = d
850 | (_,Some (`Proof p)) ->
851 let proof_name = p.K.proof_name in
854 (match proof_name with
858 proof2pres term2pres p]
861 [ P.Mi [] (string_of_int n) ;
872 [proof2pres term2pres p])]])
876 let content2pres ~ids_to_inner_sorts =
879 (Cexpr2pres.cexpr2pres_charcount
880 (Content_expressions.acic2cexpr ids_to_inner_sorts p)))