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 module Ast = CicNotationPt
32 let tactical_terminator = "."
33 let tactic_terminator = tactical_terminator
34 let command_terminator = tactical_terminator
36 let pp_term_ast term = CicNotationPp.pp_term term
37 let pp_term_cic term = CicPp.ppterm term
39 let pp_idents idents = "[" ^ String.concat "; " idents ^ "]"
41 let pp_terms_ast terms = String.concat ", " (List.map pp_term_ast terms)
43 let pp_reduction_kind = function
44 | `Normalize -> "normalize"
46 | `Simpl -> "simplify"
47 | `Unfold (Some t) -> "unfold " ^ pp_term_ast t
48 | `Unfold None -> "unfold"
52 let pp_pattern (t, hyp, goal) =
53 let pp_hyp_pattern l =
55 (List.map (fun (name, p) -> sprintf "%s : %s" name (pp_term_ast p)) l) in
59 | Some t -> pp_term_ast t
61 pp_t t ^ " in " ^ pp_hyp_pattern hyp ^ " \\vdash " ^ pp_term_ast goal
63 let pp_intros_specs = function
65 | Some num, [] -> Printf.sprintf " names %i" num
66 | None, idents -> Printf.sprintf " names %s" (pp_idents idents)
67 | Some num, idents -> Printf.sprintf " names %i %s" num (pp_idents idents)
69 let rec pp_tactic = function
70 | Absurd (_, term) -> "absurd" ^ pp_term_ast term
71 | Apply (_, term) -> "apply " ^ pp_term_ast term
73 | Assumption _ -> "assumption"
74 | Change (_, where, with_what) ->
75 sprintf "change %s with %s" (pp_pattern where) (pp_term_ast with_what)
76 | Clear (_,id) -> sprintf "clear %s" id
77 | ClearBody (_,id) -> sprintf "clearbody %s" id
78 | Compare (_,term) -> "compare " ^ pp_term_ast term
79 | Constructor (_,n) -> "constructor " ^ string_of_int n
80 | Contradiction _ -> "contradiction"
81 | Cut (_, ident, term) ->
82 "cut " ^ pp_term_ast term ^
83 (match ident with None -> "" | Some id -> " as " ^ id)
84 | DecideEquality _ -> "decide equality"
85 | Decompose (_, [], what, names) ->
86 sprintf "decompose %s%s" what (pp_intros_specs (None, names))
87 | Decompose (_, types, what, names) ->
88 let to_ident = function
90 | Type _ -> assert false
92 let types = List.rev_map to_ident types in
93 sprintf "decompose %s %s%s" (pp_idents types) what (pp_intros_specs (None, names))
94 | Discriminate (_, term) -> "discriminate " ^ pp_term_ast term
95 | Elim (_, term, using, num, idents) ->
96 sprintf "elim " ^ pp_term_ast term ^
97 (match using with None -> "" | Some term -> " using " ^ pp_term_ast term)
98 ^ pp_intros_specs (num, idents)
99 | ElimType (_, term, using, num, idents) ->
100 sprintf "elim type " ^ pp_term_ast term ^
101 (match using with None -> "" | Some term -> " using " ^ pp_term_ast term)
102 ^ pp_intros_specs (num, idents)
103 | Exact (_, term) -> "exact " ^ pp_term_ast term
104 | Exists _ -> "exists"
105 | Fold (_, kind, term, pattern) ->
106 sprintf "fold %s %s %s" (pp_reduction_kind kind)
107 (pp_term_ast term) (pp_pattern pattern)
108 | FwdSimpl (_, hyp, idents) ->
109 sprintf "fwd %s%s" hyp
110 (match idents with [] -> "" | idents -> " " ^ pp_idents idents)
111 | Generalize (_, pattern, ident) ->
112 sprintf "generalize %s%s" (pp_pattern pattern)
113 (match ident with None -> "" | Some id -> " as " ^ id)
114 | Goal (_, n) -> "goal " ^ string_of_int n
116 | Fourier _ -> "fourier"
118 | Injection (_, term) -> "injection " ^ pp_term_ast term
119 | Intros (_, None, []) -> "intro"
120 | Intros (_, num, idents) ->
122 (match num with None -> "" | Some num -> " " ^ string_of_int num)
123 (match idents with [] -> "" | idents -> " " ^ pp_idents idents)
124 | LApply (_, level_opt, terms, term, ident_opt) ->
125 sprintf "lapply %s%s%s%s"
126 (match level_opt with None -> "" | Some i -> " depth = " ^ string_of_int i ^ " ")
128 (match terms with [] -> "" | _ -> " to " ^ pp_terms_ast terms)
129 (match ident_opt with None -> "" | Some ident -> " using " ^ ident)
131 | LetIn (_, term, ident) -> sprintf "let %s in %s" (pp_term_ast term) ident
132 | Reduce (_, kind, pat) ->
133 sprintf "%s %s" (pp_reduction_kind kind) (pp_pattern pat)
134 | Reflexivity _ -> "reflexivity"
135 | Replace (_, pattern, t) ->
136 sprintf "replace %s with %s" (pp_pattern pattern) (pp_term_ast t)
137 | Rewrite (_, pos, t, pattern) ->
138 sprintf "rewrite %s %s %s"
139 (if pos = `LeftToRight then ">" else "<")
145 | Symmetry _ -> "symmetry"
146 | Transitivity (_, term) -> "transitivity " ^ pp_term_ast term
148 let pp_flavour = function
149 | `Definition -> "Definition"
153 | `Remark -> "Remark"
154 | `Theorem -> "Theorem"
155 | `Variant -> "Variant"
157 let pp_search_kind = function
158 | `Locate -> "locate"
162 | `Instance -> "instance"
164 let pp_macro pp_term = function
166 | WInstance (_, term) -> "whelp instance " ^ pp_term term
167 | WHint (_, t) -> "whelp hint " ^ pp_term t
168 | WLocate (_, s) -> "whelp locate " ^ s
169 | WElim (_, t) -> "whelp elim " ^ pp_term t
170 | WMatch (_, term) -> "whelp match " ^ pp_term term
172 (* | Abort _ -> "Abort" *)
173 | Check (_, term) -> sprintf "Check %s" (pp_term term)
175 (* | Redo (_, None) -> "Redo"
176 | Redo (_, Some n) -> sprintf "Redo %d" n *)
177 | Search_pat (_, kind, pat) ->
178 sprintf "search %s \"%s\"" (pp_search_kind kind) pat
179 | Search_term (_, kind, term) ->
180 sprintf "search %s %s" (pp_search_kind kind) (pp_term term)
181 (* | Undo (_, None) -> "Undo"
182 | Undo (_, Some n) -> sprintf "Undo %d" n *)
183 | Print (_, name) -> sprintf "Print \"%s\"" name
186 let pp_macro_ast = pp_macro pp_term_ast
187 let pp_macro_cic = pp_macro pp_term_cic
189 let pp_alias = function
190 | Ident_alias (id, uri) -> sprintf "alias id \"%s\" = \"%s\"" id uri
191 | Symbol_alias (symb, instance, desc) ->
192 sprintf "alias symbol \"%s\" (instance %d) = \"%s\""
194 | Number_alias (instance,desc) ->
195 sprintf "alias num (instance %d) = \"%s\"" instance desc
197 let pp_params = function
203 (fun (name, typ) -> sprintf "(%s:%s)" name (pp_term_ast typ))
206 let pp_fields fields =
207 (if fields <> [] then "\n" else "") ^
209 (List.map (fun (name,ty) -> " " ^ name ^ ": " ^ pp_term_ast ty) fields)
211 let pp_obj = function
212 | Inductive (params, types) ->
213 let pp_constructors constructors =
215 (List.map (fun (name, typ) -> sprintf "| %s: %s" name (pp_term_ast typ))
218 let pp_type (name, _, typ, constructors) =
219 sprintf "\nwith %s: %s \\def\n%s" name (pp_term_ast typ)
220 (pp_constructors constructors)
224 | (name, inductive, typ, constructors) :: tl ->
226 sprintf "%sinductive %s%s: %s \\def\n%s"
227 (if inductive then "" else "co") name (pp_params params)
228 (pp_term_ast typ) (pp_constructors constructors)
230 fst_typ_pp ^ String.concat "" (List.map pp_type tl))
231 | Theorem (flavour, name, typ, body) ->
232 sprintf "%s %s: %s %s"
238 | Some body -> "\\def " ^ pp_term_ast body)
239 | Record (params,name,ty,fields) ->
240 "record " ^ name ^ " " ^ pp_params params ^ " \\def {" ^
241 pp_fields fields ^ "}"
243 let pp_argument_pattern = function
244 | Ast.IdentArg (eta_depth, name) ->
245 let eta_buf = Buffer.create 5 in
246 for i = 1 to eta_depth do
247 Buffer.add_string eta_buf "\\eta."
249 sprintf "%s%s" (Buffer.contents eta_buf) name
251 let rec pp_cic_appl_pattern = function
252 | Ast.UriPattern uri -> UriManager.string_of_uri uri
253 | Ast.VarPattern name -> name
254 | Ast.ImplicitPattern -> "_"
255 | Ast.ApplPattern aps ->
256 sprintf "(%s)" (String.concat " " (List.map pp_cic_appl_pattern aps))
258 let pp_l1_pattern = CicNotationPp.pp_term
259 let pp_l2_pattern = CicNotationPp.pp_term
261 let pp_associativity = function
262 | Gramext.LeftA -> "left associative"
263 | Gramext.RightA -> "right associative"
264 | Gramext.NonA -> "non associative"
266 let pp_precedence i = sprintf "with precedence %d" i
268 let pp_dir_opt = function
270 | Some `LeftToRight -> "> "
271 | Some `RightToLeft -> "< "
273 let pp_command = function
274 | Include (_,path) -> "include " ^ path
277 | Set (_, name, value) -> sprintf "set \"%s\" \"%s\"" name value
278 | Coercion (_,term) -> sprintf "coercion %s" (pp_term_ast term)
279 | Alias (_,s) -> pp_alias s
280 | Obj (_,obj) -> pp_obj obj
281 | Default (_,what,uris) ->
282 sprintf "default \"%s\" %s" what
283 (String.concat " " (List.map UriManager.string_of_uri uris))
284 | Interpretation (_, dsc, (symbol, arg_patterns), cic_appl_pattern) ->
285 sprintf "interpretation \"%s\" '%s %s = %s"
287 (String.concat " " (List.map pp_argument_pattern arg_patterns))
288 (pp_cic_appl_pattern cic_appl_pattern)
289 | Notation (_, dir_opt, l1_pattern, assoc, prec, l2_pattern) ->
290 sprintf "notation %s\"%s\" %s %s for %s"
292 (pp_l1_pattern l1_pattern)
293 (pp_associativity assoc)
295 (pp_l2_pattern l2_pattern)
297 | Dump _ -> assert false (* ZACK: debugging *)
299 let rec pp_tactical = function
300 | Tactic (_, tac) -> pp_tactic tac
301 | Do (_, count, tac) -> sprintf "do %d %s" count (pp_tactical tac)
302 | Repeat (_, tac) -> "repeat " ^ pp_tactical tac
303 | Seq (_, tacs) -> pp_tacticals ~sep:"; " tacs
304 | Then (_, tac, tacs) ->
305 sprintf "%s; [%s]" (pp_tactical tac) (pp_tacticals ~sep:" | " tacs)
306 | First (_, tacs) -> sprintf "tries [%s]" (pp_tacticals ~sep:" | " tacs)
307 | Try (_, tac) -> "try " ^ pp_tactical tac
308 | Solve (_, tac) -> sprintf "solve [%s]" (pp_tacticals ~sep:" | " tac)
310 and pp_tacticals ~sep tacs =
311 String.concat sep (List.map pp_tactical tacs)
313 let pp_tactical tac = pp_tactical tac ^ tactical_terminator
314 let pp_tactic tac = pp_tactic tac ^ tactic_terminator
315 let pp_command tac = pp_command tac ^ command_terminator
317 let pp_executable = function
318 | Macro (_,x) -> pp_macro_ast x
319 | Tactical (_,x) -> pp_tactical x
320 | Command (_,x) -> pp_command x
322 let pp_comment = function
323 | Note (_,str) -> sprintf "(* %s *)" str
324 | Code (_,code) -> sprintf "(** %s. **)" (pp_executable code)
326 let pp_statement = function
327 | Executable (_, ex) -> pp_executable ex
328 | Comment (_, c) -> pp_comment c
330 let pp_cic_command = function
331 | Include (_,path) -> "include " ^ path
334 | Coercion (_,term) -> sprintf "coercion %s" (CicPp.ppterm term)
342 | Obj _ -> assert false (* not implemented *)