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
34 let pp_idents idents =
35 let map = function Some s -> s | None -> "_" in
36 "(" ^ String.concat " " (List.map map idents) ^ ")"
37 let pp_hyps idents = String.concat " " idents
39 let pp_reduction_kind ~term_pp = function
40 | `Normalize -> "normalize"
42 | `Simpl -> "simplify"
43 | `Unfold (Some t) -> "unfold " ^ term_pp t
44 | `Unfold None -> "unfold"
47 let pp_tactic_pattern ~map_unicode_to_tex ~term_pp ~lazy_term_pp (what, hyp, goal) =
48 if what = None && hyp = [] && goal = None then "" else
52 | Some t -> Printf.sprintf "in match (%s) " (lazy_term_pp t) in
55 (List.map (fun (name, p) -> Printf.sprintf "%s:(%s)" name (term_pp p)) hyp) in
60 let vdash = if map_unicode_to_tex then "\\vdash" else "⊢" in
61 Printf.sprintf "%s (%s)" vdash (term_pp t)
63 Printf.sprintf "%sin %s%s" what_text hyp_text goal_text
65 let pp_intros_specs s = function
67 | Some num, [] -> Printf.sprintf " %s%i" s num
68 | None, idents -> Printf.sprintf " %s%s" s (pp_idents idents)
69 | Some num, idents -> Printf.sprintf " %s%i %s" s num (pp_idents idents)
71 let pp_terms ~term_pp terms = String.concat ", " (List.map term_pp terms)
73 let opt_string_pp = function
75 | Some what -> what ^ " "
77 let pp_auto_params ~term_pp (univ, params) =
79 (List.map (fun (k,v) -> if v <> "" then k ^ "=" ^ v else k) params) ^
81 (if params <> [] then " " else "") ^ "by " ^
82 String.concat " " (List.map term_pp univ)
86 let rec pp_tactic ~map_unicode_to_tex ~term_pp ~lazy_term_pp =
87 let pp_terms = pp_terms ~term_pp in
88 let pp_tactics = pp_tactics ~map_unicode_to_tex ~term_pp ~lazy_term_pp in
89 let pp_reduction_kind = pp_reduction_kind ~term_pp in
90 let pp_tactic_pattern =
91 pp_tactic_pattern ~map_unicode_to_tex ~lazy_term_pp ~term_pp in
94 (* Higher order tactics *)
95 | Do (_, count, tac) ->
96 Printf.sprintf "do %d %s" count (pp_tactic tac)
97 | Repeat (_, tac) -> "repeat " ^ pp_tactic tac
98 | Seq (_, tacs) -> pp_tactics ~sep:"; " tacs
99 | Then (_, tac, tacs) ->
100 Printf.sprintf "%s; [%s]" (pp_tactic tac)
101 (pp_tactics ~sep:" | " tacs)
103 Printf.sprintf "tries [%s]" (pp_tactics ~sep:" | " tacs)
104 | Try (_, tac) -> "try " ^ pp_tactic tac
106 Printf.sprintf "solve [%s]" (pp_tactics ~sep:" | " tac)
107 | Progress (_, tac) -> "progress " ^ pp_tactic tac
108 (* First order tactics *)
109 | Absurd (_, term) -> "absurd" ^ term_pp term
110 | Apply (_, term) -> "apply " ^ term_pp term
111 | ApplyS (_, term, params) ->
112 "applyS " ^ term_pp term ^ pp_auto_params ~term_pp params
113 | AutoBatch (_,params) -> "autobatch " ^
114 pp_auto_params ~term_pp params
115 | Assumption _ -> "assumption"
116 | Cases (_, term, specs) -> Printf.sprintf "cases " ^ term_pp term ^
117 pp_intros_specs "names " specs
118 | Change (_, where, with_what) ->
119 Printf.sprintf "change %s with %s" (pp_tactic_pattern where) (lazy_term_pp with_what)
120 | Clear (_,ids) -> Printf.sprintf "clear %s" (pp_hyps ids)
121 | ClearBody (_,id) -> Printf.sprintf "clearbody %s" (pp_hyps [id])
122 | Constructor (_,n) -> "constructor " ^ string_of_int n
123 | Compose (_,t1, t2, times, intro_specs) ->
124 Printf.sprintf "compose %s%s %s%s"
125 (if times > 0 then string_of_int times ^ " " else "")
126 (term_pp t1) (match t2 with None -> "" | Some t2 -> "with "^term_pp t2)
127 (pp_intros_specs " as " intro_specs)
128 | Contradiction _ -> "contradiction"
129 | Cut (_, ident, term) ->
130 "cut " ^ term_pp term ^
131 (match ident with None -> "" | Some id -> " as " ^ id)
132 | Decompose (_, names) ->
133 Printf.sprintf "decompose%s"
134 (pp_intros_specs "names " (None, names))
135 | Demodulate (_, params) -> "demodulate " ^ pp_auto_params ~term_pp params
136 | Destruct (_, None) -> "destruct"
137 | Destruct (_, Some terms) -> "destruct " ^ pp_terms terms
138 | Elim (_, what, using, pattern, specs) ->
139 Printf.sprintf "elim %s%s %s%s"
141 (match using with None -> "" | Some term -> " using " ^ term_pp term)
142 (pp_tactic_pattern pattern)
143 (pp_intros_specs "names " specs)
144 | ElimType (_, term, using, specs) ->
145 Printf.sprintf "elim type %s%s%s"
147 (match using with None -> "" | Some term -> " using " ^ term_pp term)
148 (pp_intros_specs "names " specs)
149 | Exact (_, term) -> "exact " ^ term_pp term
150 | Exists _ -> "exists"
151 | Fold (_, kind, term, pattern) ->
152 Printf.sprintf "fold %s %s %s" (pp_reduction_kind kind)
153 (lazy_term_pp term) (pp_tactic_pattern pattern)
154 | FwdSimpl (_, hyp, names) ->
155 Printf.sprintf "fwd %s%s" hyp (pp_intros_specs "names " (None, names))
156 | Generalize (_, pattern, ident) ->
157 Printf.sprintf "generalize %s%s" (pp_tactic_pattern pattern)
158 (match ident with None -> "" | Some id -> " as " ^ id)
160 | Fourier _ -> "fourier"
162 | Intros (_, specs) -> Printf.sprintf "intros%s" (pp_intros_specs "" specs)
163 | Inversion (_, term) -> "inversion " ^ term_pp term
164 | LApply (_, linear, level_opt, terms, term, ident_opt) ->
165 Printf.sprintf "lapply %s%s%s%s%s"
166 (if linear then " linear " else "")
167 (match level_opt with None -> "" | Some i -> " depth = " ^ string_of_int i ^ " ")
169 (match terms with [] -> "" | _ -> " to " ^ pp_terms terms)
170 (match ident_opt with None -> "" | Some ident -> " as " ^ ident)
172 | LetIn (_, term, ident) ->
173 Printf.sprintf "letin %s \\def %s" ident (term_pp term)
174 | Reduce (_, kind, pat) ->
175 Printf.sprintf "%s %s" (pp_reduction_kind kind) (pp_tactic_pattern pat)
176 | Reflexivity _ -> "reflexivity"
177 | Replace (_, pattern, t) ->
178 Printf.sprintf "replace %s with %s" (pp_tactic_pattern pattern) (lazy_term_pp t)
179 | Rewrite (_, pos, t, pattern, names) ->
180 Printf.sprintf "rewrite %s %s %s%s"
181 (if pos = `LeftToRight then ">" else "<")
183 (pp_tactic_pattern pattern)
184 (if names = [] then "" else " as " ^ pp_idents names)
188 | Symmetry _ -> "symmetry"
189 | Transitivity (_, term) -> "transitivity " ^ term_pp term
190 (* Tattiche Aggiunte *)
191 | Assume (_, ident , term) -> "assume" ^ ident ^ ":" ^ term_pp term
192 | Suppose (_, term, ident,term1) -> "suppose" ^ term_pp term ^ "(" ^ ident ^ ")" ^ (match term1 with None -> " " | Some term1 -> term_pp term1)
193 | Bydone (_, term) -> "by" ^ (match term with None -> "_" | Some term -> term_pp term) ^ "done"
194 | By_term_we_proved (_, term, term1, ident, term2) -> "by" ^ (match term with None -> "_" | Some term -> term_pp term) ^ "we proved" ^ term_pp term1 ^ (match ident with None -> "" | Some ident -> "(" ^ident^ ")") ^
195 (match term2 with None -> " " | Some term2 -> term_pp term2)
196 | We_need_to_prove (_, term, ident, term1) -> "we need to prove" ^ term_pp term ^ (match ident with None -> "" | Some ident -> "(" ^ ident ^ ")") ^ (match term1 with None -> " " | Some term1 -> term_pp term1)
197 | We_proceed_by_cases_on (_, term, term1) -> "we proceed by cases on" ^ term_pp term ^ "to prove" ^ term_pp term1
198 | We_proceed_by_induction_on (_, term, term1) -> "we proceed by induction on" ^ term_pp term ^ "to prove" ^ term_pp term1
199 | Byinduction (_, term, ident) -> "by induction hypothesis we know" ^ term_pp term ^ "(" ^ ident ^ ")"
200 | Thesisbecomes (_, term) -> "the thesis becomes " ^ term_pp term
201 | ExistsElim (_, term0, ident, term, ident1, term1) -> "by " ^ (match term0 with None -> "_" | Some term -> term_pp term) ^ "let " ^ ident ^ ":" ^ term_pp term ^ "such that " ^ lazy_term_pp term1 ^ "(" ^ ident1 ^ ")"
202 | AndElim (_, term, ident1, term1, ident2, term2) -> "by " ^ term_pp term ^ "we have " ^ term_pp term1 ^ " (" ^ ident1 ^ ") " ^ "and " ^ term_pp term2 ^ " (" ^ ident2 ^ ")"
203 | RewritingStep (_, term, term1, term2, cont) ->
206 | Some (None,term) -> "conclude " ^ term_pp term
207 | Some (Some name,term) ->
208 "obtain (" ^ name ^ ") " ^ term_pp term)
212 | `Auto params -> pp_auto_params ~term_pp params
213 | `Term term2 -> " exact " ^ term_pp term2
215 | `SolveWith term -> " using " ^ term_pp term)
216 ^ (if cont then " done" else "")
217 | Case (_, id, args) ->
220 (List.map (function (id,term) -> "(" ^ id ^ ": " ^ term_pp term ^ ")")
224 and pp_tactics ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~sep tacs =
226 (List.map (pp_tactic ~map_unicode_to_tex ~lazy_term_pp ~term_pp) tacs)
228 let pp_search_kind = function
229 | `Locate -> "locate"
233 | `Instance -> "instance"
235 let pp_arg ~term_pp arg =
236 let s = term_pp arg in
237 if s = "" || (s.[0] = '(' && s.[String.length s - 1] = ')') then
238 (* _nice_ heuristic *)
243 let pp_macro ~term_pp =
244 let term_pp = pp_arg ~term_pp in
245 let style_pp = function
247 | Procedural None -> "procedural "
248 | Procedural (Some i) -> Printf.sprintf "procedural %u " i
250 let prefix_pp prefix =
251 if prefix = "" then "" else Printf.sprintf " \"%s\"" prefix
255 | WInstance (_, term) -> "whelp instance " ^ term_pp term
256 | WHint (_, t) -> "whelp hint " ^ term_pp t
257 | WLocate (_, s) -> "whelp locate \"" ^ s ^ "\""
258 | WElim (_, t) -> "whelp elim " ^ term_pp t
259 | WMatch (_, term) -> "whelp match " ^ term_pp term
261 | Check (_, term) -> Printf.sprintf "check %s" (term_pp term)
262 | Hint (_, true) -> "hint rewrite"
263 | Hint (_, false) -> "hint"
264 | AutoInteractive (_,params) -> "auto " ^ pp_auto_params ~term_pp params
265 | Inline (_, style, suri, prefix) ->
266 Printf.sprintf "inline %s\"%s\"%s" (style_pp style) suri (prefix_pp prefix)
268 let pp_associativity = function
269 | Gramext.LeftA -> "left associative"
270 | Gramext.RightA -> "right associative"
271 | Gramext.NonA -> "non associative"
273 let pp_precedence i = Printf.sprintf "with precedence %d" i
275 let pp_dir_opt = function
277 | Some `LeftToRight -> "> "
278 | Some `RightToLeft -> "< "
280 let pp_default what uris =
281 Printf.sprintf "default \"%s\" %s" what
282 (String.concat " " (List.map UriManager.string_of_uri uris))
284 let pp_coercion uri do_composites arity saturations=
285 Printf.sprintf "coercion %s %d %d %s"
286 (UriManager.string_of_uri uri) arity saturations
287 (if do_composites then "" else "nocomposites")
289 let pp_command ~term_pp ~obj_pp = function
290 | Index (_,_,uri) -> "Indexing " ^ UriManager.string_of_uri uri
291 | Coercion (_, uri, do_composites, i, j) ->
292 pp_coercion uri do_composites i j
293 | Default (_,what,uris) -> pp_default what uris
295 | Include (_,path) -> "include \"" ^ path ^ "\""
296 | Obj (_,obj) -> obj_pp obj
298 | Relation (_,id,a,aeq,refl,sym,trans) ->
299 "relation " ^ term_pp aeq ^ " on " ^ term_pp a ^
301 Some r -> " reflexivity proved by " ^ term_pp r
304 Some r -> " symmetry proved by " ^ term_pp r
307 Some r -> " transitivity proved by " ^ term_pp r
309 | Print (_,s) -> "print " ^ s
310 | Set (_, name, value) -> Printf.sprintf "set \"%s\" \"%s\"" name value
312 let pp_punctuation_tactical ~term_pp ~lazy_term_pp =
318 | Pos (_, i) -> Printf.sprintf "%s:" (String.concat "," (List.map string_of_int i))
322 let pp_non_punctuation_tactical ~term_pp ~lazy_term_pp =
324 | Focus (_, goals) ->
325 Printf.sprintf "focus %s" (String.concat " " (List.map string_of_int goals))
326 | Unfocus _ -> "unfocus"
329 let pp_executable ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~obj_pp =
331 | Macro (_, macro) -> pp_macro ~term_pp macro ^ "."
332 | Tactic (_, Some tac, punct) ->
333 pp_tactic ~map_unicode_to_tex ~lazy_term_pp ~term_pp tac
334 ^ pp_punctuation_tactical ~lazy_term_pp ~term_pp punct
335 | Tactic (_, None, punct) ->
336 pp_punctuation_tactical ~lazy_term_pp ~term_pp punct
337 | NonPunctuationTactical (_, tac, punct) ->
338 pp_non_punctuation_tactical ~lazy_term_pp ~term_pp tac
339 ^ pp_punctuation_tactical ~lazy_term_pp ~term_pp punct
340 | Command (_, cmd) -> pp_command ~term_pp ~obj_pp cmd ^ "."
342 let pp_comment ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~obj_pp =
344 | Note (_,"") -> Printf.sprintf "\n"
345 | Note (_,str) -> Printf.sprintf "\n(* %s *)" str
347 Printf.sprintf "\n(** %s. **)" (pp_executable ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~obj_pp code)
349 let pp_statement ~term_pp ~lazy_term_pp ~obj_pp =
351 | Executable (_, ex) -> pp_executable ~lazy_term_pp ~term_pp ~obj_pp ex
352 | Comment (_, c) -> pp_comment ~term_pp ~lazy_term_pp ~obj_pp c