1 (* Copyright (C) 2002, 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://cs.unibo.it/helm/.
32 (** perform debugging output? *)
34 let debug_print = fun _ -> ()
36 (** debugging print *)
37 let info s = debug_print (lazy ("TACTICALS INFO: " ^ (Lazy.force s)))
40 let id_tac (proof,goal) =
41 let _, metasenv, _, _ = proof in
42 let _, _, _ = CicUtil.lookup_meta goal metasenv in
45 ProofEngineTypes.mk_tactic id_tac
48 let fail_tac (proof,goal) =
49 let _, metasenv, _, _ = proof in
50 let _, _, _ = CicUtil.lookup_meta goal metasenv in
51 raise (ProofEngineTypes.Fail (lazy "fail tactical"))
53 ProofEngineTypes.mk_tactic fail_tac
55 type goal = ProofEngineTypes.goal
57 (** TODO needed until tactics start returning both opened and closed goals
58 * First part of the function performs a diff among goals ~before tactic
59 * application and ~after it. Second part will add as both opened and closed
60 * the goals which are returned as opened by the tactic *)
61 let goals_diff ~before ~after ~opened =
62 let sort_opened opened add =
63 opened @ (List.filter (fun g -> not (List.mem g opened)) add)
67 (fun remove e -> if List.mem e after then remove else e :: remove)
72 (fun add e -> if List.mem e before then add else e :: add)
76 let add, remove = (* adds goals which have been both opened _and_ closed *)
78 (fun (add, remove) opened_goal ->
79 if List.mem opened_goal before
80 then opened_goal :: add, opened_goal :: remove
85 sort_opened opened add, remove
90 val first: tactics: (string * tactic) list -> tactic
91 val thens: start: tactic -> continuations: tactic list -> tactic
92 val then_: start: tactic -> continuation: tactic -> tactic
93 val seq: tactics: tactic list -> tactic
94 val repeat_tactic: tactic: tactic -> tactic
95 val do_tactic: n: int -> tactic: tactic -> tactic
96 val try_tactic: tactic: tactic -> tactic
97 val solve_tactics: tactics: (string * tactic) list -> tactic
99 val tactic: tactic -> tactic
102 val semicolon: tactic
105 val pos: int -> tactic
107 val focus: int list -> tactic
111 module Make (S: Continuationals.Status) : T with type tactic = S.tactic =
113 module C = Continuationals.Make (S)
115 type tactic = S.tactic
117 let fold_eval status ts =
119 List.fold_left (fun istatus t -> S.focus ~-1 (C.eval t istatus)) status ts
124 naive implementation of ORELSE tactical, try a sequence of tactics in turn:
125 if one fails pass to the next one and so on, eventually raises (failure "no
129 let rec first ~(tactics: (string * tactic) list) istatus =
130 info (lazy "in Tacticals.first");
132 | (descr, tac)::tactics ->
133 info (lazy ("Tacticals.first IS TRYING " ^ descr));
135 let res = S.apply_tactic tac istatus in
136 info (lazy ("Tacticals.first: " ^ descr ^ " succedeed!!!"));
141 | (ProofEngineTypes.Fail _)
142 | (CicTypeChecker.TypeCheckerFailure _)
143 | (CicUnification.UnificationFailure _) ->
145 "Tacticals.first failed with exn: " ^
146 Printexc.to_string e));
147 first ~tactics istatus
148 | _ -> raise e) (* [e] must not be caught ; let's re-raise it *)
149 | [] -> raise (ProofEngineTypes.Fail (lazy "first: no tactics left"))
151 S.mk_tactic (first ~tactics)
153 let thens ~start ~continuations =
157 ([ C.Tactical (C.Tactic start); C.Branch ]
158 @ (HExtlib.list_concat ~sep:[ C.Shift ]
159 (List.map (fun t -> [ C.Tactical (C.Tactic t) ]) continuations))
162 let then_ ~start ~continuation =
165 let ostatus = C.eval (C.Tactical (C.Tactic start)) istatus in
166 let opened,closed = S.goals ostatus in
170 fold_eval (S.focus ~-1 ostatus)
172 C.Tactical (C.Tactic continuation) ])
178 (HExtlib.list_concat ~sep:[ C.Semicolon ]
179 (List.map (fun t -> [ C.Tactical (C.Tactic t) ]) tactics)))
181 (* TODO: x debug: i due tatticali seguenti non contano quante volte hanno
182 * applicato la tattica *)
184 let rec step f output_status opened closed =
186 | [] -> output_status, [], closed
188 let status = S.focus head output_status in
189 let output_status' = f status in
190 let opened', closed' = S.goals output_status' in
191 let output_status'', opened'', closed'' =
192 step f output_status' tail []
194 output_status'', opened' @ opened'', closed' @ closed''
196 (* This keep on appling tactic until it fails. When <tactic> generates more
197 * than one goal, you have a tree of application on the tactic, repeat_tactic
198 * works in depth on this tree *)
199 let repeat_tactic ~tactic =
200 let rec repeat_tactic ~tactic status =
201 info (lazy "in repeat_tactic");
203 let output_status = S.apply_tactic tactic status in
204 let opened, closed = S.goals output_status in
205 let output_status, opened', closed' =
206 step (repeat_tactic ~tactic) output_status opened closed
208 S.set_goals (opened', closed') output_status
210 (ProofEngineTypes.Fail _) as e ->
212 ("Tacticals.repeat_tactic failed after nth time with exception: "
213 ^ Printexc.to_string e));
214 S.apply_tactic S.id_tactic status
216 S.mk_tactic (repeat_tactic ~tactic)
218 (* This tries to apply tactic n times *)
219 let do_tactic ~n ~tactic =
220 let rec do_tactic ~n ~tactic status =
222 S.apply_tactic S.id_tactic status
225 let output_status = S.apply_tactic tactic status in
226 let opened, closed = S.goals output_status in
227 let output_status, opened', closed' =
228 step (do_tactic ~n:(n-1) ~tactic) output_status opened closed
230 S.set_goals (opened', closed') output_status
232 (ProofEngineTypes.Fail _) as e ->
234 ("Tacticals.do_tactic failed after nth time with exception: "
235 ^ Printexc.to_string e)) ;
236 S.apply_tactic S.id_tactic status
238 S.mk_tactic (do_tactic ~n ~tactic)
240 (* This applies tactic and catches its possible failure *)
241 let try_tactic ~tactic =
242 let rec try_tactic ~tactic status =
243 info (lazy "in Tacticals.try_tactic");
245 S.apply_tactic tactic status
247 (ProofEngineTypes.Fail _) as e ->
249 "Tacticals.try_tactic failed with exn: " ^ Printexc.to_string e));
250 S.apply_tactic S.id_tactic status
252 S.mk_tactic (try_tactic ~tactic)
254 (* This tries tactics until one of them doesn't _solve_ the goal *)
255 (* TODO: si puo' unificare le 2(due) chiamate ricorsive? *)
256 let solve_tactics ~tactics =
257 let rec solve_tactics ~(tactics: (string * tactic) list) status =
258 info (lazy "in Tacticals.solve_tactics");
260 | (descr, currenttactic)::moretactics ->
261 info (lazy ("Tacticals.solve_tactics is trying " ^ descr));
263 let output_status = S.apply_tactic currenttactic status in
264 let opened, closed = S.goals output_status in
266 | [] -> info (lazy ("Tacticals.solve_tactics: " ^ descr ^
267 " solved the goal!!!"));
268 (* questo significa che non ci sono piu' goal, o che current_tactic non ne ha
269 * aperti di nuovi? (la 2a!) ##### nel secondo caso basta per dire che
270 * solve_tactics has solved the goal? (si!) *)
272 | _ -> info (lazy ("Tacticals.solve_tactics: try the next tactic"));
273 solve_tactics ~tactics:(moretactics) status
275 (ProofEngineTypes.Fail _) as e ->
277 "Tacticals.solve_tactics: current tactic failed with exn: "
278 ^ Printexc.to_string e));
279 solve_tactics ~tactics status
282 raise (ProofEngineTypes.Fail
283 (lazy "solve_tactics cannot solve the goal"))
285 S.mk_tactic (solve_tactics ~tactics)
287 let cont_proxy cont = S.mk_tactic (C.eval cont)
289 let tactic t = cont_proxy (C.Tactical (C.Tactic t))
290 let skip = cont_proxy (C.Tactical C.Skip)
291 let dot = cont_proxy C.Dot
292 let semicolon = cont_proxy C.Semicolon
293 let branch = cont_proxy C.Branch
294 let shift = cont_proxy C.Shift
295 let pos i = cont_proxy (C.Pos i)
296 let merge = cont_proxy C.Merge
297 let focus goals = cont_proxy (C.Focus goals)
298 let unfocus = cont_proxy C.Unfocus
301 module ProofEngineStatus =
303 module Stack = Continuationals.Stack
306 ProofEngineTypes.status (* (proof, goal) *) * Stack.t
309 (ProofEngineTypes.proof * goal list * goal list) * Stack.t
311 type tactic = ProofEngineTypes.tactic
313 let id_tactic = id_tac
316 ProofEngineTypes.mk_tactic
317 (fun (proof, goal) as pstatus ->
318 let stack = [ [ 1, Stack.Open goal ], [], [], Stack.NoTag ] in
319 let istatus = pstatus, stack in
320 (* let ostatus = f istatus in
321 let ((proof, opened, _), _) = ostatus in *)
322 let (proof, _, _), stack = f istatus in
323 let opened = Continuationals.Stack.open_goals stack in
326 let apply_tactic tac ((proof, _) as pstatus, stack) =
327 let proof', opened = ProofEngineTypes.apply_tactic tac pstatus in
328 (* let _ = prerr_endline ("goal aperti dalla tattica " ^ String.concat "," (List.map string_of_int opened)) in *)
329 let before = ProofEngineTypes.goals_of_proof proof in
330 let after = ProofEngineTypes.goals_of_proof proof' in
331 let opened_goals, closed_goals = goals_diff ~before ~after ~opened in
332 (* let _ = prerr_endline ("goal ritornati dalla tattica " ^ String.concat "," (List.map string_of_int opened_goals)) in *)
333 (proof', opened_goals, closed_goals), stack
335 let goals ((_, opened, closed), _) = opened, closed
336 let set_goals (opened, closed) ((proof, _, _), stack) =
337 (proof, opened, closed), stack
340 let set_stack stack (opstatus, _) = opstatus, stack
342 let inject ((proof, _), stack) = ((proof, [], []), stack)
343 let focus goal ((proof, _, _), stack) = (proof, goal), stack
346 module ProofEngineTacticals = Make (ProofEngineStatus)
348 include ProofEngineTacticals