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/
26 (**************************************************************************)
30 (* Andrea Asperti <asperti@cs.unibo.it> *)
33 (**************************************************************************)
39 let rec count_tactic current_size tac =
40 if current_size > maxsize then current_size
42 | Absurd (_, term) -> countterm (current_size + 6) term
43 | Apply (_, term) -> countterm (current_size + 6) term
44 | Auto _ -> current_size + 4
45 | Assumption _ -> current_size + 10
46 | Change (_, t1, t2, where) ->
47 let size1 = countterm (current_size + 12) t1 in (* change, with *)
48 let size2 = countterm size1 t2 in
51 | Some ident -> size2 + 3 + String.length ident)
52 | Change_pattern _ -> assert false (* TODO *)
53 | Contradiction _ -> current_size + 13
54 | Cut (_, term) -> countterm (current_size + 4) term
55 | Decompose (_, ident, principles) ->
57 (fun size s -> size + (String.length s))
58 (current_size + 11 + String.length ident) principles
59 | Discriminate (_, ident) -> current_size + 12 + (String.length ident)
60 | Elim (_, term, using) ->
61 let size1 = countterm (current_size + 5) term in
64 | Some term -> countterm (size1 + 7) term)
65 | ElimType (_, term) -> countterm (current_size + 10) term
66 | Exact (_, term) -> countterm (current_size + 6) term
67 | Exists _ -> current_size + 6
68 | Fold (_, kind, term) ->
69 countterm (current_size + 5) term
70 | Fourier _ -> current_size + 7
71 | Goal (_, n) -> current_size + 4 + int_of_float (ceil (log10 (float n)))
72 | Injection (_, ident) -> current_size + 10 + (String.length ident)
73 | Intros (_, num, idents) ->
75 (fun size s -> size + (String.length s))
76 (current_size + 7) idents
77 | Left _ -> current_size + 4
78 | LetIn (_, term, ident) ->
79 countterm (current_size + 5 + String.length ident) term
81 | ReduceAt _ -> assert false (* TODO *)
82 | Reflexivity _ -> current_size + 11
83 | Replace (_, t1, t2) ->
84 let size1 = countterm (current_size + 14) t1 in (* replace, with *)
86 | Replace_pattern _ -> assert false (* TODO *)
87 | Rewrite _ -> assert false (* TODO *)
88 | Right _ -> current_size + 5
89 | Ring _ -> current_size + 4
90 | Split _ -> current_size + 5
91 | Symmetry _ -> current_size + 8
92 | Transitivity (_, term) ->
93 countterm (current_size + 13) term
97 let n = (count_tactic 0 tac) in
98 (* prerr_endline ("Lunghezza: " ^ (string_of_int n)); *)
103 let rec small_tactic2box tac =
104 Box.Text([], TacticAstPp.pp_tactic tac)
106 let string_of_kind = function
107 | `Reduce -> "reduce"
108 | `Simpl -> "simplify"
110 | `Normalize -> "normalize"
112 let dummy_tbl = Hashtbl.create 0
114 let ast2astBox ast = Ast2pres.ast2astBox (ast, dummy_tbl)
116 let pretty_append l ast =
119 Box.H([],[Box.skip; ast2astBox ast])]
121 [Box.H([],l@[Box.smallskip; ast2astBox ast])]
123 let rec tactic2box tac =
124 if (is_big_tac tac) then
129 and big_tactic2box = function
130 | Absurd (_, term) ->
131 Box.V([],[Box.Text([],"absurd");
134 Box.V([],[Box.Text([],"apply");
136 | Assumption _ -> Box.Text([],"assumption")
137 | Auto _ -> Box.Text([],"auto")
138 | Change (_, t1, t2, where) ->
145 Box.Text([],ident)]) in
148 [Box.Text([],"change")]
151 [Box.Text([],"with")]
153 | Change_pattern _ -> assert false (* TODO *)
154 | Contradiction _ -> Box.Text([],"contradiction")
156 Box.V([],[Box.Text([],"cut");
157 Box.indent(ast2astBox term)])
158 | Decompose (_, ident, principles) ->
160 List.map (fun x -> Box.Text([],x)) principles in
161 Box.V([],[Box.Text([],"decompose");
162 Box.H([],[Box.Text([],"[");
163 Box.V([],principles);
166 | Discriminate (_, ident) ->
167 Box.V([],[Box.Text([],"discriminate");
169 | Elim (_, term, using) ->
175 [Box.Text([],"using")]
179 [Box.Text([],"elim")]
181 | ElimType (_, term) ->
182 Box.V([],[Box.Text([],"elim type");
183 Box.indent(ast2astBox term)])
185 Box.V([],[Box.Text([],"exact");
186 Box.indent(ast2astBox term)])
187 | Exists _ -> Box.Text([],"exists")
188 | Fold (_, kind, term) ->
189 Box.V([],[Box.H([],[Box.Text([],"fold");
191 Box.Text([],string_of_kind kind)]);
192 Box.indent(ast2astBox term)])
193 | Fourier _ -> Box.Text([],"fourier")
194 | Goal (_, n) -> Box.Text([],"goal " ^ string_of_int n)
195 | Injection (_, ident) ->
196 Box.V([],[Box.Text([],"transitivity");
197 Box.indent (Box.Text([],ident))])
198 | Intros (_, num, idents) ->
202 | Some num -> [Box.Text([],string_of_int num)]) in
204 List.map (fun x -> Box.Text([],x)) idents in
205 Box.V([],[Box.Text([],"decompose");
206 Box.H([],[Box.smallskip;
208 | Left _ -> Box.Text([],"left")
209 | LetIn (_, term, ident) ->
210 Box.V([],[Box.H([],[Box.Text([],"let");
215 Box.indent (ast2astBox term)])
217 | ReduceAt _ -> assert false (* TODO *)
218 | Reflexivity _ -> Box.Text([],"reflexivity")
219 | Replace (_, t1, t2) ->
222 [Box.Text([],"replace")]
225 [Box.Text([],"with")]
227 | Replace_pattern _ -> assert false (* TODO *)
228 | Rewrite _ -> assert false (* TODO *)
229 | Right _ -> Box.Text([],"right")
230 | Ring _ -> Box.Text([],"ring")
231 | Split _ -> Box.Text([],"split")
232 | Symmetry _ -> Box.Text([],"symmetry")
233 | Transitivity (_, term) ->
234 Box.V([],[Box.Text([],"transitivity");
235 Box.indent (ast2astBox term)])
240 let rec tactical2box = function
241 | Tactic (_, tac) -> tactic2box tac
243 | Command cmd -> (* TODO dummy implementation *)
244 Box.Text([], TacticAstPp.pp_tactical (Command cmd))
247 | Fail _ -> Box.Text([],"fail")
248 | Do (_, count, tac) ->
249 Box.V([],[Box.Text([],"do " ^ string_of_int count);
250 Box.indent (tactical2box tac)])
251 | IdTac _ -> Box.Text([],"id")
253 Box.V([],[Box.Text([],"repeat");
254 Box.indent (tactical2box tac)])
256 Box.V([],tacticals2box tacs)
257 | Then (_, tac, tacs) ->
258 Box.V([],[tactical2box tac;
261 Box.V([],tacticals2box tacs);
262 Box.Text([],"]");])])
264 Box.V([],[Box.Text([],"try");
267 Box.V([],tacticals2box tacs);
268 Box.Text([],"]");])])
270 Box.V([],[Box.Text([],"try");
271 Box.indent (tactical2box tac)])
273 and tacticals2box tacs =
275 (function tac -> Box.H([],[tactical2box tac; Box.Text([],";")])) tacs
280 (BoxPp.to_string CicAstPp.pp_term (tactical2box tac));;