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/
32 let tactical_terminator = ""
33 let tactic_terminator = tactical_terminator
34 let command_terminator = tactical_terminator
36 let pp_idents idents = "[" ^ String.concat "; " idents ^ "]"
38 let pp_reduction_kind ~term_pp = function
39 | `Normalize -> "normalize"
41 | `Simpl -> "simplify"
42 | `Unfold (Some t) -> "unfold " ^ term_pp t
43 | `Unfold None -> "unfold"
46 let pp_tactic_pattern ~term_pp ~lazy_term_pp (what, hyp, goal) =
50 | Some t -> sprintf "in match (%s) " (lazy_term_pp t) in
53 (List.map (fun (name, p) -> sprintf "%s:(%s)" name (term_pp p)) hyp) in
57 | Some t -> sprintf "\\vdash (%s)" (term_pp t) in
58 sprintf "%sin %s%s" what_text hyp_text goal_text
60 let pp_intros_specs = function
62 | Some num, [] -> Printf.sprintf " names %i" num
63 | None, idents -> Printf.sprintf " names %s" (pp_idents idents)
64 | Some num, idents -> Printf.sprintf " names %i %s" num (pp_idents idents)
66 let terms_pp ~term_pp terms = String.concat ", " (List.map term_pp terms)
68 let opt_string_pp = function
70 | Some what -> what ^ " "
72 let rec pp_tactic ~term_pp ~lazy_term_pp =
73 let pp_reduction_kind = pp_reduction_kind ~term_pp in
74 let pp_tactic_pattern = pp_tactic_pattern ~lazy_term_pp ~term_pp in
76 | Absurd (_, term) -> "absurd" ^ term_pp term
77 | Apply (_, term) -> "apply " ^ term_pp term
78 | ApplyS (_, term) -> "applyS " ^ term_pp term
79 | Auto (_,params) -> "auto " ^
81 (List.map (fun (k,v) -> if v <> "" then k ^ "=" ^ v else k) params)
82 | Assumption _ -> "assumption"
83 | Change (_, where, with_what) ->
84 sprintf "change %s with %s" (pp_tactic_pattern where) (lazy_term_pp with_what)
85 | Clear (_,ids) -> sprintf "clear %s" (pp_idents ids)
86 | ClearBody (_,id) -> sprintf "clearbody %s" id
87 | Constructor (_,n) -> "constructor " ^ string_of_int n
88 | Contradiction _ -> "contradiction"
89 | Cut (_, ident, term) ->
90 "cut " ^ term_pp term ^
91 (match ident with None -> "" | Some id -> " as " ^ id)
92 | Decompose (_, [], what, names) ->
93 sprintf "decompose %s%s" (opt_string_pp what) (pp_intros_specs (None, names))
94 | Decompose (_, types, what, names) ->
95 let to_ident = function
97 | Type _ -> assert false
99 let types = List.rev_map to_ident types in
100 sprintf "decompose %s %s%s" (pp_idents types) (opt_string_pp what) (pp_intros_specs (None, names))
101 | Demodulate _ -> "demodulate"
102 | Discriminate (_, term) -> "discriminate " ^ term_pp term
103 | Elim (_, term, using, num, idents) ->
104 sprintf "elim " ^ term_pp term ^
105 (match using with None -> "" | Some term -> " using " ^ term_pp term)
106 ^ pp_intros_specs (num, idents)
107 | ElimType (_, term, using, num, idents) ->
108 sprintf "elim type " ^ term_pp term ^
109 (match using with None -> "" | Some term -> " using " ^ term_pp term)
110 ^ pp_intros_specs (num, idents)
111 | Exact (_, term) -> "exact " ^ term_pp term
112 | Exists _ -> "exists"
113 | Fold (_, kind, term, pattern) ->
114 sprintf "fold %s %s %s" (pp_reduction_kind kind)
115 (lazy_term_pp term) (pp_tactic_pattern pattern)
116 | FwdSimpl (_, hyp, idents) ->
117 sprintf "fwd %s%s" hyp
118 (match idents with [] -> "" | idents -> " as " ^ pp_idents idents)
119 | Generalize (_, pattern, ident) ->
120 sprintf "generalize %s%s" (pp_tactic_pattern pattern)
121 (match ident with None -> "" | Some id -> " as " ^ id)
122 | Goal (_, n) -> "goal " ^ string_of_int n
124 | Fourier _ -> "fourier"
126 | Injection (_, term) -> "injection " ^ term_pp term
127 | Intros (_, None, []) -> "intros"
128 | Inversion (_, term) -> "inversion " ^ term_pp term
129 | Intros (_, num, idents) ->
131 (match num with None -> "" | Some num -> " " ^ string_of_int num)
132 (match idents with [] -> "" | idents -> " " ^ pp_idents idents)
133 | LApply (_, linear, level_opt, terms, term, ident_opt) ->
134 sprintf "lapply %s%s%s%s%s"
135 (if linear then " linear " else "")
136 (match level_opt with None -> "" | Some i -> " depth = " ^ string_of_int i ^ " ")
138 (match terms with [] -> "" | _ -> " to " ^ terms_pp ~term_pp terms)
139 (match ident_opt with None -> "" | Some ident -> " as " ^ ident)
141 | LetIn (_, term, ident) -> sprintf "let %s in %s" (term_pp term) ident
142 | Reduce (_, kind, pat) ->
143 sprintf "%s %s" (pp_reduction_kind kind) (pp_tactic_pattern pat)
144 | Reflexivity _ -> "reflexivity"
145 | Replace (_, pattern, t) ->
146 sprintf "replace %s with %s" (pp_tactic_pattern pattern) (lazy_term_pp t)
147 | Rewrite (_, pos, t, pattern) ->
148 sprintf "rewrite %s %s %s"
149 (if pos = `LeftToRight then ">" else "<")
151 (pp_tactic_pattern pattern)
156 | Symmetry _ -> "symmetry"
157 | Transitivity (_, term) -> "transitivity " ^ term_pp term
158 (* Tattiche Aggiunte *)
159 | Assume (_, ident , term) -> "assume" ^ ident ^ ":" ^ term_pp term
160 | Suppose (_, term, ident,term1) -> "suppose" ^ term_pp term ^ "(" ^ ident ^ ")" ^ (match term1 with None -> " " | Some term1 -> term_pp term1)
161 | Bydone (_, term) -> "by" ^ (match term with None -> "_" | Some term -> term_pp term) ^ "done"
162 | By_term_we_proved (_, term, term1, ident, term2) -> "by" ^ (match term with None -> "_" | Some term -> term_pp term) ^ "we proved" ^ term_pp term1 ^ "(" ^ident^ ")" ^
163 (match term2 with None -> " " | Some term2 -> term_pp term2)
164 | We_need_to_prove (_, term, ident, term1) -> "we need to prove" ^ term_pp term ^ "(" ^ ident ^ ")" ^ (match term1 with None -> " " | Some term1 -> term_pp term1)
165 | We_proceed_by_induction_on (_, term, term1) -> "we proceed by induction on" ^ term_pp term ^ "to prove" ^ term_pp term1
166 | Byinduction (_, term, ident) -> "by induction hypothesis we know" ^ term_pp term ^ "(" ^ ident ^ ")"
167 | Thesisbecomes (_, term) -> "the thesis becomes " ^ term_pp term
168 | ExistsElim (_, term0, ident, term, ident1, term1) -> "by " ^ term_pp term0 ^ "let " ^ ident ^ ":" ^ term_pp term ^ "such that " ^ term_pp term1 ^ "(" ^ ident1 ^ ")"
169 | AndElim (_, term, ident1, term1, ident2, term2) -> "by " ^ term_pp term ^ "we have " ^ term_pp term1 ^ " (" ^ ident1 ^ ") " ^ "and " ^ term_pp term2 ^ " (" ^ ident2 ^ ")"
170 | RewritingStep (_, term, term1, term2, cont) -> (match term with None -> " " | Some term -> "obtain " ^ term_pp term) ^ "=" ^ term_pp term1 ^ (match term2 with None -> "_" | Some term2 -> term_pp term2) ^ (match cont with None -> " done" | Some Cic.Anonymous -> "" | Some (Cic.Name id) -> " we proved " ^ id)
171 | Case (_, id, args) ->
174 (List.map (function (id,term) -> "(" ^ id ^ ": " ^ term_pp term ^ ")")
177 let pp_search_kind = function
178 | `Locate -> "locate"
182 | `Instance -> "instance"
184 let pp_arg ~term_pp arg =
185 let s = term_pp arg in
186 if s = "" || (s.[0] = '(' && s.[String.length s - 1] = ')') then
187 (* _nice_ heuristic *)
192 let pp_macro ~term_pp =
193 let term_pp = pp_arg ~term_pp in
196 | WInstance (_, term) -> "whelp instance " ^ term_pp term
197 | WHint (_, t) -> "whelp hint " ^ term_pp t
198 | WLocate (_, s) -> "whelp locate \"" ^ s ^ "\""
199 | WElim (_, t) -> "whelp elim " ^ term_pp t
200 | WMatch (_, term) -> "whelp match " ^ term_pp term
202 | Check (_, term) -> sprintf "Check %s" (term_pp term)
205 let pp_associativity = function
206 | Gramext.LeftA -> "left associative"
207 | Gramext.RightA -> "right associative"
208 | Gramext.NonA -> "non associative"
210 let pp_precedence i = sprintf "with precedence %d" i
212 let pp_dir_opt = function
214 | Some `LeftToRight -> "> "
215 | Some `RightToLeft -> "< "
217 let pp_default what uris =
218 sprintf "default \"%s\" %s" what
219 (String.concat " " (List.map UriManager.string_of_uri uris))
221 let pp_coercion uri do_composites arity =
222 sprintf "coercion %s %d (* %s *)" (UriManager.string_of_uri uri) arity
223 (if do_composites then "compounds" else "no compounds")
225 let pp_command ~obj_pp = function
226 | Include (_,path) -> "include \"" ^ path ^ "\""
229 | Print (_,s) -> "print " ^ s
230 | Set (_, name, value) -> sprintf "set \"%s\" \"%s\"" name value
231 | Coercion (_, uri, do_composites, i) -> pp_coercion uri do_composites i
232 | Obj (_,obj) -> obj_pp obj
233 | Default (_,what,uris) ->
236 let rec pp_tactical ~term_pp ~lazy_term_pp =
237 let pp_tactic = pp_tactic ~lazy_term_pp ~term_pp in
238 let pp_tacticals = pp_tacticals ~lazy_term_pp ~term_pp in
240 | Tactic (_, tac) -> pp_tactic tac
241 | Do (_, count, tac) ->
242 sprintf "do %d %s" count (pp_tactical ~term_pp ~lazy_term_pp tac)
243 | Repeat (_, tac) -> "repeat " ^ pp_tactical ~term_pp ~lazy_term_pp tac
244 | Seq (_, tacs) -> pp_tacticals ~sep:"; " tacs
245 | Then (_, tac, tacs) ->
246 sprintf "%s; [%s]" (pp_tactical ~term_pp ~lazy_term_pp tac)
247 (pp_tacticals ~sep:" | " tacs)
248 | First (_, tacs) -> sprintf "tries [%s]" (pp_tacticals ~sep:" | " tacs)
249 | Try (_, tac) -> "try " ^ pp_tactical ~term_pp ~lazy_term_pp tac
250 | Solve (_, tac) -> sprintf "solve [%s]" (pp_tacticals ~sep:" | " tac)
251 | Progress (_, tac) -> "progress " ^ pp_tactical ~term_pp ~lazy_term_pp tac
257 | Pos (_, i) -> sprintf "%s:" (String.concat "," (List.map string_of_int i))
260 | Focus (_, goals) ->
261 sprintf "focus %s" (String.concat " " (List.map string_of_int goals))
262 | Unfocus _ -> "unfocus"
265 and pp_tacticals ~term_pp ~lazy_term_pp ~sep tacs =
266 String.concat sep (List.map (pp_tactical~lazy_term_pp ~term_pp) tacs)
268 let pp_executable ~term_pp ~lazy_term_pp ~obj_pp =
270 | Macro (_, macro) -> pp_macro ~term_pp macro ^ "."
271 | Tactical (_, tac, Some punct) ->
272 pp_tactical ~lazy_term_pp ~term_pp tac
273 ^ pp_tactical ~lazy_term_pp ~term_pp punct
274 | Tactical (_, tac, None) -> pp_tactical ~lazy_term_pp ~term_pp tac
275 | Command (_, cmd) -> pp_command ~obj_pp cmd ^ "."
277 let pp_comment ~term_pp ~lazy_term_pp ~obj_pp =
279 | Note (_,str) -> sprintf "(* %s *)" str
281 sprintf "(** %s. **)" (pp_executable ~term_pp ~lazy_term_pp ~obj_pp code)
283 let pp_statement ~term_pp ~lazy_term_pp ~obj_pp =
285 | Executable (_, ex) -> pp_executable ~lazy_term_pp ~term_pp ~obj_pp ex
286 | Comment (_, c) -> pp_comment ~term_pp ~lazy_term_pp ~obj_pp c