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/.
29 module N = CicNotationPt
31 (* grafite ast constructors *************************************************)
33 let floc = H.dummy_floc
35 let mk_note str = G.Comment (floc, G.Note (floc, str))
37 let mk_theorem name t =
38 let obj = N.Theorem (`Theorem, name, t, None) in
39 G.Executable (floc, G.Command (floc, G.Obj (floc, obj)))
41 let mk_tactic tactic =
42 let sep = G.Dot floc in
43 G.Executable (floc, G.Tactical (floc, G.Tactic (floc, tactic), Some sep))
45 let mk_intros xi ids =
46 let tactic = G.Intros (floc, xi, ids) in
50 let tactic = G.Exact (floc, t) in
53 (* internal functions *******************************************************)
55 let mk_intros_arg = function
56 | `Declaration {C.dec_name = Some name}
57 | `Hypothesis {C.dec_name = Some name}
58 | `Definition {C.def_name = Some name} -> name
61 let mk_intros_args pc = List.map mk_intros_arg pc
64 let cmethod = p.C.proof_conclude.C.conclude_method in
65 let cargs = p.C.proof_conclude.C.conclude_args in
66 match cmethod, cargs with
67 | "Intros+LetTac", [C.ArgProof q] ->
68 let names = mk_intros_args q.C.proof_context in
69 let num = List.length names in
70 let text = String.concat " " names in
71 mk_intros (Some num) [] :: mk_note text :: mk_proof q
72 | _ -> [mk_note (Printf.sprintf "%s %u" cmethod (List.length cargs))]
74 (* interface functions ******************************************************)
76 let content2procedural ~ids_to_inner_sorts prefix (_, params, xmenv, obj) =
77 if List.length params > 0 || xmenv <> None then assert false;
79 | `Def (C.Const, t, `Proof ({C.proof_name = Some name} as p)) ->
80 mk_theorem name t :: mk_proof p