1 (* Copyright (C) 2005, 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/
28 module PEH = ProofEngineHelpers
31 (* mo file name, ma file name *)
32 exception IncludedFileNotCompiled of string * string
35 (Cic.context -> GrafiteTypes.status * (Cic.term,Cic.lazy_term) GrafiteAst.macro)
37 type 'a disambiguator_input = string * int * 'a
40 do_heavy_checks: bool ;
43 (** create a ProofEngineTypes.mk_fresh_name_type function which uses given
44 * names as long as they are available, then it fallbacks to name generation
45 * using FreshNamesGenerator module *)
47 let len = List.length names in
49 fun metasenv context name ~typ ->
50 if !count < len then begin
51 let name = match List.nth names !count with
52 | Some s -> Cic.Name s
53 | None -> Cic.Anonymous
58 FreshNamesGenerator.mk_fresh_name ~subst:[] metasenv context name ~typ
60 let rec tactic_of_ast status ast =
61 let module PET = ProofEngineTypes in
63 (* Higher order tactics *)
64 | GrafiteAst.Do (loc, n, tactic) ->
65 Tacticals.do_tactic n (tactic_of_ast status tactic)
66 | GrafiteAst.Seq (loc, tactics) -> (* tac1; tac2; ... *)
67 Tacticals.seq (List.map (tactic_of_ast status) tactics)
68 | GrafiteAst.Repeat (loc, tactic) ->
69 Tacticals.repeat_tactic (tactic_of_ast status tactic)
70 | GrafiteAst.Then (loc, tactic, tactics) -> (* tac; [ tac1 | ... ] *)
72 (tactic_of_ast status tactic)
73 (List.map (tactic_of_ast status) tactics)
74 | GrafiteAst.First (loc, tactics) ->
75 Tacticals.first (List.map (tactic_of_ast status) tactics)
76 | GrafiteAst.Try (loc, tactic) ->
77 Tacticals.try_tactic (tactic_of_ast status tactic)
78 | GrafiteAst.Solve (loc, tactics) ->
79 Tacticals.solve_tactics (List.map (tactic_of_ast status) tactics)
80 | GrafiteAst.Progress (loc, tactic) ->
81 Tacticals.progress_tactic (tactic_of_ast status tactic)
82 (* First order tactics *)
83 | GrafiteAst.Absurd (_, term) -> Tactics.absurd term
84 | GrafiteAst.Apply (_, term) -> Tactics.apply term
85 | GrafiteAst.ApplyRule (_, term) -> Tactics.apply term
86 | GrafiteAst.ApplyP (_, term) -> Tactics.applyP term
87 | GrafiteAst.ApplyS (_, term, params) ->
88 Tactics.applyS ~term ~params ~dbd:(LibraryDb.instance ())
89 ~universe:status.GrafiteTypes.universe
90 | GrafiteAst.Assumption _ -> Tactics.assumption
91 | GrafiteAst.AutoBatch (_,params) ->
92 Tactics.auto ~params ~dbd:(LibraryDb.instance ())
93 ~universe:status.GrafiteTypes.universe
94 | GrafiteAst.Cases (_, what, pattern, (howmany, names)) ->
95 Tactics.cases_intros ?howmany ~mk_fresh_name_callback:(namer_of names)
97 | GrafiteAst.Change (_, pattern, with_what) ->
98 Tactics.change ~pattern with_what
99 | GrafiteAst.Clear (_,id) -> Tactics.clear id
100 | GrafiteAst.ClearBody (_,id) -> Tactics.clearbody id
101 | GrafiteAst.Compose (_,t1,t2,times,(howmany, names)) ->
102 Tactics.compose times t1 t2 ?howmany
103 ~mk_fresh_name_callback:(namer_of names)
104 | GrafiteAst.Contradiction _ -> Tactics.contradiction
105 | GrafiteAst.Constructor (_, n) -> Tactics.constructor n
106 | GrafiteAst.Cut (_, ident, term) ->
107 let names = match ident with None -> [] | Some id -> [Some id] in
108 Tactics.cut ~mk_fresh_name_callback:(namer_of names) term
109 | GrafiteAst.Decompose (_, names) ->
110 let mk_fresh_name_callback = namer_of names in
111 Tactics.decompose ~mk_fresh_name_callback ()
112 | GrafiteAst.Demodulate (_, params) ->
114 ~dbd:(LibraryDb.instance ()) ~params
115 ~universe:status.GrafiteTypes.universe
116 | GrafiteAst.Destruct (_,xterms) -> Tactics.destruct xterms
117 | GrafiteAst.Elim (_, what, using, pattern, (depth, names)) ->
118 Tactics.elim_intros ?using ?depth ~mk_fresh_name_callback:(namer_of names)
120 | GrafiteAst.ElimType (_, what, using, (depth, names)) ->
121 Tactics.elim_type ?using ?depth ~mk_fresh_name_callback:(namer_of names)
123 | GrafiteAst.Exact (_, term) -> Tactics.exact term
124 | GrafiteAst.Exists _ -> Tactics.exists
125 | GrafiteAst.Fail _ -> Tactics.fail
126 | GrafiteAst.Fold (_, reduction_kind, term, pattern) ->
128 match reduction_kind with
130 PET.const_lazy_reduction
131 (CicReduction.normalize ~delta:false ~subst:[])
132 | `Simpl -> PET.const_lazy_reduction ProofEngineReduction.simpl
134 PET.const_lazy_reduction (ProofEngineReduction.unfold ?what:None)
135 | `Unfold (Some lazy_term) ->
136 (fun context metasenv ugraph ->
137 let what, metasenv, ugraph = lazy_term context metasenv ugraph in
138 ProofEngineReduction.unfold ~what, metasenv, ugraph)
140 PET.const_lazy_reduction (CicReduction.whd ~delta:false ~subst:[])
142 Tactics.fold ~reduction ~term ~pattern
143 | GrafiteAst.Fourier _ -> Tactics.fourier
144 | GrafiteAst.FwdSimpl (_, hyp, names) ->
145 Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names)
146 ~dbd:(LibraryDb.instance ()) hyp
147 | GrafiteAst.Generalize (_,pattern,ident) ->
148 let names = match ident with None -> [] | Some id -> [Some id] in
149 Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern
150 | GrafiteAst.IdTac _ -> Tactics.id
151 | GrafiteAst.Intros (_, (howmany, names)) ->
152 PrimitiveTactics.intros_tac ?howmany
153 ~mk_fresh_name_callback:(namer_of names) ()
154 | GrafiteAst.Inversion (_, term) ->
155 Tactics.inversion term
156 | GrafiteAst.LApply (_, linear, how_many, to_what, what, ident) ->
157 let names = match ident with None -> [] | Some id -> [Some id] in
158 Tactics.lapply ~mk_fresh_name_callback:(namer_of names)
159 ~linear ?how_many ~to_what what
160 | GrafiteAst.Left _ -> Tactics.left
161 | GrafiteAst.LetIn (loc,term,name) ->
162 Tactics.letin term ~mk_fresh_name_callback:(namer_of [Some name])
163 | GrafiteAst.Reduce (_, reduction_kind, pattern) ->
164 (match reduction_kind with
165 | `Normalize -> Tactics.normalize ~pattern
166 | `Simpl -> Tactics.simpl ~pattern
167 | `Unfold what -> Tactics.unfold ~pattern what
168 | `Whd -> Tactics.whd ~pattern)
169 | GrafiteAst.Reflexivity _ -> Tactics.reflexivity
170 | GrafiteAst.Replace (_, pattern, with_what) ->
171 Tactics.replace ~pattern ~with_what
172 | GrafiteAst.Rewrite (_, direction, t, pattern, names) ->
173 EqualityTactics.rewrite_tac ~direction ~pattern t
174 (* to be replaced with ~mk_fresh_name_callback:(namer_of names) *)
175 (List.map (function Some s -> s | None -> assert false) names)
176 | GrafiteAst.Right _ -> Tactics.right
177 | GrafiteAst.Ring _ -> Tactics.ring
178 | GrafiteAst.Split _ -> Tactics.split
179 | GrafiteAst.Symmetry _ -> Tactics.symmetry
180 | GrafiteAst.Transitivity (_, term) -> Tactics.transitivity term
181 (* Implementazioni Aggiunte *)
182 | GrafiteAst.Assume (_, id, t) -> Declarative.assume id t
183 | GrafiteAst.Suppose (_, t, id, t1) -> Declarative.suppose t id t1
184 | GrafiteAst.By_just_we_proved (_, just, ty, id, t1) ->
185 Declarative.by_just_we_proved ~dbd:(LibraryDb.instance())
186 ~universe:status.GrafiteTypes.universe just ty id t1
187 | GrafiteAst.We_need_to_prove (_, t, id, t2) ->
188 Declarative.we_need_to_prove t id t2
189 | GrafiteAst.Bydone (_, t) ->
190 Declarative.bydone ~dbd:(LibraryDb.instance())
191 ~universe:status.GrafiteTypes.universe t
192 | GrafiteAst.We_proceed_by_cases_on (_, t, t1) ->
193 Declarative.we_proceed_by_cases_on t t1
194 | GrafiteAst.We_proceed_by_induction_on (_, t, t1) ->
195 Declarative.we_proceed_by_induction_on t t1
196 | GrafiteAst.Byinduction (_, t, id) -> Declarative.byinduction t id
197 | GrafiteAst.Thesisbecomes (_, t) -> Declarative.thesisbecomes t
198 | GrafiteAst.ExistsElim (_, just, id1, t1, id2, t2) ->
199 Declarative.existselim ~dbd:(LibraryDb.instance())
200 ~universe:status.GrafiteTypes.universe just id1 t1 id2 t2
201 | GrafiteAst.Case (_,id,params) -> Declarative.case id params
202 | GrafiteAst.AndElim(_,just,id1,t1,id2,t2) ->
203 Declarative.andelim ~dbd:(LibraryDb.instance ())
204 ~universe:status.GrafiteTypes.universe just id1 t1 id2 t2
205 | GrafiteAst.RewritingStep (_,termine,t1,t2,cont) ->
206 Declarative.rewritingstep ~dbd:(LibraryDb.instance ())
207 ~universe:status.GrafiteTypes.universe termine t1 t2 cont
209 let classify_tactic tactic =
211 (* tactics that can't close the goal (return a goal we want to "select") *)
212 | GrafiteAst.Rewrite _
214 | GrafiteAst.Replace _
215 | GrafiteAst.Reduce _
217 | GrafiteAst.Generalize _
220 | GrafiteAst.Decompose _ -> true
221 (* tactics like apply *)
224 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
225 (* let print_m name metasenv =
226 prerr_endline (">>>>> " ^ name);
227 prerr_endline (CicMetaSubst.ppmetasenv [] metasenv)
229 (* phase one calculates:
230 * new_goals_from_refine: goals added by refine
231 * head_goal: the first goal opened by ythe tactic
232 * other_goals: other goals opened by the tactic
234 let new_goals_from_refine = PEH.compare_metasenvs start refine in
235 let new_goals_from_tactic = PEH.compare_metasenvs refine tactic in
236 let head_goal, other_goals, goals =
238 | [] -> None,[],goals
240 (* assert (List.mem hd new_goals_from_tactic);
241 * invalidato dalla goal_tac
243 Some hd, List.filter ((<>) hd) new_goals_from_tactic, List.filter ((<>)
248 | None -> new_goals_from_refine @ other_goals
249 | Some x -> x :: new_goals_from_refine @ other_goals
251 (* extract the metas generated by refine and tactic *)
252 let metas_for_tactic_head =
255 | Some head_goal -> List.filter (fun (n,_,_) -> n = head_goal) tactic in
256 let metas_for_tactic_goals =
258 (fun x -> List.find (fun (metano,_,_) -> metano = x) tactic)
261 let metas_for_refine_goals =
262 List.filter (fun (n,_,_) -> List.mem n new_goals_from_refine) tactic in
263 let produced_metas, goals =
265 if always_opens_a_goal then
266 metas_for_tactic_head @ metas_for_refine_goals @
267 metas_for_tactic_goals
269 (* print_m "metas_for_refine_goals" metas_for_refine_goals;
270 print_m "metas_for_tactic_head" metas_for_tactic_head;
271 print_m "metas_for_tactic_goals" metas_for_tactic_goals; *)
272 metas_for_refine_goals @ metas_for_tactic_head @
273 metas_for_tactic_goals
276 let goals = List.map (fun (metano, _, _) -> metano) produced_metas in
277 produced_metas, goals
279 (* residual metas, preserving the original order *)
284 | (metano, _, _) :: tl when metano = e ->
285 [], List.map (fun (x,_,_) -> x) tl
286 | (metano, _, _) :: tl -> let b, a = split e tl in metano :: b, a
288 let find n metasenv =
290 Some (List.find (fun (metano, _, _) -> metano = n) metasenv)
291 with Not_found -> None
296 match find n tactic with
300 let before_l, after_l = split current_goal start in
302 List.filter (fun x -> not (List.mem x produced_goals)) before_l in
304 List.filter (fun x -> not (List.mem x produced_goals)) after_l in
305 let before = extract before_l in
306 let after = extract after_l in
310 print_m "BEGIN" start;
311 prerr_endline ("goal was: " ^ string_of_int current_goal);
312 prerr_endline ("and metas from refine are:");
314 (fun t -> prerr_string (" " ^ string_of_int t))
315 new_goals_from_refine;
317 print_m "before" before;
318 print_m "metas_for_tactic_head" metas_for_tactic_head;
319 print_m "metas_for_refine_goals" metas_for_refine_goals;
320 print_m "metas_for_tactic_goals" metas_for_tactic_goals;
321 print_m "produced_metas" produced_metas;
322 print_m "after" after;
323 |+ FINE DEBUG CODE +| *)
324 before @ produced_metas @ after, goals
326 let apply_tactic ~disambiguate_tactic (text,prefix_len,tactic) (status, goal) =
327 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
328 let before = List.map (fun g, _, _ -> g) starting_metasenv in
329 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
330 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
331 let proof = GrafiteTypes.get_current_proof status in
332 let proof_status = proof, goal in
333 let always_opens_a_goal = classify_tactic tactic in
334 let tactic = tactic_of_ast status tactic in
335 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
336 let after = ProofEngineTypes.goals_of_proof proof in
337 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
338 let proof, opened_goals =
339 let uri, metasenv_after_tactic, _subst, t, ty, attrs = proof in
340 let reordered_metasenv, opened_goals =
343 metasenv_after_refinement metasenv_after_tactic
344 opened goal always_opens_a_goal
346 let proof' = uri, reordered_metasenv, _subst, t, ty, attrs in
349 let incomplete_proof =
350 match status.GrafiteTypes.proof_status with
351 | GrafiteTypes.Incomplete_proof p -> p
354 { status with GrafiteTypes.proof_status =
355 GrafiteTypes.Incomplete_proof
356 { incomplete_proof with GrafiteTypes.proof = proof } },
357 opened_goals, closed_goals
359 let apply_atomic_tactical ~disambiguate_tactic ~patch (text,prefix_len,tactic) (status, goal) =
360 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
361 let before = List.map (fun g, _, _ -> g) starting_metasenv in
362 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
363 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
364 let proof = GrafiteTypes.get_current_proof status in
365 let proof_status = proof, goal in
366 let always_opens_a_goal = classify_tactic tactic in
367 let tactic = tactic_of_ast status tactic in
368 let tactic = patch tactic in
369 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
370 let after = ProofEngineTypes.goals_of_proof proof in
371 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
372 let proof, opened_goals =
373 let uri, metasenv_after_tactic, _subst, t, ty, attrs = proof in
374 let reordered_metasenv, opened_goals =
377 metasenv_after_refinement metasenv_after_tactic
378 opened goal always_opens_a_goal
380 let proof' = uri, reordered_metasenv, _subst, t, ty, attrs in
383 let incomplete_proof =
384 match status.GrafiteTypes.proof_status with
385 | GrafiteTypes.Incomplete_proof p -> p
388 { status with GrafiteTypes.proof_status =
389 GrafiteTypes.Incomplete_proof
390 { incomplete_proof with GrafiteTypes.proof = proof } },
391 opened_goals, closed_goals
394 'term 'lazy_term 'reduction 'obj 'ident.
396 (GrafiteTypes.status ->
397 ProofEngineTypes.goal ->
398 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
399 disambiguator_input ->
400 GrafiteTypes.status *
401 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
403 disambiguate_command:
404 (GrafiteTypes.status ->
405 (('term,'obj) GrafiteAst.command) disambiguator_input ->
406 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
409 (GrafiteTypes.status ->
410 (('term,'lazy_term) GrafiteAst.macro) disambiguator_input ->
411 Cic.context -> GrafiteTypes.status * (Cic.term,Cic.lazy_term) GrafiteAst.macro) ->
413 ?do_heavy_checks:bool ->
414 GrafiteTypes.status ->
415 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
416 disambiguator_input ->
417 GrafiteTypes.status * UriManager.uri list
420 type 'a eval_command =
422 disambiguate_command:
423 (GrafiteTypes.status -> (('term,'obj) GrafiteAst.command) disambiguator_input ->
424 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
425 options -> GrafiteTypes.status ->
426 (('term,'obj) GrafiteAst.command) disambiguator_input ->
427 GrafiteTypes.status * UriManager.uri list
430 type 'a eval_executable =
431 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
433 (GrafiteTypes.status ->
434 ProofEngineTypes.goal ->
435 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
436 disambiguator_input ->
437 GrafiteTypes.status *
438 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
440 disambiguate_command:
441 (GrafiteTypes.status ->
442 (('term,'obj) GrafiteAst.command) disambiguator_input ->
443 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
446 (GrafiteTypes.status ->
447 (('term,'lazy_term) GrafiteAst.macro) disambiguator_input ->
448 Cic.context -> GrafiteTypes.status * (Cic.term,Cic.lazy_term) GrafiteAst.macro) ->
451 GrafiteTypes.status ->
452 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
453 GrafiteTypes.status * UriManager.uri list
456 type 'a eval_from_moo =
457 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
459 let coercion_moo_statement_of (uri,arity, saturations,_) =
461 (HExtlib.dummy_floc, CicUtil.term_of_uri uri, false, arity, saturations)
463 let refinement_toolkit = {
464 RefinementTool.type_of_aux' =
465 (fun ?localization_tbl e c t u ->
466 let saved = !CicRefine.insert_coercions in
467 CicRefine.insert_coercions:= false;
470 let t, ty, metasenv, ugraph =
471 CicRefine.type_of_aux' ?localization_tbl e c t u in
472 RefinementTool.Success (t, ty, metasenv, ugraph)
474 | CicRefine.RefineFailure s
475 | CicRefine.Uncertain s
476 | CicRefine.AssertFailure s -> RefinementTool.Exception s
478 CicRefine.insert_coercions := saved;
480 RefinementTool.ppsubst = CicMetaSubst.ppsubst;
481 RefinementTool.apply_subst = CicMetaSubst.apply_subst;
482 RefinementTool.ppmetasenv = CicMetaSubst.ppmetasenv;
483 RefinementTool.pack_coercion_obj = CicRefine.pack_coercion_obj;
486 let eval_coercion status ~add_composites uri arity saturations =
488 try CicUtil.uri_of_term uri
489 with Invalid_argument _ ->
490 raise (Invalid_argument "coercion can only be constants/constructors")
492 let status,compounds =
493 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri arity
494 saturations (GrafiteTypes.get_baseuri status)
497 List.map coercion_moo_statement_of ((uri,arity,saturations,0)::compounds)
499 let status = GrafiteTypes.add_moo_content moo_content status in
500 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
501 List.map (fun u,_,_,_ -> u) compounds
503 module MatitaStatus =
505 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
508 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
510 type tactic = input_status -> output_status
512 let mk_tactic tac = tac
513 let apply_tactic tac = tac
514 let goals (_, opened, closed) = opened, closed
515 let get_stack (status, _) = GrafiteTypes.get_stack status
517 let set_stack stack (status, opened, closed) =
518 GrafiteTypes.set_stack stack status, opened, closed
520 let inject (status, _) = (status, [], [])
521 let focus goal (status, _, _) = (status, goal)
524 module MatitaTacticals = Continuationals.Make(MatitaStatus)
526 let tactic_of_ast' tac =
527 MatitaTacticals.Tactical (MatitaTacticals.Tactic (MatitaStatus.mk_tactic tac))
529 let punctuation_tactical_of_ast (text,prefix_len,punct) =
531 | GrafiteAst.Dot _loc -> MatitaTacticals.Dot
532 | GrafiteAst.Semicolon _loc -> MatitaTacticals.Semicolon
533 | GrafiteAst.Branch _loc -> MatitaTacticals.Branch
534 | GrafiteAst.Shift _loc -> MatitaTacticals.Shift
535 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.Pos i
536 | GrafiteAst.Merge _loc -> MatitaTacticals.Merge
537 | GrafiteAst.Wildcard _loc -> MatitaTacticals.Wildcard
539 let non_punctuation_tactical_of_ast (text,prefix_len,punct) =
541 | GrafiteAst.Focus (_loc,goals) -> MatitaTacticals.Focus goals
542 | GrafiteAst.Unfocus _loc -> MatitaTacticals.Unfocus
543 | GrafiteAst.Skip _loc -> MatitaTacticals.Tactical MatitaTacticals.Skip
545 let eval_tactical status tac =
546 let status, _, _ = MatitaTacticals.eval tac (status, ~-1) in
547 let status = (* is proof completed? *)
548 match status.GrafiteTypes.proof_status with
549 | GrafiteTypes.Incomplete_proof
550 { GrafiteTypes.stack = stack; proof = proof }
551 when Continuationals.Stack.is_empty stack ->
552 { status with GrafiteTypes.proof_status = GrafiteTypes.Proof proof }
557 let eval_comment status c = status
559 (* since the record syntax allows to declare coercions, we have to put this
560 * information inside the moo *)
561 let add_coercions_of_record_to_moo obj lemmas status =
562 let attributes = CicUtil.attributes_of_obj obj in
563 let is_record = function `Class (`Record att) -> Some att | _-> None in
564 match HExtlib.list_findopt is_record attributes with
567 let is_a_coercion uri =
570 CicEnvironment.get_cooked_obj CicUniv.oblivion_ugraph uri in
571 let attrs = CicUtil.attributes_of_obj obj in
574 (function `Class (`Coercion _) -> true | _-> false) attrs
575 with `Class (`Coercion n) -> true,n | _ -> assert false
576 with Not_found -> false,0
577 with Not_found -> assert false
579 let buri = GrafiteTypes.get_baseuri status in
580 (* looking at the fields we can know the 'wanted' coercions, but not the
581 * actually generated ones. So, only the intersection between the wanted
582 * and the actual should be in the moo as coercion, while everithing in
583 * lemmas should go as aliases *)
584 let wanted_coercions =
587 | (name,true,arity) ->
589 (arity, UriManager.uri_of_string (buri ^ "/" ^ name ^ ".con" ))
593 (*prerr_endline "wanted coercions:";
595 (fun u -> prerr_endline (UriManager.string_of_uri u))
597 let coercions, moo_content =
601 let is_a_wanted_coercion,arity_wanted =
604 List.find (fun (n,u) -> UriManager.eq u uri)
608 with Not_found -> false, 0
610 let is_a_coercion, arity_coercion = is_a_coercion uri in
611 if is_a_coercion then
612 Some (uri, coercion_moo_statement_of (uri,arity_coercion,0,0))
613 else if is_a_wanted_coercion then
614 Some (uri, coercion_moo_statement_of (uri,arity_wanted,0,0))
619 (*prerr_endline "actual coercions:";
621 (fun u -> prerr_endline (UriManager.string_of_uri u))
623 prerr_endline "lemmas was:";
625 (fun u -> prerr_endline (UriManager.string_of_uri u))
627 let status = GrafiteTypes.add_moo_content moo_content status in
629 GrafiteTypes.coercions = coercions @ status.GrafiteTypes.coercions},
632 let add_obj uri obj status =
633 let status,lemmas = GrafiteSync.add_obj refinement_toolkit uri obj status in
636 let rec eval_command = {ec_go = fun ~disambiguate_command opts status
637 (text,prefix_len,cmd) ->
638 let status,cmd = disambiguate_command status (text,prefix_len,cmd) in
641 | GrafiteAst.Index (loc,None,uri) ->
642 assert false (* TODO: for user input *)
643 | GrafiteAst.Index (loc,Some key,uri) ->
644 let universe = Universe.index
645 status.GrafiteTypes.universe key (CicUtil.term_of_uri uri) in
646 let status = {status with GrafiteTypes.universe = universe} in
649 let candidates = Universe.get_candidates status.GrafiteTypes.universe key in
650 ("candidates for " ^ (CicPp.ppterm key) ^ " = " ^
651 (String.concat "\n" (List.map CicPp.ppterm candidates)))
655 let status = GrafiteTypes.add_moo_content [cmd] status in
657 | GrafiteAst.Coercion (loc, uri, add_composites, arity, saturations) ->
658 eval_coercion status ~add_composites uri arity saturations
659 | GrafiteAst.Default (loc, what, uris) as cmd ->
660 LibraryObjects.set_default what uris;
661 GrafiteTypes.add_moo_content [cmd] status,[]
662 | GrafiteAst.Drop loc -> raise Drop
663 | GrafiteAst.Include (loc, baseuri) ->
664 let moopath_rw, moopath_r =
665 LibraryMisc.obj_file_of_baseuri
666 ~must_exist:false ~baseuri ~writable:true,
667 LibraryMisc.obj_file_of_baseuri
668 ~must_exist:false ~baseuri ~writable:false
671 if Sys.file_exists moopath_r then moopath_r else
672 if Sys.file_exists moopath_rw then moopath_rw else
673 raise (IncludedFileNotCompiled (moopath_rw,baseuri))
675 let status = eval_from_moo.efm_go status moopath in
677 let lt_uri = UriManager.uri_of_string "cic:/matita/nat/orders/lt.con" in
678 let nat_uri = UriManager.uri_of_string "cic:/matita/nat/nat/nat.ind" in
679 let nat = Cic.MutInd(nat_uri,0,[]) in
680 let zero = Cic.MutConstruct(nat_uri,0,1,[]) in
681 let succ = Cic.MutConstruct(nat_uri,0,2,[]) in
682 let fake= Cic.Meta(-1,[]) in
683 let term= Cic.Appl [Cic.Const (lt_uri,[]);zero;Cic.Appl[succ;zero]] in let msg =
684 let candidates = Universe.get_candidates status.GrafiteTypes.universe term in
685 ("candidates for " ^ (CicPp.ppterm term) ^ " = " ^
686 (String.concat "\n" (List.map CicPp.ppterm candidates)))
691 | GrafiteAst.Print (_,"proofterm") ->
692 let _,_,_,p,_, _ = GrafiteTypes.get_current_proof status in
693 prerr_endline (Auto.pp_proofterm (Lazy.force p));
695 | GrafiteAst.Print (_,_) -> status,[]
696 | GrafiteAst.Qed loc ->
697 let uri, metasenv, _subst, bo, ty, attrs =
698 match status.GrafiteTypes.proof_status with
699 | GrafiteTypes.Proof (Some uri, metasenv, subst, body, ty, attrs) ->
700 uri, metasenv, subst, body, ty, attrs
701 | GrafiteTypes.Proof (None, metasenv, subst, body, ty, attrs) ->
702 raise (GrafiteTypes.Command_error
703 ("Someone allows to start a theorem without giving the "^
704 "name/uri. This should be fixed!"))
707 (GrafiteTypes.Command_error "You can't Qed an incomplete theorem")
709 if metasenv <> [] then
711 (GrafiteTypes.Command_error
712 "Proof not completed! metasenv is not empty!");
713 let name = UriManager.name_of_uri uri in
714 let obj = Cic.Constant (name,Some (Lazy.force bo),ty,[],attrs) in
715 let status, lemmas = add_obj uri obj status in
717 GrafiteTypes.proof_status = GrafiteTypes.No_proof},
718 (*CSC: I throw away the arities *)
720 | GrafiteAst.Relation (loc, id, a, aeq, refl, sym, trans) ->
721 Setoids.add_relation id a aeq refl sym trans;
722 status, [] (*CSC: TO BE FIXED *)
723 | GrafiteAst.Set (loc, name, value) -> status, []
724 (* GrafiteTypes.set_option status name value,[] *)
725 | GrafiteAst.Obj (loc,obj) ->
728 Cic.Constant (name,_,_,_,_)
729 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
730 | Cic.InductiveDefinition (types,_,_,_) ->
732 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
733 | _ -> assert false in
734 let buri = GrafiteTypes.get_baseuri status in
735 let uri = UriManager.uri_of_string (buri ^ "/" ^ name ^ ext) in
736 let obj = CicRefine.pack_coercion_obj obj in
737 let metasenv = GrafiteTypes.get_proof_metasenv status in
739 | Cic.CurrentProof (_,metasenv',bo,ty,_, attrs) ->
740 let name = UriManager.name_of_uri uri in
741 if not(CicPp.check name ty) then
742 HLog.warn ("Bad name: " ^ name);
743 if opts.do_heavy_checks then
745 let dbd = LibraryDb.instance () in
746 let similar = Whelp.match_term ~dbd ty in
747 let similar_len = List.length similar in
748 if similar_len> 30 then
750 ("Duplicate check will compare your theorem with " ^
751 string_of_int similar_len ^
752 " theorems, this may take a while."));
756 let t = CicUtil.term_of_uri u in
758 CicTypeChecker.type_of_aux'
759 metasenv' [] t CicUniv.oblivion_ugraph
761 fst(CicReduction.are_convertible [] ty' ty g))
764 (match convertible with
768 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
769 "\nPlease use a variant."));
772 let initial_proof = (Some uri, metasenv', _subst, lazy bo, ty, attrs) in
773 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
774 { status with GrafiteTypes.proof_status =
775 GrafiteTypes.Incomplete_proof
776 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
779 if metasenv <> [] then
780 raise (GrafiteTypes.Command_error (
781 "metasenv not empty while giving a definition with body: " ^
782 CicMetaSubst.ppmetasenv [] metasenv));
783 let status, lemmas = add_obj uri obj status in
784 let status,new_lemmas =
785 add_coercions_of_record_to_moo obj lemmas status
787 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
788 uri::new_lemmas@lemmas
790 match status.GrafiteTypes.proof_status with
791 GrafiteTypes.Intermediate _ ->
792 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
795 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
796 ~disambiguate_macro opts status (text,prefix_len,ex) ->
798 | GrafiteAst.Tactic (_(*loc*), Some tac, punct) ->
799 let tac = apply_tactic ~disambiguate_tactic (text,prefix_len,tac) in
800 let status = eval_tactical status (tactic_of_ast' tac) in
801 (* CALL auto on every goal, easy way of testing it
804 (loc, ([],["depth","2";"timeout","1";"type","1"])) in
806 let auto = apply_tactic ~disambiguate_tactic ("",0,auto) in
807 let _ = eval_tactical status (tactic_of_ast' auto) in
808 print_endline "GOOD"; ()
809 with ProofEngineTypes.Fail _ -> print_endline "BAD" | _ -> ());*)
811 (punctuation_tactical_of_ast (text,prefix_len,punct)),[]
812 | GrafiteAst.Tactic (_, None, punct) ->
814 (punctuation_tactical_of_ast (text,prefix_len,punct)),[]
815 | GrafiteAst.NonPunctuationTactical (_, tac, punct) ->
818 (non_punctuation_tactical_of_ast (text,prefix_len,tac))
821 (punctuation_tactical_of_ast (text,prefix_len,punct)),[]
822 | GrafiteAst.Command (_, cmd) ->
823 eval_command.ec_go ~disambiguate_command opts status (text,prefix_len,cmd)
824 | GrafiteAst.Macro (loc, macro) ->
825 raise (Macro (loc,disambiguate_macro status (text,prefix_len,macro)))
827 } and eval_from_moo = {efm_go = fun status fname ->
829 ("",0,GrafiteAst.Executable (HExtlib.dummy_floc,
830 GrafiteAst.Command (HExtlib.dummy_floc,
833 let moo = GrafiteMarshal.load_moo fname in
836 let ast = ast_of_cmd ast in
839 ~disambiguate_tactic:(fun status _ (_,_,tactic) -> status,tactic)
840 ~disambiguate_command:(fun status (_,_,cmd) -> status,cmd)
841 ~disambiguate_macro:(fun _ _ -> assert false)
847 } and eval_ast = {ea_go = fun ~disambiguate_tactic ~disambiguate_command
848 ~disambiguate_macro ?(do_heavy_checks=false) status
851 let opts = { do_heavy_checks = do_heavy_checks ; } in
853 | GrafiteAst.Executable (_,ex) ->
854 eval_executable.ee_go ~disambiguate_tactic ~disambiguate_command
855 ~disambiguate_macro opts status (text,prefix_len,ex)
856 | GrafiteAst.Comment (_,c) -> eval_comment status (text,prefix_len,c),[]
859 let eval_ast = eval_ast.ea_go