1 (* Copyright (C) 2004, 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://helm.cs.unibo.it/
30 let tactical_terminator = "."
31 let tactical_separator = ";"
33 let pp_term term = CicAstPp.pp_term term
35 let pp_idents idents = "[" ^ String.concat "; " idents ^ "]"
37 let pp_reduction_kind = function
39 | `Simpl -> "simplify"
42 let rec pp_tactic = function
43 | LocatedTactic (loc, tac) -> pp_tactic tac
44 | Absurd term -> "absurd" ^ pp_term term
45 | Apply term -> "apply " ^ pp_term term
47 | Assumption -> "assumption"
48 | Change (t1, t2, where) ->
49 sprintf "change %s with %s%s" (pp_term t1) (pp_term t2)
50 (match where with None -> "" | Some ident -> "in " ^ ident)
51 | Change_pattern (_, _, _) -> assert false (* TODO *)
52 | Contradiction -> "contradiction"
53 | Cut term -> "cut " ^ pp_term term
54 | Decompose (ident, principles) ->
55 sprintf "decompose %s %s" (pp_idents principles) ident
56 | Discriminate ident -> "discriminate " ^ ident
57 | Elim (term, using) ->
58 sprintf "elim " ^ pp_term term ^
59 (match using with None -> "" | Some term -> " using " ^ pp_term term)
60 | ElimType term -> "elim type " ^ pp_term term
61 | Exact term -> "exact " ^ pp_term term
63 | Fold (kind, term) ->
64 sprintf "fold %s %s" (pp_reduction_kind kind) (pp_term term)
65 | Fourier -> "fourier"
67 | Injection ident -> "injection " ^ ident
68 | Intros (None, []) -> "intro"
69 | Intros (num, idents) ->
71 (match num with None -> "" | Some num -> " " ^ string_of_int num)
72 (match idents with [] -> "" | idents -> " " ^ pp_idents idents)
74 | LetIn (term, ident) -> sprintf "let %s in %s" (pp_term term) ident
76 | Reduce (kind, Some ([], `Goal)) -> pp_reduction_kind kind
77 | Reduce (kind, Some ([], `Everywhere)) ->
78 sprintf "%s in hyp" (pp_reduction_kind kind)
79 | Reduce (kind, Some (terms, `Goal)) ->
80 sprintf "%s %s" (pp_reduction_kind kind)
81 (String.concat ", " (List.map pp_term terms))
82 | Reduce (kind, Some (terms, `Everywhere)) ->
83 sprintf "%s in hyp %s" (pp_reduction_kind kind)
84 (String.concat ", " (List.map pp_term terms))
85 | Reflexivity -> "reflexivity"
86 | Replace (t1, t2) -> sprintf "replace %s with %s" (pp_term t1) (pp_term t2)
87 | Replace_pattern (_, _) -> assert false (* TODO *)
88 | Rewrite (_, _, _) -> assert false (* TODO *)
92 | Symmetry -> "symmetry"
93 | Transitivity term -> "transitivity " ^ pp_term term
95 let pp_flavour = function
96 | `Definition -> "Definition"
100 | `Remark -> "Remark"
101 | `Theorem -> "Theorem"
103 let pp_search_kind = function
104 | `Locate -> "locate"
109 let pp_command = function
111 | Baseuri (Some uri) -> sprintf "Baseuri \"%s\"" uri
112 | Baseuri None -> "Baseuri"
113 | Check term -> sprintf "Check %s" (pp_term term)
116 (match name with None -> "Qed" | Some name -> sprintf "Save %s" name)
118 | Redo None -> "Redo"
119 | Redo (Some n) -> sprintf "Redo %d" n
120 | Search_pat (kind, pat) ->
121 sprintf "search %s \"%s\"" (pp_search_kind kind) pat
122 | Search_term (kind, term) ->
123 sprintf "search %s %s" (pp_search_kind kind) (pp_term term)
124 | Inductive (params, types) ->
125 let pp_params = function
131 (fun (name, typ) -> sprintf "(%s:%s)" name (pp_term typ))
134 let pp_constructors constructors =
136 (List.map (fun (name, typ) -> sprintf "| %s: %s" name (pp_term typ))
139 let pp_type (name, _, typ, constructors) =
140 sprintf "\nwith %s: %s \\def\n%s" name (pp_term typ)
141 (pp_constructors constructors)
145 | (name, inductive, typ, constructors) :: tl ->
147 sprintf "%sinductive %s%s: %s \\def\n%s"
148 (if inductive then "" else "co") name (pp_params params)
149 (pp_term typ) (pp_constructors constructors)
151 fst_typ_pp ^ String.concat "" (List.map pp_type tl))
152 | Theorem (flavour, name, typ, body) ->
153 sprintf "%s %s: %s %s"
155 (match name with None -> "" | Some name -> name)
159 | Some body -> "\\def " ^ pp_term body)
160 | Undo None -> "Undo"
161 | Undo (Some n) -> sprintf "Undo %d" n
163 let rec pp_tactical = function
164 | LocatedTactical (loc, tac) -> pp_tactical tac
166 | Tactic tac -> pp_tactic tac
167 | Command cmd -> pp_command cmd
170 | Do (count, tac) -> sprintf "do %d %s" count (pp_tactical tac)
172 | Repeat tac -> "repeat " ^ pp_tactical tac
173 | Seq tacs -> pp_tacticals tacs
174 | Then (tac, tacs) -> sprintf "%s [%s]" (pp_tactical tac) (pp_tacticals tacs)
175 | Tries tacs -> sprintf "tries [%s]" (pp_tacticals tacs)
176 | Try tac -> "try " ^ pp_tactical tac
178 and pp_tacticals tacs =
179 String.concat (tactical_separator ^ " ") (List.map pp_tactical tacs)
181 let pp_tactical tac = pp_tactical tac ^ tactical_terminator