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 tactic_terminator = tactical_terminator
32 let command_terminator = tactical_terminator
33 let tactical_separator = ";"
35 let pp_term_ast term = CicAstPp.pp_term term
36 let pp_term_cic term = CicPp.ppterm term
38 let pp_idents idents = "[" ^ String.concat "; " idents ^ "]"
40 let pp_reduction_kind = function
42 | `Simpl -> "simplify"
44 | `Normalize -> "normalize"
47 let pp_pattern (hyp, goal) =
48 let pp_hyp_pattern l =
50 (List.map (fun (name, p) -> sprintf "%s : %s" name (pp_term_ast p)) l)
52 let pp_goal_pattern p =
55 | Some p -> pp_term_ast p
58 if hyp <> [] then " \vdash " else " "
60 "in " ^ pp_hyp_pattern hyp ^ separator ^ pp_goal_pattern goal
62 let rec pp_tactic = function
63 | Absurd (_, term) -> "absurd" ^ pp_term_ast term
64 | Apply (_, term) -> "apply " ^ pp_term_ast term
66 | Assumption _ -> "assumption"
67 | Change (_, t1, t2, where) ->
68 sprintf "change %s with %s%s" (pp_term_ast t1) (pp_term_ast t2)
70 | Compare (_,term) -> "compare " ^ pp_term_ast term
71 | Constructor (_,n) -> "constructor " ^ string_of_int n
72 | Contradiction _ -> "contradiction"
73 | Cut (_, ident, term) ->
74 "cut " ^ pp_term_ast term ^
75 (match ident with None -> "" | Some id -> " as " ^ id)
76 | DecideEquality _ -> "decide equality"
77 | Decompose (_, term) ->
78 sprintf "decompose %s" (pp_term_ast term)
79 | Discriminate (_, term) -> "discriminate " ^ pp_term_ast term
80 | Elim (_, term, using) ->
81 sprintf "elim " ^ pp_term_ast term ^
82 (match using with None -> "" | Some term -> " using " ^ pp_term_ast term)
83 | ElimType (_, term) -> "elim type " ^ pp_term_ast term
84 | Exact (_, term) -> "exact " ^ pp_term_ast term
85 | Exists _ -> "exists"
86 | Fold (_, kind, term) ->
87 sprintf "fold %s %s" (pp_reduction_kind kind) (pp_term_ast term)
88 | Generalize (_, term, ident, pattern) ->
89 sprintf "generalize %s%s %s" (pp_term_ast term)
90 (match ident with None -> "" | Some id -> " as " ^ id)
92 | Goal (_, n) -> "goal " ^ string_of_int n
93 | Fourier _ -> "fourier"
94 | Injection (_, term) -> "injection " ^ pp_term_ast term
95 | Intros (_, None, []) -> "intro"
96 | Intros (_, num, idents) ->
98 (match num with None -> "" | Some num -> " " ^ string_of_int num)
99 (match idents with [] -> "" | idents -> " " ^ pp_idents idents)
101 | LetIn (_, term, ident) -> sprintf "let %s in %s" (pp_term_ast term) ident
102 | Reduce (_, kind, pat) ->
103 sprintf "%s %s" (pp_reduction_kind kind) (pp_pattern pat)
104 | Reflexivity _ -> "reflexivity"
105 | Replace (_, t1, t2) ->
106 sprintf "replace %s with %s" (pp_term_ast t1) (pp_term_ast t2)
107 | Rewrite (_, pos, t, pattern) ->
108 sprintf "rewrite %s %s %s"
109 (if pos = `Left then "left" else "right") (pp_term_ast t)
114 | Symmetry _ -> "symmetry"
115 | Transitivity (_, term) -> "transitivity " ^ pp_term_ast term
116 | FwdSimpl (_, term) -> sprintf "fwd %s" (pp_term_ast term)
117 | LApply (_, term_opt, term) ->
118 sprintf "lapply %s%s" (pp_term_ast term)
119 (match term_opt with | None -> "" | Some t -> " to " ^ pp_term_ast t)
121 let pp_flavour = function
122 | `Definition -> "Definition"
126 | `Remark -> "Remark"
127 | `Theorem -> "Theorem"
129 let pp_search_kind = function
130 | `Locate -> "locate"
135 let pp_macro pp_term = function
137 | WInstance (_, term) -> "whelp instance " ^ pp_term term
138 | WHint (_, t) -> "whelp hint " ^ pp_term t
139 | WLocate (_, s) -> "whelp locate " ^ s
140 | WElim (_, t) -> "whelp elim " ^ pp_term t
141 | WMatch (_, term) -> "whelp match " ^ pp_term term
143 (* | Abort _ -> "Abort" *)
144 | Check (_, term) -> sprintf "Check %s" (pp_term term)
146 (* | Redo (_, None) -> "Redo"
147 | Redo (_, Some n) -> sprintf "Redo %d" n *)
148 | Search_pat (_, kind, pat) ->
149 sprintf "search %s \"%s\"" (pp_search_kind kind) pat
150 | Search_term (_, kind, term) ->
151 sprintf "search %s %s" (pp_search_kind kind) (pp_term term)
152 (* | Undo (_, None) -> "Undo"
153 | Undo (_, Some n) -> sprintf "Undo %d" n *)
154 | Print (_, name) -> sprintf "Print \"%s\"" name
157 let pp_macro_ast = pp_macro pp_term_ast
158 let pp_macro_cic = pp_macro pp_term_cic
160 let pp_alias = function
161 | Ident_alias (id, uri) -> sprintf "alias id \"%s\" = \"%s\"" id uri
162 | Symbol_alias (symb, instance, desc) ->
163 sprintf "alias symbol \"%s\" (instance %d) = \"%s\""
165 | Number_alias (instance,desc) ->
166 sprintf "alias num (instance %d) = \"%s\"" instance desc
168 let pp_params = function
174 (fun (name, typ) -> sprintf "(%s:%s)" name (pp_term_ast typ))
177 let pp_fields fields =
178 (if fields <> [] then "\n" else "") ^
180 (List.map (fun (name,ty) -> " " ^ name ^ ": " ^ pp_term_ast ty) fields)
182 let pp_obj = function
183 | Inductive (params, types) ->
184 let pp_constructors constructors =
186 (List.map (fun (name, typ) -> sprintf "| %s: %s" name (pp_term_ast typ))
189 let pp_type (name, _, typ, constructors) =
190 sprintf "\nwith %s: %s \\def\n%s" name (pp_term_ast typ)
191 (pp_constructors constructors)
195 | (name, inductive, typ, constructors) :: tl ->
197 sprintf "%sinductive %s%s: %s \\def\n%s"
198 (if inductive then "" else "co") name (pp_params params)
199 (pp_term_ast typ) (pp_constructors constructors)
201 fst_typ_pp ^ String.concat "" (List.map pp_type tl))
202 | Theorem (flavour, name, typ, body) ->
203 sprintf "%s %s: %s %s"
209 | Some body -> "\\def " ^ pp_term_ast body)
210 | Record (params,name,ty,fields) ->
211 "record " ^ name ^ " " ^ pp_params params ^ " \\def {" ^
212 pp_fields fields ^ "}"
215 let pp_command = function
217 | Set (_, name, value) -> sprintf "Set \"%s\" \"%s\"" name value
218 | Coercion (_,_) -> "Coercion IMPLEMENT ME!!!!!"
219 | Alias (_,s) -> pp_alias s
220 | Obj (_,obj) -> pp_obj obj
222 let rec pp_tactical = function
223 | Tactic (_, tac) -> pp_tactic tac
226 | Do (_, count, tac) -> sprintf "do %d %s" count (pp_tactical tac)
228 | Repeat (_, tac) -> "repeat " ^ pp_tactical tac
229 | Seq (_, tacs) -> pp_tacticals tacs
230 | Then (_, tac, tacs) ->
231 sprintf "%s [%s]" (pp_tactical tac) (pp_tacticals tacs)
232 | Tries (_, tacs) -> sprintf "tries [%s]" (pp_tacticals tacs)
233 | Try (_, tac) -> "try " ^ pp_tactical tac
235 and pp_tacticals tacs =
236 String.concat (tactical_separator ^ " ") (List.map pp_tactical tacs)
238 let pp_tactical tac = pp_tactical tac ^ tactical_terminator
239 let pp_tactic tac = pp_tactic tac ^ tactic_terminator
240 let pp_command tac = pp_command tac ^ command_terminator
242 let pp_executable = function
243 | Macro (_,x) -> pp_macro_ast x
244 | Tactical (_,x) -> pp_tactical x
245 | Command (_,x) -> pp_command x
247 let pp_comment = function
248 | Note (_,str) -> sprintf "(* %s *)" str
249 | Code (_,code) -> sprintf "(** %s. **)" (pp_executable code)
251 let pp_statement = function
252 | Executable (_, ex) -> pp_executable ex
253 | Comment (_, c) -> pp_comment c