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"
126 let rec pp_tactic ~map_unicode_to_tex ~term_pp ~lazy_term_pp =
127 let pp_terms = pp_terms ~term_pp in
128 let pp_tactics = pp_tactics ~map_unicode_to_tex ~term_pp ~lazy_term_pp in
129 let pp_reduction_kind = pp_reduction_kind ~term_pp in
130 let pp_tactic_pattern =
131 pp_tactic_pattern ~map_unicode_to_tex ~lazy_term_pp ~term_pp in
134 (* Higher order tactics *)
135 | Do (_, count, tac) ->
136 Printf.sprintf "do %d %s" count (pp_tactic tac)
137 | Repeat (_, tac) -> "repeat " ^ pp_tactic tac
138 | Seq (_, tacs) -> pp_tactics ~sep:"; " tacs
139 | Then (_, tac, tacs) ->
140 Printf.sprintf "%s; [%s]" (pp_tactic tac)
141 (pp_tactics ~sep:" | " tacs)
143 Printf.sprintf "tries [%s]" (pp_tactics ~sep:" | " tacs)
144 | Try (_, tac) -> "try " ^ pp_tactic tac
146 Printf.sprintf "solve [%s]" (pp_tactics ~sep:" | " tac)
147 | Progress (_, tac) -> "progress " ^ pp_tactic tac
148 (* First order tactics *)
149 | Absurd (_, term) -> "absurd" ^ term_pp term
150 | Apply (_, term) -> "apply " ^ term_pp term
151 | ApplyRule (_, term) -> "apply rule " ^ term_pp term
152 | ApplyP (_, term) -> "applyP " ^ term_pp term
153 | ApplyS (_, term, params) ->
154 "applyS " ^ term_pp term ^ pp_auto_params ~term_pp params
155 | AutoBatch (_,params) -> "autobatch " ^
156 pp_auto_params ~term_pp params
157 | Assumption _ -> "assumption"
158 | Cases (_, term, pattern, specs) ->
159 Printf.sprintf "cases %s %s%s"
161 (pp_tactic_pattern pattern)
162 (pp_intros_specs "names " specs)
163 | Change (_, where, with_what) ->
164 Printf.sprintf "change %s with %s" (pp_tactic_pattern where) (lazy_term_pp with_what)
165 | Clear (_,ids) -> Printf.sprintf "clear %s" (pp_hyps ids)
166 | ClearBody (_,id) -> Printf.sprintf "clearbody %s" (pp_hyps [id])
167 | Constructor (_,n) -> "constructor " ^ string_of_int n
168 | Compose (_,t1, t2, times, intro_specs) ->
169 Printf.sprintf "compose %s%s %s%s"
170 (if times > 0 then string_of_int times ^ " " else "")
171 (term_pp t1) (match t2 with None -> "" | Some t2 -> "with "^term_pp t2)
172 (pp_intros_specs " as " intro_specs)
173 | Contradiction _ -> "contradiction"
174 | Cut (_, ident, term) ->
175 "cut " ^ term_pp term ^
176 (match ident with None -> "" | Some id -> " as " ^ id)
177 | Decompose (_, names) ->
178 Printf.sprintf "decompose%s"
179 (pp_intros_specs "names " (None, names))
180 | Demodulate (_, params) -> "demodulate " ^ pp_auto_params ~term_pp params
181 | Destruct (_, None) -> "destruct"
182 | Destruct (_, Some terms) -> "destruct " ^ pp_terms terms
183 | Elim (_, what, using, pattern, specs) ->
184 Printf.sprintf "elim %s%s %s%s"
186 (match using with None -> "" | Some term -> " using " ^ term_pp term)
187 (pp_tactic_pattern pattern)
188 (pp_intros_specs "names " specs)
189 | ElimType (_, term, using, specs) ->
190 Printf.sprintf "elim type %s%s%s"
192 (match using with None -> "" | Some term -> " using " ^ term_pp term)
193 (pp_intros_specs "names " specs)
194 | Exact (_, term) -> "exact " ^ term_pp term
195 | Exists _ -> "exists"
196 | Fold (_, kind, term, pattern) ->
197 Printf.sprintf "fold %s %s %s" (pp_reduction_kind kind)
198 (lazy_term_pp term) (pp_tactic_pattern pattern)
199 | FwdSimpl (_, hyp, names) ->
200 Printf.sprintf "fwd %s%s" hyp (pp_intros_specs "names " (None, names))
201 | Generalize (_, pattern, ident) ->
202 Printf.sprintf "generalize %s%s" (pp_tactic_pattern pattern)
203 (match ident with None -> "" | Some id -> " as " ^ id)
205 | Fourier _ -> "fourier"
207 | Intros (_, specs) -> Printf.sprintf "intros%s" (pp_intros_specs "" specs)
208 | Inversion (_, term) -> "inversion " ^ term_pp term
209 | LApply (_, linear, level_opt, terms, term, ident_opt) ->
210 Printf.sprintf "lapply %s%s%s%s%s"
211 (if linear then " linear " else "")
212 (match level_opt with None -> "" | Some i -> " depth = " ^ string_of_int i ^ " ")
214 (match terms with [] -> "" | _ -> " to " ^ pp_terms terms)
215 (match ident_opt with None -> "" | Some ident -> " as " ^ ident)
217 | LetIn (_, term, ident) ->
218 Printf.sprintf "letin %s \\def %s" ident (term_pp term)
219 | Reduce (_, kind, pat) ->
220 Printf.sprintf "%s %s" (pp_reduction_kind kind) (pp_tactic_pattern pat)
221 | Reflexivity _ -> "reflexivity"
222 | Replace (_, pattern, t) ->
223 Printf.sprintf "replace %s with %s" (pp_tactic_pattern pattern) (lazy_term_pp t)
224 | Rewrite (_, pos, t, pattern, names) ->
225 Printf.sprintf "rewrite %s %s %s%s"
226 (if pos = `LeftToRight then ">" else "<")
228 (pp_tactic_pattern pattern)
229 (if names = [] then "" else " as " ^ pp_idents names)
233 | Symmetry _ -> "symmetry"
234 | Transitivity (_, term) -> "transitivity " ^ term_pp term
235 (* Tattiche Aggiunte *)
236 | Assume (_, ident , term) -> "assume" ^ ident ^ ":" ^ term_pp term
237 | Suppose (_, term, ident,term1) -> "suppose" ^ term_pp term ^ "(" ^ ident ^ ")" ^ (match term1 with None -> " " | Some term1 -> term_pp term1)
238 | Bydone (_, just) -> pp_just ~term_pp just ^ "done"
239 | 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^ ")") ^
240 (match term2 with None -> " " | Some term2 -> term_pp term2)
241 | 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)
242 | We_proceed_by_cases_on (_, term, term1) -> "we proceed by cases on" ^ term_pp term ^ "to prove" ^ term_pp term1
243 | We_proceed_by_induction_on (_, term, term1) -> "we proceed by induction on" ^ term_pp term ^ "to prove" ^ term_pp term1
244 | Byinduction (_, term, ident) -> "by induction hypothesis we know" ^ term_pp term ^ "(" ^ ident ^ ")"
245 | Thesisbecomes (_, term) -> "the thesis becomes " ^ term_pp term
246 | ExistsElim (_, just, ident, term, ident1, term1) -> pp_just ~term_pp just ^ "let " ^ ident ^ ":" ^ term_pp term ^ "such that " ^ lazy_term_pp term1 ^ "(" ^ ident1 ^ ")"
247 | AndElim (_, just, ident1, term1, ident2, term2) -> pp_just ~term_pp just ^ "we have " ^ term_pp term1 ^ " (" ^ ident1 ^ ") " ^ "and " ^ term_pp term2 ^ " (" ^ ident2 ^ ")"
248 | RewritingStep (_, term, term1, term2, cont) ->
251 | Some (None,term) -> "conclude " ^ term_pp term
252 | Some (Some name,term) ->
253 "obtain (" ^ name ^ ") " ^ term_pp term)
257 | `Auto params -> pp_auto_params ~term_pp params
258 | `Term term2 -> " exact " ^ term_pp term2
260 | `SolveWith term -> " using " ^ term_pp term)
261 ^ (if cont then " done" else "")
262 | Case (_, id, args) ->
265 (List.map (function (id,term) -> "(" ^ id ^ ": " ^ term_pp term ^ ")")
269 and pp_tactics ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~sep tacs =
271 (List.map (pp_tactic ~map_unicode_to_tex ~lazy_term_pp ~term_pp) tacs)
273 let pp_search_kind = function
274 | `Locate -> "locate"
278 | `Instance -> "instance"
280 let pp_arg ~term_pp arg =
281 let s = term_pp arg in
282 if s = "" || (s.[0] = '(' && s.[String.length s - 1] = ')') then
283 (* _nice_ heuristic *)
288 let pp_macro ~term_pp ~lazy_term_pp =
289 let term_pp = pp_arg ~term_pp in
290 let flavour_pp = function
291 | `Definition -> "definition"
294 | `Remark -> "remark"
295 | `Theorem -> "theorem"
296 | `Variant -> "variant"
298 | `MutualDefinition -> assert false
300 let pp_inline_params l =
301 let pp_param = function
302 | IPPrefix prefix -> "prefix = \"" ^ prefix ^ "\""
303 | IPAs flavour -> flavour_pp flavour
304 | IPCoercions -> "coercions"
305 | IPDebug debug -> "debug = " ^ string_of_int debug
306 | IPProcedural -> "procedural"
307 | IPNoDefaults -> "nodefaults"
308 | IPDepth depth -> "depth = " ^ string_of_int depth
309 | IPLevel level -> "level = " ^ string_of_int level
310 | IPComments -> "comments"
313 let s = String.concat " " (List.map pp_param l) in
314 if s = "" then s else " " ^ s
316 let pp_reduction_kind = pp_reduction_kind ~term_pp:lazy_term_pp in
319 | WInstance (_, term) -> "whelp instance " ^ term_pp term
320 | WHint (_, t) -> "whelp hint " ^ term_pp t
321 | WLocate (_, s) -> "whelp locate \"" ^ s ^ "\""
322 | WElim (_, t) -> "whelp elim " ^ term_pp t
323 | WMatch (_, term) -> "whelp match " ^ term_pp term
325 | Eval (_, kind, term) ->
326 Printf.sprintf "eval %s on %s" (pp_reduction_kind kind) (term_pp term)
327 | Check (_, term) -> Printf.sprintf "check %s" (term_pp term)
328 | Hint (_, true) -> "hint rewrite"
329 | Hint (_, false) -> "hint"
330 | AutoInteractive (_,params) -> "auto " ^ pp_auto_params ~term_pp params
331 | Inline (_, suri, params) ->
332 Printf.sprintf "inline \"%s\"%s" suri (pp_inline_params params)
334 let pp_associativity = function
335 | Gramext.LeftA -> "left associative"
336 | Gramext.RightA -> "right associative"
337 | Gramext.NonA -> "non associative"
339 let pp_precedence i = Printf.sprintf "with precedence %d" i
341 let pp_dir_opt = function
343 | Some `LeftToRight -> "> "
344 | Some `RightToLeft -> "< "
346 let pp_default what uris =
347 Printf.sprintf "default \"%s\" %s" what
348 (String.concat " " (List.map UriManager.string_of_uri uris))
350 let pp_coercion ~term_pp t do_composites arity saturations=
351 Printf.sprintf "coercion %s %d %d %s"
352 (term_pp t) arity saturations
353 (if do_composites then "" else "nocomposites")
355 let pp_ncommand = function
356 | UnificationHint (_,t, n) ->
357 "unification hint " ^ string_of_int n ^ " " ^ CicNotationPp.pp_term t
359 | NUnivConstraint (_) -> "not supported"
362 let pp_command ~term_pp ~obj_pp = function
363 | Index (_,_,uri) -> "Indexing " ^ UriManager.string_of_uri uri
364 | Select (_,uri) -> "Selecting " ^ UriManager.string_of_uri uri
365 | Coercion (_, t, do_composites, i, j) ->
366 pp_coercion ~term_pp t do_composites i j
367 | PreferCoercion (_,t) ->
368 "prefer coercion " ^ term_pp t
369 | Inverter (_,n,ty,params) ->
370 "inverter " ^ n ^ " for " ^ term_pp ty ^ " " ^ List.fold_left (fun acc x -> acc ^ (match x with true -> "%" | _ -> "?")) "" params
371 | Default (_,what,uris) -> pp_default what uris
373 | Include (_,true,path) -> "include \"" ^ path ^ "\""
374 | Include (_,false,path) -> "include source \"" ^ path ^ "\""
375 | Obj (_,obj) -> obj_pp obj
377 | Relation (_,id,a,aeq,refl,sym,trans) ->
378 "relation " ^ term_pp aeq ^ " on " ^ term_pp a ^
380 Some r -> " reflexivity proved by " ^ term_pp r
383 Some r -> " symmetry proved by " ^ term_pp r
386 Some r -> " transitivity proved by " ^ term_pp r
388 | Print (_,s) -> "print " ^ s
389 | Set (_, name, value) -> Printf.sprintf "set \"%s\" \"%s\"" name value
390 | Pump (_) -> "not supported"
392 let pp_punctuation_tactical =
398 | Pos (_, i) -> Printf.sprintf "%s:" (String.concat "," (List.map string_of_int i))
402 let pp_non_punctuation_tactical =
404 | Focus (_, goals) ->
405 Printf.sprintf "focus %s" (String.concat " " (List.map string_of_int goals))
406 | Unfocus _ -> "unfocus"
409 let pp_executable ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~obj_pp =
411 | Macro (_, macro) -> pp_macro ~term_pp ~lazy_term_pp macro ^ "."
412 | Tactic (_, Some tac, punct) ->
413 pp_tactic ~map_unicode_to_tex ~term_pp ~lazy_term_pp tac
414 ^ pp_punctuation_tactical punct
415 | Tactic (_, None, punct) ->
416 pp_punctuation_tactical punct
417 | NTactic (_,tacl) ->
418 String.concat " " (List.map (pp_ntactic ~map_unicode_to_tex) tacl)
419 | NonPunctuationTactical (_, tac, punct) ->
420 pp_non_punctuation_tactical tac
421 ^ pp_punctuation_tactical punct
422 | Command (_, cmd) -> pp_command ~term_pp ~obj_pp cmd ^ "."
423 | NCommand (_, cmd) -> pp_ncommand cmd ^ "."
425 let pp_comment ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~obj_pp =
427 | Note (_,"") -> Printf.sprintf "\n"
428 | Note (_,str) -> Printf.sprintf "\n(* %s *)" str
430 Printf.sprintf "\n(** %s. **)" (pp_executable ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~obj_pp code)
432 let pp_statement ~term_pp ~lazy_term_pp ~obj_pp =
434 | Executable (_, ex) -> pp_executable ~lazy_term_pp ~term_pp ~obj_pp ex
435 | Comment (_, c) -> pp_comment ~term_pp ~lazy_term_pp ~obj_pp c