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 rec make_arg_for_apply is_first arg row =
162 Con.Aux n -> assert false
163 | Con.Premise prem ->
165 (match prem.Con.premise_binder with
168 P.smallskip::P.Mi([],name)::row
170 P.smallskip::P.Mi([],lemma.Con.lemma_name)::row
174 else P.smallskip::P.Mi([],"_")::row
177 P.smallskip::P.Mi([],"_")::row) in
180 make_arg_for_apply true hd
181 (List.fold_right (make_arg_for_apply false) tl [])
182 | _ -> assert false;;
184 let rec justification term2pres p =
185 let module Con = Content in
186 let module P = Mpresentation in
187 if ((p.Con.proof_conclude.Con.conclude_method = "Exact") or
188 ((p.Con.proof_context = []) &
189 (p.Con.proof_apply_context = []) &
190 (p.Con.proof_conclude.Con.conclude_method = "Apply"))) then
192 make_args_for_apply term2pres p.Con.proof_conclude.Con.conclude_args in
194 P.Mtext([None,"mathcolor","Red"],"by")::P.Mspace([None,"width","0.1cm"])::
195 P.Mo([],"(")::pres_args@[P.Mo([],")")])
196 else proof2pres term2pres p
198 and proof2pres term2pres p =
199 let rec proof2pres p =
200 let module Con = Content in
201 let module P = Mpresentation in
206 | `Hypothesis _ -> true
208 ((List.filter is_decl p.Con.proof_context) != []) in
209 let omit_conclusion = (not indent) && (p.Con.proof_context != []) in
211 (match p.Con.proof_conclude.Con.conclude_conclusion with
213 | Some t -> Some (term2pres t)) in
216 conclude2pres p.Con.proof_conclude indent omit_conclusion in
218 acontext2pres p.Con.proof_apply_context presconclude indent in
219 context2pres p.Con.proof_context presacontext in
220 match p.Con.proof_name with
228 ([None,"actiontype","toggle" ; None,"selection","1"],
229 [P.Mtext [] "proof" ; body])
233 ([None,"actiontype","toggle" ; None,"selection","1"],
234 [(make_concl "proof of" ac); body])
236 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
237 None,"columnalign","left"],
238 [P.Mtr ([],[P.Mtd ([],P.Mfenced([],[P.Mtext ([],name)]))]);
239 P.Mtr ([],[P.Mtd ([], P.indented action)])])
241 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
242 None,"columnalign","left";Some "helm", "xref", p.Con.proof_id],
243 [P.Mtr ([],[P.Mtd ([],P.Mfenced([],[P.Mtext ([],name)]))]);
244 P.Mtr ([],[P.Mtd ([], P.indented action)])]) *)
246 and context2pres c continuation =
247 (* we generate a subtable for each context element, for selection
249 The table generated by the head-element does not have an xref;
250 the whole context-proof is already selectable *)
251 let module P = Mpresentation in
257 (fun ce continuation ->
258 let xref = get_xref ce in
259 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
260 None,"columnalign","left"; Some "helm", "xref", xref ],
261 [P.Mtr([Some "helm", "xref", "ce_"^xref],[P.Mtd ([],ce2pres ce)]);
262 P.Mtr([],[P.Mtd ([], continuation)])])) tl continuation in
263 let hd_xref= get_xref hd in
264 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
265 None,"columnalign","left"],
266 [P.Mtr([Some "helm", "xref", "ce_"^hd_xref],
267 [P.Mtd ([],ce2pres hd)]);
268 P.Mtr([],[P.Mtd ([], continuation')])])
271 let module P = Mpresentation in
272 let module Con = Content in
275 (match d.Con.dec_name with
277 let ty = term2pres d.Con.dec_type in
279 [P.Mtext([None,"mathcolor","Red"],"Assume");
280 P.Mspace([None,"width","0.1cm"]);
285 prerr_endline "NO NAME!!"; assert false)
287 (match h.Con.dec_name with
289 let ty = term2pres h.Con.dec_type in
291 [P.Mtext([None,"mathcolor","Red"],"Suppose");
292 P.Mspace([None,"width","0.1cm"]);
296 P.Mspace([None,"width","0.1cm"]);
299 prerr_endline "NO NAME!!"; assert false)
301 (match p.Con.proof_name with
302 Some "w" -> prerr_endline ("processing w");
306 (match d.Con.def_name with
308 let term = term2pres d.Con.def_term in
315 prerr_endline "NO NAME!!"; assert false)
317 P.Mtext ([],"jointdef")
319 and acontext2pres ac continuation indent =
320 let module Con = Content in
321 let module P = Mpresentation in
323 (fun p continuation ->
326 P.indented (proof2pres p)
329 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
330 None,"columnalign","left"; Some "helm","xref",p.Con.proof_id],
331 [P.Mtr([Some "helm","xref","ace_"^p.Con.proof_id],[P.Mtd ([],hd)]);
332 P.Mtr([],[P.Mtd ([], continuation)])])) ac continuation
334 and conclude2pres conclude indent omit_conclusion =
335 let module Con = Content in
336 let module P = Mpresentation in
338 match conclude.Con.conclude_conclusion with
339 Some t when not omit_conclusion ->
340 let concl = (term2pres t) in
341 if conclude.Con.conclude_method = "BU_Conversion" then
342 make_concl "that is equivalent to" concl
344 let conclude_body = conclude_aux conclude in
345 let ann_concl = make_concl "we conclude" concl in
346 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
347 None,"columnalign","left"],
348 [P.Mtr ([],[P.Mtd ([],conclude_body)]);
349 P.Mtr ([],[P.Mtd ([],ann_concl)])])
350 | _ -> conclude_aux conclude in
352 P.indented (P.Mrow ([Some "helm", "xref", conclude.Con.conclude_id],
355 P.Mrow ([Some "helm", "xref", conclude.Con.conclude_id],[tconclude_body])
358 and conclude_aux conclude =
359 let module Con = Content in
360 let module P = Mpresentation in
361 if conclude.Con.conclude_method = "TD_Conversion" then
363 (match conclude.Con.conclude_conclusion with
364 None -> P.Mtext([],"NO EXPECTED!!!")
365 | Some c -> term2pres c) in
367 (match conclude.Con.conclude_args with
368 [Con.ArgProof p] -> p
369 | _ -> assert false) in
371 (match subproof.Con.proof_conclude.Con.conclude_conclusion with
372 None -> P.Mtext([],"NO SYNTH!!!")
373 | Some c -> (term2pres c)) in
375 ([None,"align","baseline 1"; None,"equalrows","false"; None,"columnalign","left"],
376 [P.Mtr([],[P.Mtd([],make_concl "we must prove" expected)]);
377 P.Mtr([],[P.Mtd([],make_concl "or equivalently" synth)]);
378 P.Mtr([],[P.Mtd([],proof2pres subproof)])])
379 else if conclude.Con.conclude_method = "BU_Conversion" then
381 else if conclude.Con.conclude_method = "Exact" then
383 (match conclude.Con.conclude_args with
384 [Con.Term t] -> term2pres t
385 | _ -> assert false) in
386 (match conclude.Con.conclude_conclusion with
389 [P.Mtext [None, "mathcolor", "red"] "Consider" ; P.smallskip; arg]
390 | Some c -> let conclusion = term2pres c in
392 [arg; P.Mspace([None,"width","0.1cm"]);P.Mtext([],"proves")]
395 else if conclude.Con.conclude_method = "Intros+LetTac" then
396 (match conclude.Con.conclude_args with
397 [Con.ArgProof p] -> proof2pres p
401 (match conclude.Con.conclude_conclusion with
402 None -> P.Mtext([],"NO Conclusion!!!")
403 | Some c -> term2pres c) in
404 (match conclude.Con.conclude_args with
407 ([None,"align","baseline 1"; None,"equalrows","false";
408 None,"columnalign","left"],
409 [P.Mtr([],[P.Mtd([],proof2pres p)]);
411 (make_concl "we proved 1" conclusion))])]);
414 else if (conclude.Con.conclude_method = "ByInduction") then
416 else if (conclude.Con.conclude_method = "Exists") then
418 else if (conclude.Con.conclude_method = "Rewrite") then
420 (match (List.nth conclude.Con.conclude_args 6) with
421 Con.ArgProof p -> justification term2pres p
422 | _ -> assert false) in
424 (match List.nth conclude.Con.conclude_args 2 with
425 Con.Term t -> term2pres t
426 | _ -> assert false) in
428 (match List.nth conclude.Con.conclude_args 5 with
429 Con.Term t -> term2pres t
430 | _ -> assert false) in
431 P.Mtable ([None,"align","baseline 1";None,"equalrows","false";
432 None,"columnalign","left"],
433 [P.Mtr ([],[P.Mtd ([],P.Mrow([],[
434 P.Mtext([None,"mathcolor","Red"],"rewrite");
435 P.Mspace([None,"width","0.1cm"]);term1;
436 P.Mspace([None,"width","0.1cm"]);
437 P.Mtext([None,"mathcolor","Red"],"with");
438 P.Mspace([None,"width","0.1cm"]);term2]))]);
439 P.Mtr ([],[P.Mtd ([],P.indented justif)])]);
442 (match conclude.Con.conclude_conclusion with
443 None -> P.Mtext([],"NO Conclusion!!!")
444 | Some c -> term2pres c) in
445 P.Mtable ([None,"align","baseline 1";None,"equalrows","false";
446 None,"columnalign","left"],
447 [P.Mtr ([],[P.Mtd ([],P.Mrow([],[
448 P.Mtext([None,"mathcolor","Red"],"rewrite");
449 P.Mspace([None,"width","0.1cm"]);term1;
450 P.Mspace([None,"width","0.1cm"]);
451 P.Mtext([None,"mathcolor","Red"],"with");
452 P.Mspace([None,"width","0.1cm"]);term2]))]);
453 P.Mtr ([],[P.Mtd ([],P.indented justif)]);
454 P.Mtr ([],[P.Mtd ([],make_concl "we proved 2" conclusion)])]) *)
455 else if conclude.Con.conclude_method = "Apply" then
457 make_args_for_apply term2pres conclude.Con.conclude_args in
459 P.Mtext([None,"mathcolor","Red"],"by")::
460 P.Mspace([None,"width","0.1cm"])::
461 P.Mo([],"(")::pres_args@[P.Mo([],")")])
465 P.Mtext([None,"mathcolor","Red"],"by")::P.Mspace([None,"width","0.1cm"])::
466 P.Mo([],"(")::pres_args@[P.Mo([],")")]) in
467 match conclude.Con.conclude_conclusion with
468 None -> P.Mrow([],[P.Mtext([],"QUA");by])
470 let concl = (term2pres t) in
471 let ann_concl = make_concl "we proved 3" concl in
472 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
473 None,"columnalign","left";
474 Some "helm", "xref", conclude.Con.conclude_id],
475 [P.Mtr ([],[P.Mtd ([],by)]);
476 P.Mtr ([],[P.Mtd ([],ann_concl)])]) *)
479 ([None,"align","baseline 1"; None,"equalrows","false"; None,"columnalign","left"],
480 [P.Mtr ([],[P.Mtd ([],P.Mtext([],"Apply method" ^ conclude.Con.conclude_method ^ " to"))]);
485 ([None,"align","baseline 1"; None,"equalrows","false";
486 None,"columnalign","left"],
487 args2pres conclude.Con.conclude_args))))])])
489 match conclude.Con.conclude_conclusion with
492 let concl = (term2pres t) in
493 let ann_concl = make_concl "we proved 4" concl in
494 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
495 None,"columnalign","left"],
496 [P.Mtr ([],[P.Mtd ([],body)]);
497 P.Mtr ([],[P.Mtd ([],ann_concl)])]) *)
500 let module P = Mpresentation in
502 (function a -> P.Mtr ([], [P.Mtd ([], arg2pres a)])) l
505 let module P = Mpresentation in
506 let module Con = Content in
509 P.Mtext ([],"aux " ^ n)
510 | Con.Premise prem ->
511 P.Mtext ([],"premise")
519 P.Mtext ([],"method")
521 and byinduction conclude =
522 let module P = Mpresentation in
523 let module Con = Content in
524 let proof_conclusion =
525 (match conclude.Con.conclude_conclusion with
526 None -> P.Mtext([],"No conclusion???")
527 | Some t -> term2pres t) in
528 let inductive_arg,args_for_cases =
529 (match conclude.Con.conclude_args with
531 let l1,l2 = split (int_of_string n) tl in
532 let last_pos = (List.length l2)-1 in
533 List.nth l2 last_pos,l1
534 | _ -> assert false) in
537 (match inductive_arg with
539 P.Mtext ([],"an aux???")
540 | Con.Premise prem ->
541 (match prem.Con.premise_binder with
542 None -> P.Mtext ([],"the previous result")
543 | Some n -> P.Mi([],n))
544 | Con.Lemma lemma -> P.Mi([],lemma.Con.lemma_name)
548 P.Mtext ([],"a proof???")
550 P.Mtext ([],"a method???")) in
551 (make_concl "we proceede by induction on" arg) in
553 (make_concl "to prove" proof_conclusion) in
555 ([None,"align","baseline 1"; None,"equalrows","false";
556 None,"columnalign","left"],
557 P.Mtr ([],[P.Mtd ([],induction_on)])::
558 P.Mtr ([],[P.Mtd ([],to_prove)])::
559 (make_cases args_for_cases))
561 and make_cases args_for_cases =
562 let module P = Mpresentation in
564 (fun p -> P.Mtr ([],[P.Mtd ([],make_case p)])) args_for_cases
567 let module P = Mpresentation in
568 let module Con = Content in
572 (match p.Con.proof_name with
573 None -> P.Mtext([],"no name for case!!")
574 | Some n -> P.Mi([],n)) in
578 `Hypothesis h -> h.Con.dec_inductive
579 | _ -> false) p.Con.proof_context in
588 (match h.Con.dec_name with
591 [P.Mspace([None,"width","0.1cm"]);
594 (term2pres h.Con.dec_type)]
595 | _ -> [P.Mtext ([],"???")]) in
598 P.Mtr ([],[P.Mtd ([],P.Mrow([],
599 P.Mtext([],"Case")::P.Mspace([None,"width","0.1cm"])::name::pattern_aux@
600 [P.Mspace([None,"width","0.1cm"]);
601 P.Mtext([],"->")]))]) in
603 (match p.Con.proof_conclude.Con.conclude_conclusion with
604 None -> P.Mtext([],"No conclusion!!!")
605 | Some t -> term2pres t) in
608 P.indented (make_concl "the thesis becomes" subconcl))]) in
609 let induction_hypothesis =
614 P.Mtr([],[P.Mtd([], P.indented
615 (P.Mtext([],"by induction hypothesis we know:")))]) in
620 (match h.Con.dec_name with
623 P.indented (P.Mrow ([],
627 P.Mspace([None,"width","0.1cm"]);
628 term2pres h.Con.dec_type]))
629 | _ -> assert false in
632 (function ce -> P.Mtr ([], [P.Mtd ([], make_hyp ce)]))
636 acontext2pres_old p.Con.proof_apply_context true in *)
637 let body = conclude2pres p.Con.proof_conclude true false in
639 P.Maction([None,"actiontype","toggle" ; None,"selection","1"],
640 [P.indented (P.Mtext([None,"mathcolor","Red"],"Proof"));
641 acontext2pres p.Con.proof_apply_context body true]) in
642 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
643 None,"columnalign","left"],
644 pattern::asubconcl::induction_hypothesis@
645 [P.Mtr([],[P.Mtd([],presacontext)])])
648 and exists conclude =
649 let module P = Mpresentation in
650 let module Con = Content in
651 let proof_conclusion =
652 (match conclude.Con.conclude_conclusion with
653 None -> P.Mtext([],"No conclusion???")
654 | Some t -> term2pres t) in
656 (match conclude.Con.conclude_args with
657 [Con.Aux(n);_;Con.ArgProof proof;_] -> proof
660 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
662 match proof.Con.proof_context with
663 `Declaration decl::`Hypothesis hyp::tl
664 | `Hypothesis decl::`Hypothesis hyp::tl ->
666 (match decl.Con.dec_name with
671 [P.Mtext([None,"mathcolor","Red"],"let");
673 P.Mi([],get_name decl);
674 P.Mtext([],":"); term2pres decl.Con.dec_type]) in
677 [P.Mtext([None,"mathcolor","Red"],"such that");
680 P.Mi([],get_name hyp);
683 term2pres hyp.Con.dec_type]) in
684 (* let body = proof2pres {proof with Con.proof_context = tl} in *)
685 let body = conclude2pres proof.Con.proof_conclude false true in
687 acontext2pres proof.Con.proof_apply_context body false in
689 ([None,"align","baseline 1"; None,"equalrows","false";
690 None,"columnalign","left"],
691 [P.Mtr ([],[P.Mtd ([],presdecl)]);
692 P.Mtr ([],[P.Mtd ([],suchthat)]);
693 P.Mtr ([],[P.Mtd ([],presacontext)])]);
694 | _ -> assert false in
701 let content2pres term2pres (id,params,metasenv,obj) =
702 let module K = Content in
703 let module P = Mpresentation in
705 `Def (K.Const,thesis,`Proof p) ->
707 [None,"align","baseline 1";
708 None,"equalrows","false";
709 None,"columnalign","left";
710 None,"helm:xref","id"]
715 ("UNFINISHED PROOF" ^ id ^"(" ^
716 String.concat " ; " (List.map UriManager.string_of_uri params)^
721 [P.Mtext [] "THESIS:"])] ;
727 term2pres thesis])]] @
733 (* Conjectures are in their own table to make *)
734 (* diffing the DOM trees easier. *)
736 [None,"align","baseline 1";
737 None,"equalrows","false";
738 None,"columnalign","left"]
742 [P.Mtext [] "CONJECTURES:"])])::
748 (P.Mrow [Some "helm", "xref", id]
756 | (_,Some (`Declaration d))
757 | (_,Some (`Hypothesis d)) ->
759 { K.dec_name = dec_name ;
760 K.dec_type = ty } = d
769 | (_,Some (`Definition d)) ->
771 { K.def_name = def_name ;
772 K.def_term = bo } = d
781 | (_,Some (`Proof p)) ->
782 let proof_name = p.K.proof_name in
785 (match proof_name with
789 proof2pres term2pres p]
792 [ P.Mi [] (string_of_int n) ;
803 [proof2pres term2pres p])]])
807 let content2pres ~ids_to_inner_sorts =
810 (Cexpr2pres.cexpr2pres_charcount
811 (Content_expressions.acic2cexpr ids_to_inner_sorts p)))