1 (* Copyright (C) 2003-2005, 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 (***************************************************************************)
37 module P = Mpresentation
41 let p_mtr a b = Mpresentation.Mtr(a,b)
42 let p_mtd a b = Mpresentation.Mtd(a,b)
43 let p_mtable a b = Mpresentation.Mtable(a,b)
44 let p_mtext a b = Mpresentation.Mtext(a,b)
45 let p_mi a b = Mpresentation.Mi(a,b)
46 let p_mo a b = Mpresentation.Mo(a,b)
47 let p_mrow a b = Mpresentation.Mrow(a,b)
48 let p_mphantom a b = Mpresentation.Mphantom(a,b)
53 split (n-1) (List.tl l) in
56 let get_xref = function
58 | `Hypothesis d -> d.Con.dec_id
59 | `Proof p -> p.Con.proof_id
60 | `Definition d -> d.Con.def_id
61 | `Joint jo -> jo.Con.joint_id
64 RenderingAttrs.spacing_attributes `BoxML
65 @ RenderingAttrs.indent_attributes `BoxML
67 let make_row items concl =
68 B.b_hv hv_attrs (items @ [ concl ])
71 B.b_v attrs [B.b_h [] items; B.b_indent concl]
73 B.b_h attrs (items@[B.b_space; concl]) *)
75 let make_concl ?(attrs=[]) verb concl =
76 B.b_hv (hv_attrs @ attrs) [ B.b_kw verb; concl ]
79 B.b_v attrs [ B.b_kw verb; B.b_indent concl]
81 B.b_h attrs [ B.b_kw verb; B.b_space; concl ] *)
83 let make_args_for_apply term2pres args =
84 let make_arg_for_apply is_first arg row =
87 Con.Aux n -> assert false
90 (match prem.Con.premise_binder with
93 (B.b_object (P.Mi ([], name)))::row
96 Some "helm", "xref", lemma.Con.lemma_id;
97 Some "xlink", "href", lemma.Con.lemma_uri ]
99 (B.b_object (P.Mi(lemma_attrs,lemma.Con.lemma_name)))::row
101 if is_first || (not b) then
103 else (B.b_object (P.Mi([],"?")))::row
106 (B.b_object (P.Mi([],"?")))::row
108 if is_first then res else B.skip::res
112 make_arg_for_apply true hd
113 (List.fold_right (make_arg_for_apply false) tl [])
116 let get_name = function
120 let add_xref id = function
121 | B.Text (attrs, t) -> B.Text (((Some "helm", "xref", id) :: attrs), t)
122 | _ -> assert false (* TODO, add_xref is meaningful for all boxes *)
124 let rec justification term2pres p =
125 if ((p.Con.proof_conclude.Con.conclude_method = "Exact") or
126 ((p.Con.proof_context = []) &
127 (p.Con.proof_apply_context = []) &
128 (p.Con.proof_conclude.Con.conclude_method = "Apply"))) then
130 make_args_for_apply term2pres p.Con.proof_conclude.Con.conclude_args in
132 (B.b_kw "by")::B.b_space::
133 B.Text([],"(")::pres_args@[B.Text([],")")]), None
136 Some (B.b_toggle [B.b_kw "proof";proof2pres true term2pres p])*)
137 proof2pres true term2pres p, None
139 and proof2pres ?skip_initial_lambdas is_top_down term2pres p =
140 let rec proof2pres ?skip_initial_lambdas_internal is_top_down p omit_dot =
145 | `Hypothesis _ -> true
147 ((List.filter is_decl p.Con.proof_context) != []) in
148 let omit_conclusion = (not indent) && (p.Con.proof_context != []) in
150 (match p.Con.proof_conclude.Con.conclude_conclusion with
152 | Some t -> Some (term2pres t)) in
156 ?skip_initial_lambdas_internal:
157 (match skip_initial_lambdas_internal with
158 Some (`Later s) -> Some (`Now s)
161 p.Con.proof_name p.Con.proof_conclude indent omit_conclusion
165 (p.Con.proof_conclude.Con.conclude_method = "BU_Conversion")
166 p.Con.proof_apply_context
168 (p.Con.proof_conclude.Con.conclude_method = "BU_Conversion")
171 (match skip_initial_lambdas_internal with
172 Some (`Now n) -> snd (HExtlib.split_nth n p.Con.proof_context)
173 | _ -> p.Con.proof_context)
176 match p.Con.proof_name with
184 make_concl ~attrs:[ Some "helm", "xref", p.Con.proof_id ]
186 B.b_toggle [ B.H ([], [concl; B.skip ; B.Text([],"(");
187 B.Object ([], P.Mi ([],name));
188 B.Text([],")") ]) ; body ]
192 and context2pres c continuation =
193 (* we generate a subtable for each context element, for selection
195 The table generated by the head-element does not have an xref;
196 the whole context-proof is already selectable *)
202 (fun ce continuation ->
203 let xref = get_xref ce in
204 B.V([Some "helm", "xref", xref ],
205 [B.H([Some "helm", "xref", "ce_"^xref],
206 [ce2pres_in_proof_context_element ce]);
207 continuation])) tl continuation in
208 let hd_xref= get_xref hd in
210 [B.H([Some "helm", "xref", "ce_"^hd_xref],
211 [ce2pres_in_proof_context_element hd]);
214 and ce2pres_in_joint_context_element = function
215 | `Inductive _ -> assert false (* TODO *)
216 | (`Declaration _) as x -> ce2pres x
217 | (`Hypothesis _) as x -> ce2pres x
218 | (`Proof _) as x -> ce2pres x
219 | (`Definition _) as x -> ce2pres x
221 and ce2pres_in_proof_context_element = function
223 B.H ([],(List.map ce2pres_in_joint_context_element ho.Content.joint_defs))
224 | (`Declaration _) as x -> ce2pres x
225 | (`Hypothesis _) as x -> ce2pres x
226 | (`Proof _) as x -> ce2pres x
227 | (`Definition _) as x -> ce2pres x
232 let ty = term2pres d.Con.dec_type in
236 B.Object ([], P.Mi([],get_name d.Con.dec_name));
241 let ty = term2pres h.Con.dec_type in
248 B.Object ([], P.Mi ([],get_name h.Con.dec_name));
252 proof2pres false p false
254 let term = term2pres d.Con.def_term in
256 [ B.b_kw "let"; B.b_space;
257 B.Object ([], P.Mi([],get_name d.Con.def_name));
258 B.Text([],Utf8Macro.unicode_of_tex "\\def");
261 and acontext2pres is_top_down ac continuation indent in_bu_conversion =
266 let continuation = aux tl in
267 (* Applicative context get flattened and the "body" of a BU_Conversion
268 is put in the applicative context. Thus two different situations
270 {method = "BU_Conversion"; applicative_context=[p1; ...; pn]}
271 {method = xxx; applicative_context =
272 [ p1; ...; pn; {method="BU_Conversion"} ; p_{n+1}; ... ; pm ]}
273 In both situations only pn must be processed in in_bu_conversion
276 let in_bu_conversion =
278 [] -> in_bu_conversion
279 | p::_ -> p.Con.proof_conclude.Con.conclude_method = "BU_Conversion"
283 B.indent (proof2pres is_top_down p in_bu_conversion)
285 proof2pres is_top_down p in_bu_conversion
287 B.V([Some "helm","xref",p.Con.proof_id],
288 [B.H([Some "helm","xref","ace_"^p.Con.proof_id],[hd]);
292 and conclude2pres ?skip_initial_lambdas_internal is_top_down name conclude indent omit_conclusion omit_dot =
294 match conclude.Con.conclude_conclusion with
295 Some t (*when not omit_conclusion or
296 (* CSC: I ignore the omit_conclusion flag in this case. *)
297 (* CSC: Is this the correct behaviour? In the stylesheets *)
298 (* CSC: we simply generated nothing (i.e. the output type *)
299 (* CSC: of the function should become an option. *)
300 conclude.Con.conclude_method = "BU_Conversion" *) ->
301 let concl = term2pres t in
302 if conclude.Con.conclude_method = "BU_Conversion" then
304 (make_concl "that is equivalent to" concl ::
305 if is_top_down then [B.b_space ; B.b_kw "done";
306 B.Text([],".")] else [B.Text([],".")])
307 else if conclude.Con.conclude_method = "FalseInd" then
308 (* false ind is in charge to add the conclusion *)
314 conclude.Con.conclude_method = "Intros+LetTac"
316 let name = get_name name in
320 (match conclude.Con.conclude_conclusion with
321 None -> B.Text([],"NO EXPECTED!!!")
322 | Some c -> term2pres c)
324 [make_concl "we need to prove" expected;
327 B.Object ([], P.Mi ([],name));
334 conclude_aux ?skip_initial_lambdas_internal is_top_down conclude in
336 if conclude.Con.conclude_method = "Intros+LetTac"
337 || conclude.Con.conclude_method = "ByInduction"
338 || conclude.Con.conclude_method = "TD_Conversion"
341 else if omit_conclusion then
342 B.H([], [B.b_kw "done" ; B.Text([],".") ])
345 ((if not is_top_down || omit_dot then
346 (make_concl "we proved" concl) ::
347 if not is_top_down then
348 [B.b_space; B.Text([],"(previous)")]
351 ) @ if not omit_dot then [B.Text([],".")] else [])
353 B.V ([], prequel @ [conclude_body; ann_concl])
354 | _ -> conclude_aux ?skip_initial_lambdas_internal is_top_down conclude
357 B.indent (B.H ([Some "helm", "xref", conclude.Con.conclude_id],
360 B.H ([Some "helm", "xref", conclude.Con.conclude_id],[tconclude_body])
362 and conclude_aux ?skip_initial_lambdas_internal is_top_down conclude =
363 if conclude.Con.conclude_method = "TD_Conversion" then
365 (match conclude.Con.conclude_conclusion with
366 None -> B.Text([],"NO EXPECTED!!!")
367 | Some c -> term2pres c) in
369 (match conclude.Con.conclude_args with
370 [Con.ArgProof p] -> p
371 | _ -> assert false) in
373 (match subproof.Con.proof_conclude.Con.conclude_conclusion with
374 None -> B.Text([],"NO SYNTH!!!")
375 | Some c -> (term2pres c)) in
378 [make_concl "we need to prove" expected;
379 B.H ([],[make_concl "or equivalently" synth; B.Text([],".")]);
380 proof2pres true subproof false])
381 else if conclude.Con.conclude_method = "BU_Conversion" then
383 else if conclude.Con.conclude_method = "Exact" then
385 (match conclude.Con.conclude_args with
386 [Con.Term (b,t)] -> assert (not b);term2pres t
388 (match p.Con.premise_binder with
389 | None -> assert false; (* unnamed hypothesis ??? *)
390 | Some s -> B.Text([],s))
391 | err -> assert false) in
392 (match conclude.Con.conclude_conclusion with
394 B.b_h [] [B.b_kw "by"; B.b_space; arg]
396 B.b_h [] [B.b_kw "by"; B.b_space; arg]
398 else if conclude.Con.conclude_method = "Intros+LetTac" then
399 (match conclude.Con.conclude_args with
401 (match conclude.Con.conclude_args with
403 proof2pres ?skip_initial_lambdas_internal true p false
408 (match conclude.Con.conclude_conclusion with
409 None -> B.Text([],"NO Conclusion!!!")
410 | Some c -> term2pres c) in
411 (match conclude.Con.conclude_args with
414 ([None,"align","baseline 1"; None,"equalrows","false";
415 None,"columnalign","left"],
416 [B.H([],[B.Object([],proof2pres p false)]);
418 (make_concl "we proved 1" conclusion))])]);
421 else if (conclude.Con.conclude_method = "Case") then
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 = "RewriteLR"
432 || conclude.Con.conclude_method = "RewriteRL" then
433 let justif1,justif2 =
434 (match (List.nth conclude.Con.conclude_args 6) with
435 Con.ArgProof p -> justification term2pres p
436 | _ -> assert false) in
438 (match List.nth conclude.Con.conclude_args 2 with
439 Con.Term (_,t) -> term2pres t
440 | _ -> assert false) in
442 (match List.nth conclude.Con.conclude_args 5 with
443 Con.Term (_,t) -> term2pres t
444 | _ -> assert false) in
450 B.b_space; (B.b_kw "with");
452 B.b_space; justif1])::
453 match justif2 with None -> [] | Some j -> [B.indent j])
455 if (conclude.Con.conclude_method = "RewriteLR" && is_top_down)
456 || (conclude.Con.conclude_method = "RewriteRL" && not is_top_down) then
457 B.V([], [justif1 ; B.H([],[B.b_kw "we proved (" ; term1 ; B.b_kw "=" ; term2; B.b_kw ") (equality)."]); B.b_kw "by _"])
459 B.V([], [justif1 ; B.H([],[B.b_kw "we proved (" ; term2 ; B.b_kw "=" ; term1; B.b_kw ") (equality)."]); B.b_kw "by _"])
461 B.V([], [B.H([],[B.b_kw "obtain fooo " ; term2 ; B.b_kw "=" ; term1; B.b_kw "by" ; B.b_kw "proof" ; B.Text([],"."); justif1])]) *)
462 else if conclude.Con.conclude_method = "Eq_chain" then
463 let justification p =
465 if skip_initial_lambdas <> None (* cheating *) then
469 let j1,j2 = justification term2pres p in
470 j1 :: B.b_space :: (match j2 with Some j -> [j] | None -> [])
475 | (Con.ArgProof p)::(Con.Term (_,t))::tl ->
476 B.HOV(RenderingAttrs.indent_attributes `BoxML,([B.b_kw
477 "=";B.b_space;term2pres t;B.b_space]@justification p@
478 (if tl <> [] then [B.Text ([],".")] else [])))::(aux tl)
482 match List.hd conclude.Con.conclude_args with
483 | Con.Term (_,t) -> t
486 B.HOV([],[B.b_kw "conclude";B.b_space;term2pres hd; (* B.b_space; *)
487 B.V ([],aux (List.tl conclude.Con.conclude_args))])
488 else if conclude.Con.conclude_method = "Apply" then
490 make_args_for_apply term2pres conclude.Con.conclude_args in
494 B.Text([],"(")::pres_args@[B.Text([],")")])
497 B.b_kw ("Apply method" ^ conclude.Con.conclude_method ^ " to");
498 (B.indent (B.V ([], args2pres conclude.Con.conclude_args)))])
500 and args2pres l = List.map arg2pres l
504 Con.Aux n -> B.b_kw ("aux " ^ n)
505 | Con.Premise prem -> B.b_kw "premise"
506 | Con.Lemma lemma -> B.b_kw "lemma"
507 | Con.Term (_,t) -> term2pres t
508 | Con.ArgProof p -> proof2pres true p false
509 | Con.ArgMethod s -> B.b_kw "method"
512 let proof_conclusion =
513 (match conclude.Con.conclude_conclusion with
514 None -> B.b_kw "No conclusion???"
515 | Some t -> term2pres t) in
516 let arg,args_for_cases =
517 (match conclude.Con.conclude_args with
518 Con.Aux(_)::Con.Aux(_)::Con.Term(_)::arg::tl ->
520 | _ -> assert false) in
524 Con.Aux n -> B.b_kw "an aux???"
525 | Con.Premise prem ->
526 (match prem.Con.premise_binder with
527 None -> B.b_kw "the previous result"
528 | Some n -> B.Object ([], P.Mi([],n)))
529 | Con.Lemma lemma -> B.Object ([], P.Mi([],lemma.Con.lemma_name))
532 | Con.ArgProof p -> B.b_kw "a proof???"
533 | Con.ArgMethod s -> B.b_kw "a method???")
535 (make_concl "we proceed by cases on" case_arg) in
537 (make_concl "to prove" proof_conclusion) in
538 B.V ([], case_on::to_prove::(make_cases args_for_cases))
540 and byinduction conclude =
541 let proof_conclusion =
542 (match conclude.Con.conclude_conclusion with
543 None -> B.b_kw "No conclusion???"
544 | Some t -> term2pres t) in
545 let inductive_arg,args_for_cases =
546 (match conclude.Con.conclude_args with
548 let l1,l2 = split (int_of_string n) tl in
549 let last_pos = (List.length l2)-1 in
550 List.nth l2 last_pos,l1
551 | _ -> assert false) in
554 (match inductive_arg with
555 Con.Aux n -> B.b_kw "an aux???"
556 | Con.Premise prem ->
557 (match prem.Con.premise_binder with
558 None -> B.b_kw "the previous result"
559 | Some n -> B.Object ([], P.Mi([],n)))
560 | Con.Lemma lemma -> B.Object ([], P.Mi([],lemma.Con.lemma_name))
563 | Con.ArgProof p -> B.b_kw "a proof???"
564 | Con.ArgMethod s -> B.b_kw "a method???") in
565 (make_concl "we proceed by induction on" arg) in
567 B.H ([], [make_concl "to prove" proof_conclusion ; B.Text([],".")]) in
568 B.V ([], induction_on::to_prove::(make_cases args_for_cases))
570 and make_cases l = List.map make_case l
576 (match p.Con.proof_name with
577 None -> B.b_kw "no name for case!!"
578 | Some n -> B.Object ([], P.Mi([],n))) in
582 `Hypothesis h -> h.Con.dec_inductive
583 | _ -> false) p.Con.proof_context in
591 let name = get_name h.Con.dec_name in
594 B.Object ([], P.Mi ([],name));
596 (term2pres h.Con.dec_type);
598 | _ -> assert false (*[B.Text ([],"???")]*)) in
602 (B.b_kw "case"::B.b_space::name::pattern_aux)@
606 (match p.Con.proof_conclude.Con.conclude_conclusion with
607 None -> B.b_kw "No conclusion!!!"
608 | Some t -> term2pres t) in
609 let asubconcl = B.indent (make_concl "the thesis becomes" subconcl) in
610 let induction_hypothesis =
614 let text = B.indent (B.b_kw "by induction hypothesis we know") in
619 (match h.Con.dec_name with
623 [term2pres h.Con.dec_type;
626 B.Object ([], P.Mi ([],name));
629 | _ -> assert false in
630 let hyps = List.map make_hyp indhyps in
633 conclude2pres true p.Con.proof_name p.Con.proof_conclude true true false in
636 match p.Con.proof_apply_context with
637 [] -> p.Con.proof_conclude.Con.conclude_id
638 | {Con.proof_id = id}::_ -> id
640 B.Action([None,"type","toggle"],
641 [ B.indent (add_xref acontext_id (B.b_kw "Proof"));
643 (p.Con.proof_conclude.Con.conclude_method = "BU_Conversion")
644 p.Con.proof_apply_context body true
645 (p.Con.proof_conclude.Con.conclude_method = "BU_Conversion")
647 B.V ([], pattern::induction_hypothesis@[B.H ([],[asubconcl;B.Text([],".")]);presacontext])
650 and falseind conclude =
651 let proof_conclusion =
652 (match conclude.Con.conclude_conclusion with
653 None -> B.b_kw "No conclusion???"
654 | Some t -> term2pres t) in
656 (match conclude.Con.conclude_args with
657 [Con.Aux(n);_;case_arg] -> case_arg
660 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
664 Con.Aux n -> assert false
665 | Con.Premise prem ->
666 (match prem.Con.premise_binder with
667 None -> [B.b_kw "Contradiction, hence"]
669 [ B.Object ([],P.Mi([],n)); B.skip;
670 B.b_kw "is contradictory, hence"])
672 [ B.Object ([], P.Mi([],lemma.Con.lemma_name)); B.skip;
673 B.b_kw "is contradictory, hence" ]
674 | _ -> assert false) in
675 make_row arg proof_conclusion
677 and andind conclude =
679 (match conclude.Con.conclude_args with
680 [Con.Aux(n);_;Con.ArgProof proof;case_arg] -> proof,case_arg
683 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
687 Con.Aux n -> assert false
688 | Con.Premise prem ->
689 (match prem.Con.premise_binder with
691 | Some n -> [(B.b_kw "by"); B.b_space; B.Object([], P.Mi([],n))])
693 [(B.b_kw "by");B.skip;
694 B.Object([], P.Mi([],lemma.Con.lemma_name))]
695 | _ -> assert false) in
696 match proof.Con.proof_context with
697 `Hypothesis hyp1::`Hypothesis hyp2::tl ->
701 B.Object ([], P.Mi([],get_name hyp1.Con.dec_name));
704 term2pres hyp1.Con.dec_type]) in
708 B.Object ([], P.Mi([],get_name hyp2.Con.dec_name));
711 term2pres hyp2.Con.dec_type]) in
713 conclude2pres false proof.Con.proof_name proof.Con.proof_conclude
716 acontext2pres false proof.Con.proof_apply_context body false false
720 [B.H ([],arg@[B.skip; B.b_kw "we have"]);
727 and exists conclude =
729 (match conclude.Con.conclude_args with
730 [Con.Aux(n);_;Con.ArgProof proof;_] -> proof
733 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
735 match proof.Con.proof_context with
736 `Declaration decl::`Hypothesis hyp::tl
737 | `Hypothesis decl::`Hypothesis hyp::tl ->
742 B.Object ([], P.Mi([],get_name decl.Con.dec_name));
743 B.Text([],":"); term2pres decl.Con.dec_type]) in
746 [(B.b_kw "such that");
749 B.Object ([], P.Mi([],get_name hyp.Con.dec_name));
752 term2pres hyp.Con.dec_type]) in
754 conclude2pres false proof.Con.proof_name proof.Con.proof_conclude
757 acontext2pres false proof.Con.proof_apply_context body false false
768 ?skip_initial_lambdas_internal:
769 (match skip_initial_lambdas with
770 None -> Some (`Later 0) (* we already printed theorem: *)
771 | Some n -> Some (`Later n))
778 let conjecture2pres term2pres (id, n, context, ty) =
780 (B.b_hv [Some "helm", "xref", id]
782 B.b_h [] [B.b_text [] "{...}"; B.b_space];
787 [ B.b_object (p_mi [] "_") ;
788 B.b_object (p_mo [] ":?") ;
789 B.b_object (p_mi [] "_")]
790 | Some (`Declaration d)
791 | Some (`Hypothesis d) ->
792 let { Content.dec_name =
793 dec_name ; Content.dec_type = ty } = d
803 | Some (`Definition d) ->
805 { Content.def_name = def_name ;
806 Content.def_term = bo } = d
809 [ B.b_object (p_mi []
813 B.b_text [] (Utf8Macro.unicode_of_tex "\\Assign");
816 let proof_name = p.Content.proof_name in
818 [ B.b_object (p_mi []
819 (match proof_name with
822 B.b_text [] (Utf8Macro.unicode_of_tex "\\Assign");
823 proof2pres true term2pres p])
824 (List.rev context)) ] ::
826 [ B.b_text [] (Utf8Macro.unicode_of_tex "\\vdash");
827 B.b_object (p_mi [] (string_of_int n)) ;
831 let metasenv2pres term2pres = function
834 (* Conjectures are in their own table to make *)
835 (* diffing the DOM trees easier. *)
837 ((B.b_kw ("Conjectures:" ^
838 (let _ = incr counter; in (string_of_int !counter)))) ::
839 (List.map (conjecture2pres term2pres) metasenv'))]
841 let params2pres params =
843 B.b_text [Some "xlink", "href", UriManager.string_of_uri uri]
844 (UriManager.name_of_uri uri)
846 let rec spatiate = function
849 | hd :: tl -> hd :: B.b_text [] ", " :: spatiate tl
854 let params = spatiate (List.map param2pres p) in
856 B.b_h [] (B.b_text [] "[" :: params @ [ B.b_text [] "]" ])]
858 let recursion_kind2pres params kind =
861 | `Recursive _ -> "Recursive definition"
862 | `CoRecursive -> "CoRecursive definition"
863 | `Inductive _ -> "Inductive definition"
864 | `CoInductive _ -> "CoInductive definition"
866 B.b_h [] (B.b_kw kind :: params2pres params)
868 let inductive2pres term2pres ind =
869 let constructor2pres decl =
871 B.b_text [] ("| " ^ get_name decl.Content.dec_name ^ ":");
873 term2pres decl.Content.dec_type
878 B.b_kw (ind.Content.inductive_name ^ " of arity");
880 term2pres ind.Content.inductive_type ]
881 :: List.map constructor2pres ind.Content.inductive_constructors)
883 let joint_def2pres term2pres def =
885 | `Inductive ind -> inductive2pres term2pres ind
886 | _ -> assert false (* ZACK or raise ToDo? *)
889 ?skip_initial_lambdas ?(skip_thm_and_qed=false) term2pres
890 (id,params,metasenv,obj)
893 | `Def (Content.Const, thesis, `Proof p) ->
894 let name = get_name p.Content.proof_name in
895 let proof = proof2pres true term2pres ?skip_initial_lambdas p in
896 if skip_thm_and_qed then
900 [Some "helm","xref","id"]
901 ([ B.b_h [] (B.b_kw ("theorem " ^ name) ::
902 params2pres params @ [B.b_kw ":"]);
903 B.H ([],[B.indent (term2pres thesis) ; B.b_kw "." ])] @
904 metasenv2pres term2pres metasenv @
905 [proof ; B.b_kw "qed."])
906 | `Def (_, ty, `Definition body) ->
907 let name = get_name body.Content.def_name in
909 [Some "helm","xref","id"]
911 (B.b_kw ("definition " ^ name) :: params2pres params @ [B.b_kw ":"]);
912 B.indent (term2pres ty)] @
913 metasenv2pres term2pres metasenv @
915 B.indent (term2pres body.Content.def_term);
917 | `Decl (_, `Declaration decl)
918 | `Decl (_, `Hypothesis decl) ->
919 let name = get_name decl.Content.dec_name in
921 [Some "helm","xref","id"]
922 ([B.b_h [] (B.b_kw ("Axiom " ^ name) :: params2pres params);
924 B.indent (term2pres decl.Content.dec_type)] @
925 metasenv2pres term2pres metasenv)
928 (recursion_kind2pres params joint.Content.joint_kind
929 :: List.map (joint_def2pres term2pres) joint.Content.joint_defs)
933 ?skip_initial_lambdas ?skip_thm_and_qed ~ids_to_inner_sorts
935 content2pres ?skip_initial_lambdas ?skip_thm_and_qed
936 (fun ?(prec=90) annterm ->
937 let ast, ids_to_uris =
938 TermAcicContent.ast_of_acic ids_to_inner_sorts annterm
940 CicNotationPres.box_of_mpres
941 (CicNotationPres.render ids_to_uris ~prec
942 (TermContentPres.pp_ast ast)))