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 pp_just ~term_pp =
88 `Term term -> "exact " ^ term_pp term
89 | `Auto params -> pp_auto_params ~term_pp params
92 let rec pp_ntactic ~map_unicode_to_tex = function
93 | NApply (_,t) -> "napply " ^ CicNotationPp.pp_term t
94 | NCases (_,what,where) -> "ncases " ^ CicNotationPp.pp_term what ^
95 assert false ^ " " ^ assert false
96 | NCase1 (_,n) -> "*" ^ n ^ ":"
97 | NChange (_,what,wwhat) -> "nchange " ^ assert false ^
98 " with " ^ CicNotationPp.pp_term wwhat
99 | NElim (_,what,where) -> "nelim " ^ CicNotationPp.pp_term what ^
100 assert false ^ " " ^ assert false
102 | NIntro (_,n) -> "#" ^ n
103 | NRewrite (_,dir,n,where) -> "nrewrite" ^ assert false
104 | NAuto (_,(l,flgs)) ->
106 (if l <> [] then (" by " ^
107 (String.concat "," (List.map CicNotationPp.pp_term l))) else "") ^
108 String.concat " " (List.map (fun a,b -> a ^ "=" ^ b) flgs)
109 | NReduce _ | NGeneralize _ | NLetIn _ | NAssert _ -> assert false
111 | NSemicolon _ -> "##;"
114 | NPos (_, l) -> "##" ^String.concat "," (List.map string_of_int l)^ ":"
115 | NWildcard _ -> "##*:"
118 Printf.sprintf "##focus %s"
119 (String.concat " " (List.map string_of_int l))
120 | NUnfocus _ -> "##unfocus"
121 | NSkip _ -> "##skip"
122 | NTry (_,tac) -> "ntry " ^ pp_ntactic ~map_unicode_to_tex tac
123 | NAssumption _ -> "nassumption"
125 "(" ^ String.concat " " (List.map (pp_ntactic ~map_unicode_to_tex) l)^ ")"
126 | NRepeat (_,t) -> "nrepeat " ^ pp_ntactic ~map_unicode_to_tex t
129 let rec pp_tactic ~map_unicode_to_tex ~term_pp ~lazy_term_pp =
130 let pp_terms = pp_terms ~term_pp in
131 let pp_tactics = pp_tactics ~map_unicode_to_tex ~term_pp ~lazy_term_pp in
132 let pp_reduction_kind = pp_reduction_kind ~term_pp in
133 let pp_tactic_pattern =
134 pp_tactic_pattern ~map_unicode_to_tex ~lazy_term_pp ~term_pp in
137 (* Higher order tactics *)
138 | Do (_, count, tac) ->
139 Printf.sprintf "do %d %s" count (pp_tactic tac)
140 | Repeat (_, tac) -> "repeat " ^ pp_tactic tac
141 | Seq (_, tacs) -> pp_tactics ~sep:"; " tacs
142 | Then (_, tac, tacs) ->
143 Printf.sprintf "%s; [%s]" (pp_tactic tac)
144 (pp_tactics ~sep:" | " tacs)
146 Printf.sprintf "tries [%s]" (pp_tactics ~sep:" | " tacs)
147 | Try (_, tac) -> "try " ^ pp_tactic tac
149 Printf.sprintf "solve [%s]" (pp_tactics ~sep:" | " tac)
150 | Progress (_, tac) -> "progress " ^ pp_tactic tac
151 (* First order tactics *)
152 | Absurd (_, term) -> "absurd" ^ term_pp term
153 | Apply (_, term) -> "apply " ^ term_pp term
154 | ApplyRule (_, term) -> "apply rule " ^ term_pp term
155 | ApplyP (_, term) -> "applyP " ^ term_pp term
156 | ApplyS (_, term, params) ->
157 "applyS " ^ term_pp term ^ pp_auto_params ~term_pp params
158 | AutoBatch (_,params) -> "autobatch " ^
159 pp_auto_params ~term_pp params
160 | Assumption _ -> "assumption"
161 | Cases (_, term, pattern, specs) ->
162 Printf.sprintf "cases %s %s%s"
164 (pp_tactic_pattern pattern)
165 (pp_intros_specs "names " specs)
166 | Change (_, where, with_what) ->
167 Printf.sprintf "change %s with %s" (pp_tactic_pattern where) (lazy_term_pp with_what)
168 | Clear (_,ids) -> Printf.sprintf "clear %s" (pp_hyps ids)
169 | ClearBody (_,id) -> Printf.sprintf "clearbody %s" (pp_hyps [id])
170 | Constructor (_,n) -> "constructor " ^ string_of_int n
171 | Compose (_,t1, t2, times, intro_specs) ->
172 Printf.sprintf "compose %s%s %s%s"
173 (if times > 0 then string_of_int times ^ " " else "")
174 (term_pp t1) (match t2 with None -> "" | Some t2 -> "with "^term_pp t2)
175 (pp_intros_specs " as " intro_specs)
176 | Contradiction _ -> "contradiction"
177 | Cut (_, ident, term) ->
178 "cut " ^ term_pp term ^
179 (match ident with None -> "" | Some id -> " as " ^ id)
180 | Decompose (_, names) ->
181 Printf.sprintf "decompose%s"
182 (pp_intros_specs "names " (None, names))
183 | Demodulate (_, params) -> "demodulate " ^ pp_auto_params ~term_pp params
184 | Destruct (_, None) -> "destruct"
185 | Destruct (_, Some terms) -> "destruct " ^ pp_terms terms
186 | Elim (_, what, using, pattern, specs) ->
187 Printf.sprintf "elim %s%s %s%s"
189 (match using with None -> "" | Some term -> " using " ^ term_pp term)
190 (pp_tactic_pattern pattern)
191 (pp_intros_specs "names " specs)
192 | ElimType (_, term, using, specs) ->
193 Printf.sprintf "elim type %s%s%s"
195 (match using with None -> "" | Some term -> " using " ^ term_pp term)
196 (pp_intros_specs "names " specs)
197 | Exact (_, term) -> "exact " ^ term_pp term
198 | Exists _ -> "exists"
199 | Fold (_, kind, term, pattern) ->
200 Printf.sprintf "fold %s %s %s" (pp_reduction_kind kind)
201 (lazy_term_pp term) (pp_tactic_pattern pattern)
202 | FwdSimpl (_, hyp, names) ->
203 Printf.sprintf "fwd %s%s" hyp (pp_intros_specs "names " (None, names))
204 | Generalize (_, pattern, ident) ->
205 Printf.sprintf "generalize %s%s" (pp_tactic_pattern pattern)
206 (match ident with None -> "" | Some id -> " as " ^ id)
208 | Fourier _ -> "fourier"
210 | Intros (_, specs) -> Printf.sprintf "intros%s" (pp_intros_specs "" specs)
211 | Inversion (_, term) -> "inversion " ^ term_pp term
212 | LApply (_, linear, level_opt, terms, term, ident_opt) ->
213 Printf.sprintf "lapply %s%s%s%s%s"
214 (if linear then " linear " else "")
215 (match level_opt with None -> "" | Some i -> " depth = " ^ string_of_int i ^ " ")
217 (match terms with [] -> "" | _ -> " to " ^ pp_terms terms)
218 (match ident_opt with None -> "" | Some ident -> " as " ^ ident)
220 | LetIn (_, term, ident) ->
221 Printf.sprintf "letin %s \\def %s" ident (term_pp term)
222 | Reduce (_, kind, pat) ->
223 Printf.sprintf "%s %s" (pp_reduction_kind kind) (pp_tactic_pattern pat)
224 | Reflexivity _ -> "reflexivity"
225 | Replace (_, pattern, t) ->
226 Printf.sprintf "replace %s with %s" (pp_tactic_pattern pattern) (lazy_term_pp t)
227 | Rewrite (_, pos, t, pattern, names) ->
228 Printf.sprintf "rewrite %s %s %s%s"
229 (if pos = `LeftToRight then ">" else "<")
231 (pp_tactic_pattern pattern)
232 (if names = [] then "" else " as " ^ pp_idents names)
236 | Symmetry _ -> "symmetry"
237 | Transitivity (_, term) -> "transitivity " ^ term_pp term
238 (* Tattiche Aggiunte *)
239 | Assume (_, ident , term) -> "assume" ^ ident ^ ":" ^ term_pp term
240 | Suppose (_, term, ident,term1) -> "suppose" ^ term_pp term ^ "(" ^ ident ^ ")" ^ (match term1 with None -> " " | Some term1 -> term_pp term1)
241 | Bydone (_, just) -> pp_just ~term_pp just ^ "done"
242 | By_just_we_proved (_, just, term1, ident, term2) -> pp_just ~term_pp just ^ "we proved" ^ term_pp term1 ^ (match ident with None -> "" | Some ident -> "(" ^ident^ ")") ^
243 (match term2 with None -> " " | Some term2 -> term_pp term2)
244 | 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)
245 | We_proceed_by_cases_on (_, term, term1) -> "we proceed by cases on" ^ term_pp term ^ "to prove" ^ term_pp term1
246 | We_proceed_by_induction_on (_, term, term1) -> "we proceed by induction on" ^ term_pp term ^ "to prove" ^ term_pp term1
247 | Byinduction (_, term, ident) -> "by induction hypothesis we know" ^ term_pp term ^ "(" ^ ident ^ ")"
248 | Thesisbecomes (_, term) -> "the thesis becomes " ^ term_pp term
249 | ExistsElim (_, just, ident, term, ident1, term1) -> pp_just ~term_pp just ^ "let " ^ ident ^ ":" ^ term_pp term ^ "such that " ^ lazy_term_pp term1 ^ "(" ^ ident1 ^ ")"
250 | AndElim (_, just, ident1, term1, ident2, term2) -> pp_just ~term_pp just ^ "we have " ^ term_pp term1 ^ " (" ^ ident1 ^ ") " ^ "and " ^ term_pp term2 ^ " (" ^ ident2 ^ ")"
251 | RewritingStep (_, term, term1, term2, cont) ->
254 | Some (None,term) -> "conclude " ^ term_pp term
255 | Some (Some name,term) ->
256 "obtain (" ^ name ^ ") " ^ term_pp term)
260 | `Auto params -> pp_auto_params ~term_pp params
261 | `Term term2 -> " exact " ^ term_pp term2
263 | `SolveWith term -> " using " ^ term_pp term)
264 ^ (if cont then " done" else "")
265 | Case (_, id, args) ->
268 (List.map (function (id,term) -> "(" ^ id ^ ": " ^ term_pp term ^ ")")
272 and pp_tactics ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~sep tacs =
274 (List.map (pp_tactic ~map_unicode_to_tex ~lazy_term_pp ~term_pp) tacs)
276 let pp_search_kind = function
277 | `Locate -> "locate"
281 | `Instance -> "instance"
283 let pp_arg ~term_pp arg =
284 let s = term_pp arg in
285 if s = "" || (s.[0] = '(' && s.[String.length s - 1] = ')') then
286 (* _nice_ heuristic *)
291 let pp_macro ~term_pp ~lazy_term_pp =
292 let term_pp = pp_arg ~term_pp in
293 let flavour_pp = function
294 | `Definition -> "definition"
297 | `Remark -> "remark"
298 | `Theorem -> "theorem"
299 | `Variant -> "variant"
301 | `MutualDefinition -> assert false
303 let pp_inline_params l =
304 let pp_param = function
305 | IPPrefix prefix -> "prefix = \"" ^ prefix ^ "\""
306 | IPAs flavour -> flavour_pp flavour
307 | IPCoercions -> "coercions"
308 | IPDebug debug -> "debug = " ^ string_of_int debug
309 | IPProcedural -> "procedural"
310 | IPNoDefaults -> "nodefaults"
311 | IPDepth depth -> "depth = " ^ string_of_int depth
312 | IPLevel level -> "level = " ^ string_of_int level
313 | IPComments -> "comments"
316 let s = String.concat " " (List.map pp_param l) in
317 if s = "" then s else " " ^ s
319 let pp_reduction_kind = pp_reduction_kind ~term_pp:lazy_term_pp in
322 | WInstance (_, term) -> "whelp instance " ^ term_pp term
323 | WHint (_, t) -> "whelp hint " ^ term_pp t
324 | WLocate (_, s) -> "whelp locate \"" ^ s ^ "\""
325 | WElim (_, t) -> "whelp elim " ^ term_pp t
326 | WMatch (_, term) -> "whelp match " ^ term_pp term
328 | Eval (_, kind, term) ->
329 Printf.sprintf "eval %s on %s" (pp_reduction_kind kind) (term_pp term)
330 | Check (_, term) -> Printf.sprintf "check %s" (term_pp term)
331 | Hint (_, true) -> "hint rewrite"
332 | Hint (_, false) -> "hint"
333 | AutoInteractive (_,params) -> "auto " ^ pp_auto_params ~term_pp params
334 | Inline (_, suri, params) ->
335 Printf.sprintf "inline \"%s\"%s" suri (pp_inline_params params)
337 let pp_associativity = function
338 | Gramext.LeftA -> "left associative"
339 | Gramext.RightA -> "right associative"
340 | Gramext.NonA -> "non associative"
342 let pp_precedence i = Printf.sprintf "with precedence %d" i
344 let pp_dir_opt = function
346 | Some `LeftToRight -> "> "
347 | Some `RightToLeft -> "< "
349 let pp_default what uris =
350 Printf.sprintf "default \"%s\" %s" what
351 (String.concat " " (List.map UriManager.string_of_uri uris))
353 let pp_coercion ~term_pp t do_composites arity saturations=
354 Printf.sprintf "coercion %s %d %d %s"
355 (term_pp t) arity saturations
356 (if do_composites then "" else "nocomposites")
358 let pp_ncommand = function
359 | UnificationHint (_,t, n) ->
360 "unification hint " ^ string_of_int n ^ " " ^ CicNotationPp.pp_term t
362 | NUnivConstraint (_) -> "not supported"
363 | NCoercion (_) -> "not supported"
365 | NCopy (_,name,uri,map) ->
366 "copy " ^ name ^ " from " ^ NUri.string_of_uri uri ^ " with " ^
367 String.concat " and "
369 (fun (a,b) -> NUri.string_of_uri a ^ " ↦ " ^ NUri.string_of_uri b)
373 let pp_command ~term_pp ~obj_pp = function
374 | Index (_,_,uri) -> "Indexing " ^ UriManager.string_of_uri uri
375 | Select (_,uri) -> "Selecting " ^ UriManager.string_of_uri uri
376 | Coercion (_, t, do_composites, i, j) ->
377 pp_coercion ~term_pp t do_composites i j
378 | PreferCoercion (_,t) ->
379 "prefer coercion " ^ term_pp t
380 | Inverter (_,n,ty,params) ->
381 "inverter " ^ n ^ " for " ^ term_pp ty ^ " " ^ List.fold_left (fun acc x -> acc ^ (match x with true -> "%" | _ -> "?")) "" params
382 | Default (_,what,uris) -> pp_default what uris
384 | Include (_,true,`OldAndNew,path) -> "include \"" ^ path ^ "\""
385 | Include (_,false,`OldAndNew,path) -> "include source \"" ^ path ^ "\""
386 | Include (_,_,`New,path) -> "RECURSIVELY INCLUDING " ^ path
387 | Obj (_,obj) -> obj_pp obj
389 | Relation (_,id,a,aeq,refl,sym,trans) ->
390 "relation " ^ term_pp aeq ^ " on " ^ term_pp a ^
392 Some r -> " reflexivity proved by " ^ term_pp r
395 Some r -> " symmetry proved by " ^ term_pp r
398 Some r -> " transitivity proved by " ^ term_pp r
400 | Print (_,s) -> "print " ^ s
401 | Set (_, name, value) -> Printf.sprintf "set \"%s\" \"%s\"" name value
402 | Pump (_) -> "not supported"
404 let pp_punctuation_tactical =
410 | Pos (_, i) -> Printf.sprintf "%s:" (String.concat "," (List.map string_of_int i))
414 let pp_non_punctuation_tactical =
416 | Focus (_, goals) ->
417 Printf.sprintf "focus %s" (String.concat " " (List.map string_of_int goals))
418 | Unfocus _ -> "unfocus"
421 let pp_executable ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~obj_pp =
423 | Macro (_, macro) -> pp_macro ~term_pp ~lazy_term_pp macro ^ "."
424 | Tactic (_, Some tac, punct) ->
425 pp_tactic ~map_unicode_to_tex ~term_pp ~lazy_term_pp tac
426 ^ pp_punctuation_tactical punct
427 | Tactic (_, None, punct) ->
428 pp_punctuation_tactical punct
429 | NTactic (_,tacl) ->
430 String.concat " " (List.map (pp_ntactic ~map_unicode_to_tex) tacl)
431 | NonPunctuationTactical (_, tac, punct) ->
432 pp_non_punctuation_tactical tac
433 ^ pp_punctuation_tactical punct
434 | Command (_, cmd) -> pp_command ~term_pp ~obj_pp cmd ^ "."
435 | NCommand (_, cmd) -> pp_ncommand cmd ^ "."
437 let pp_comment ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~obj_pp =
439 | Note (_,"") -> Printf.sprintf "\n"
440 | Note (_,str) -> Printf.sprintf "\n(* %s *)" str
442 Printf.sprintf "\n(** %s. **)" (pp_executable ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~obj_pp code)
444 let pp_statement ~term_pp ~lazy_term_pp ~obj_pp =
446 | Executable (_, ex) -> pp_executable ~lazy_term_pp ~term_pp ~obj_pp ex
447 | Comment (_, c) -> pp_comment ~term_pp ~lazy_term_pp ~obj_pp c