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/
31 (* mo file name, ma file name *)
32 exception IncludedFileNotCompiled of string * string
35 (Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro)
36 exception ReadOnlyUri of string
38 type 'a disambiguator_input = string * int * 'a
41 do_heavy_checks: bool ;
45 (** create a ProofEngineTypes.mk_fresh_name_type function which uses given
46 * names as long as they are available, then it fallbacks to name generation
47 * using FreshNamesGenerator module *)
49 let len = List.length names in
51 fun metasenv context name ~typ ->
52 if !count < len then begin
53 let name = Cic.Name (List.nth names !count) in
57 FreshNamesGenerator.mk_fresh_name ~subst:[] metasenv context name ~typ
59 let tactic_of_ast ast =
60 let module PET = ProofEngineTypes in
62 | GrafiteAst.Absurd (_, term) -> Tactics.absurd term
63 | GrafiteAst.Apply (_, term) -> Tactics.apply term
64 | GrafiteAst.ApplyS (_, term) ->
65 Tactics.applyS ~term ~dbd:(LibraryDb.instance ())
66 | GrafiteAst.Assumption _ -> Tactics.assumption
67 | GrafiteAst.Auto (_,params) ->
68 AutoTactic.auto_tac ~params ~dbd:(LibraryDb.instance ())
69 | GrafiteAst.Change (_, pattern, with_what) ->
70 Tactics.change ~pattern with_what
71 | GrafiteAst.Clear (_,id) -> Tactics.clear id
72 | GrafiteAst.ClearBody (_,id) -> Tactics.clearbody id
73 | GrafiteAst.Contradiction _ -> Tactics.contradiction
74 | GrafiteAst.Constructor (_, n) -> Tactics.constructor n
75 | GrafiteAst.Cut (_, ident, term) ->
76 let names = match ident with None -> [] | Some id -> [id] in
77 Tactics.cut ~mk_fresh_name_callback:(namer_of names) term
78 | GrafiteAst.Decompose (_, types, what, names) ->
79 let to_type = function
80 | GrafiteAst.Type (uri, typeno) -> uri, typeno
81 | GrafiteAst.Ident _ -> assert false
83 let user_types = List.rev_map to_type types in
84 let dbd = LibraryDb.instance () in
85 let mk_fresh_name_callback = namer_of names in
86 Tactics.decompose ~mk_fresh_name_callback ~dbd ~user_types ?what
87 | GrafiteAst.Demodulate _ -> Tactics.demodulate ~dbd:(LibraryDb.instance ())
88 | GrafiteAst.Discriminate (_,term) -> Tactics.discriminate term
89 | GrafiteAst.Elim (_, what, using, depth, names) ->
90 Tactics.elim_intros ?using ?depth ~mk_fresh_name_callback:(namer_of names)
92 | GrafiteAst.ElimType (_, what, using, depth, names) ->
93 Tactics.elim_type ?using ?depth ~mk_fresh_name_callback:(namer_of names)
95 | GrafiteAst.Exact (_, term) -> Tactics.exact term
96 | GrafiteAst.Exists _ -> Tactics.exists
97 | GrafiteAst.Fail _ -> Tactics.fail
98 | GrafiteAst.Fold (_, reduction_kind, term, pattern) ->
100 match reduction_kind with
102 PET.const_lazy_reduction
103 (CicReduction.normalize ~delta:false ~subst:[])
104 | `Reduce -> PET.const_lazy_reduction ProofEngineReduction.reduce
105 | `Simpl -> PET.const_lazy_reduction ProofEngineReduction.simpl
107 PET.const_lazy_reduction (ProofEngineReduction.unfold ?what:None)
108 | `Unfold (Some lazy_term) ->
109 (fun context metasenv ugraph ->
110 let what, metasenv, ugraph = lazy_term context metasenv ugraph in
111 ProofEngineReduction.unfold ~what, metasenv, ugraph)
113 PET.const_lazy_reduction (CicReduction.whd ~delta:false ~subst:[])
115 Tactics.fold ~reduction ~term ~pattern
116 | GrafiteAst.Fourier _ -> Tactics.fourier
117 | GrafiteAst.FwdSimpl (_, hyp, names) ->
118 Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names)
119 ~dbd:(LibraryDb.instance ()) hyp
120 | GrafiteAst.Generalize (_,pattern,ident) ->
121 let names = match ident with None -> [] | Some id -> [id] in
122 Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern
123 | GrafiteAst.Goal (_, n) -> Tactics.set_goal n
124 | GrafiteAst.IdTac _ -> Tactics.id
125 | GrafiteAst.Injection (_,term) -> Tactics.injection term
126 | GrafiteAst.Intros (_, None, names) ->
127 PrimitiveTactics.intros_tac ~mk_fresh_name_callback:(namer_of names) ()
128 | GrafiteAst.Intros (_, Some num, names) ->
129 PrimitiveTactics.intros_tac ~howmany:num
130 ~mk_fresh_name_callback:(namer_of names) ()
131 | GrafiteAst.Inversion (_, term) ->
132 Tactics.inversion term
133 | GrafiteAst.LApply (_, linear, how_many, to_what, what, ident) ->
134 let names = match ident with None -> [] | Some id -> [id] in
135 Tactics.lapply ~mk_fresh_name_callback:(namer_of names)
136 ~linear ?how_many ~to_what what
137 | GrafiteAst.Left _ -> Tactics.left
138 | GrafiteAst.LetIn (loc,term,name) ->
139 Tactics.letin term ~mk_fresh_name_callback:(namer_of [name])
140 | GrafiteAst.Reduce (_, reduction_kind, pattern) ->
141 (match reduction_kind with
142 | `Normalize -> Tactics.normalize ~pattern
143 | `Reduce -> Tactics.reduce ~pattern
144 | `Simpl -> Tactics.simpl ~pattern
145 | `Unfold what -> Tactics.unfold ~pattern what
146 | `Whd -> Tactics.whd ~pattern)
147 | GrafiteAst.Reflexivity _ -> Tactics.reflexivity
148 | GrafiteAst.Replace (_, pattern, with_what) ->
149 Tactics.replace ~pattern ~with_what
150 | GrafiteAst.Rewrite (_, direction, t, pattern) ->
151 EqualityTactics.rewrite_tac ~direction ~pattern t
152 | GrafiteAst.Right _ -> Tactics.right
153 | GrafiteAst.Ring _ -> Tactics.ring
154 | GrafiteAst.Split _ -> Tactics.split
155 | GrafiteAst.Subst _ -> Tactics.subst
156 | GrafiteAst.Symmetry _ -> Tactics.symmetry
157 | GrafiteAst.Transitivity (_, term) -> Tactics.transitivity term
158 (* Implementazioni Aggiunte *)
159 | GrafiteAst.Assume (_, id, t) -> Declarative.assume id t
160 | GrafiteAst.Suppose (_, t, id, t1) -> Declarative.suppose t id t1
161 | GrafiteAst.By_term_we_proved (_, t, ty, id, t1) ->
162 Declarative.by_term_we_proved ~dbd:(LibraryDb.instance()) t ty id t1
163 | GrafiteAst.We_need_to_prove (_, t, id, t2) ->
164 Declarative.we_need_to_prove t id t2
165 | GrafiteAst.Bydone (_, t) -> Declarative.bydone ~dbd:(LibraryDb.instance()) t
166 | GrafiteAst.We_proceed_by_induction_on (_, t, t1) ->
167 Declarative.we_proceed_by_induction_on t t1
168 | GrafiteAst.Byinduction (_, t, id) -> Declarative.byinduction t id
169 | GrafiteAst.Thesisbecomes (_, t) -> Declarative.thesisbecomes t
170 | GrafiteAst.ExistsElim (_, t, id1, t1, id2, t2) ->
171 Declarative.existselim t id1 t1 id2 t2
172 | GrafiteAst.Case (_,id,params) -> Declarative.case id params
173 | GrafiteAst.AndElim(_,t,id1,t1,id2,t2) -> Declarative.andelim t id1 t1 id2 t2
174 | GrafiteAst.RewritingStep (_,termine,t1,t2,cont) ->
175 Declarative.rewritingstep ~dbd:(LibraryDb.instance ()) termine t1 t2 cont
177 let classify_tactic tactic =
179 (* tactics that can't close the goal (return a goal we want to "select") *)
180 | GrafiteAst.Rewrite _
182 | GrafiteAst.Replace _
183 | GrafiteAst.Reduce _
184 | GrafiteAst.Injection _
186 | GrafiteAst.Generalize _
189 | GrafiteAst.Decompose _ -> true, true
190 (* tactics we don't want to reorder goals. I think only Goal needs this. *)
191 | GrafiteAst.Goal _ -> false, true
192 (* tactics like apply *)
195 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
196 let module PEH = ProofEngineHelpers in
197 (* let print_m name metasenv =
198 prerr_endline (">>>>> " ^ name);
199 prerr_endline (CicMetaSubst.ppmetasenv [] metasenv)
201 (* phase one calculates:
202 * new_goals_from_refine: goals added by refine
203 * head_goal: the first goal opened by ythe tactic
204 * other_goals: other goals opened by the tactic
206 let new_goals_from_refine = PEH.compare_metasenvs start refine in
207 let new_goals_from_tactic = PEH.compare_metasenvs refine tactic in
208 let head_goal, other_goals, goals =
210 | [] -> None,[],goals
212 (* assert (List.mem hd new_goals_from_tactic);
213 * invalidato dalla goal_tac
215 Some hd, List.filter ((<>) hd) new_goals_from_tactic, List.filter ((<>)
220 | None -> new_goals_from_refine @ other_goals
221 | Some x -> x :: new_goals_from_refine @ other_goals
223 (* extract the metas generated by refine and tactic *)
224 let metas_for_tactic_head =
227 | Some head_goal -> List.filter (fun (n,_,_) -> n = head_goal) tactic in
228 let metas_for_tactic_goals =
230 (fun x -> List.find (fun (metano,_,_) -> metano = x) tactic)
233 let metas_for_refine_goals =
234 List.filter (fun (n,_,_) -> List.mem n new_goals_from_refine) tactic in
235 let produced_metas, goals =
237 if always_opens_a_goal then
238 metas_for_tactic_head @ metas_for_refine_goals @
239 metas_for_tactic_goals
241 (* print_m "metas_for_refine_goals" metas_for_refine_goals;
242 print_m "metas_for_tactic_head" metas_for_tactic_head;
243 print_m "metas_for_tactic_goals" metas_for_tactic_goals; *)
244 metas_for_refine_goals @ metas_for_tactic_head @
245 metas_for_tactic_goals
248 let goals = List.map (fun (metano, _, _) -> metano) produced_metas in
249 produced_metas, goals
251 (* residual metas, preserving the original order *)
256 | (metano, _, _) :: tl when metano = e ->
257 [], List.map (fun (x,_,_) -> x) tl
258 | (metano, _, _) :: tl -> let b, a = split e tl in metano :: b, a
260 let find n metasenv =
262 Some (List.find (fun (metano, _, _) -> metano = n) metasenv)
263 with Not_found -> None
268 match find n tactic with
272 let before_l, after_l = split current_goal start in
274 List.filter (fun x -> not (List.mem x produced_goals)) before_l in
276 List.filter (fun x -> not (List.mem x produced_goals)) after_l in
277 let before = extract before_l in
278 let after = extract after_l in
282 print_m "BEGIN" start;
283 prerr_endline ("goal was: " ^ string_of_int current_goal);
284 prerr_endline ("and metas from refine are:");
286 (fun t -> prerr_string (" " ^ string_of_int t))
287 new_goals_from_refine;
289 print_m "before" before;
290 print_m "metas_for_tactic_head" metas_for_tactic_head;
291 print_m "metas_for_refine_goals" metas_for_refine_goals;
292 print_m "metas_for_tactic_goals" metas_for_tactic_goals;
293 print_m "produced_metas" produced_metas;
294 print_m "after" after;
295 |+ FINE DEBUG CODE +| *)
296 before @ produced_metas @ after, goals
298 let apply_tactic ~disambiguate_tactic (text,prefix_len,tactic) (status, goal) =
299 (* prerr_endline "apply_tactic"; *)
300 (* prerr_endline (Continuationals.Stack.pp (GrafiteTypes.get_stack status)); *)
301 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
302 let before = List.map (fun g, _, _ -> g) starting_metasenv in
303 (* prerr_endline "disambiguate"; *)
304 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
305 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
306 let proof = GrafiteTypes.get_current_proof status in
307 let proof_status = proof, goal in
308 let needs_reordering, always_opens_a_goal = classify_tactic tactic in
309 let tactic = tactic_of_ast tactic in
310 (* apply tactic will change the lexicon_status ... *)
311 (* prerr_endline "apply_tactic bassa"; *)
312 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
313 let after = ProofEngineTypes.goals_of_proof proof in
314 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
315 (* prerr_endline("before: " ^ String.concat ", " (List.map string_of_int before));
316 prerr_endline("after: " ^ String.concat ", " (List.map string_of_int after));
317 prerr_endline("opened: " ^ String.concat ", " (List.map string_of_int opened)); *)
318 (* prerr_endline("opened_goals: " ^ String.concat ", " (List.map string_of_int opened_goals));
319 prerr_endline("closed_goals: " ^ String.concat ", " (List.map string_of_int closed_goals)); *)
320 let proof, opened_goals =
321 if needs_reordering then begin
322 let uri, metasenv_after_tactic, t, ty = proof in
323 (* prerr_endline ("goal prima del riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof))); *)
324 let reordered_metasenv, opened_goals =
327 metasenv_after_refinement metasenv_after_tactic
328 opened goal always_opens_a_goal
330 let proof' = uri, reordered_metasenv, t, ty in
331 (* prerr_endline ("goal dopo il riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof'))); *)
337 let incomplete_proof =
338 match status.GrafiteTypes.proof_status with
339 | GrafiteTypes.Incomplete_proof p -> p
342 { status with GrafiteTypes.proof_status =
343 GrafiteTypes.Incomplete_proof
344 { incomplete_proof with GrafiteTypes.proof = proof } },
345 opened_goals, closed_goals
349 'term 'lazy_term 'reduction 'obj 'ident.
351 (GrafiteTypes.status ->
352 ProofEngineTypes.goal ->
353 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
354 disambiguator_input ->
355 GrafiteTypes.status *
356 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
358 disambiguate_command:
359 (GrafiteTypes.status ->
360 ('obj GrafiteAst.command) disambiguator_input ->
361 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
364 (GrafiteTypes.status ->
365 ('term GrafiteAst.macro) disambiguator_input ->
366 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
368 ?do_heavy_checks:bool ->
369 ?clean_baseuri:bool ->
370 GrafiteTypes.status ->
371 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
372 disambiguator_input ->
373 GrafiteTypes.status * UriManager.uri list
376 type 'a eval_command =
378 disambiguate_command:
379 (GrafiteTypes.status -> ('obj GrafiteAst.command) disambiguator_input ->
380 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
381 options -> GrafiteTypes.status ->
382 ('obj GrafiteAst.command) disambiguator_input ->
383 GrafiteTypes.status * UriManager.uri list
386 type 'a eval_executable =
387 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
389 (GrafiteTypes.status ->
390 ProofEngineTypes.goal ->
391 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
392 disambiguator_input ->
393 GrafiteTypes.status *
394 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
396 disambiguate_command:
397 (GrafiteTypes.status ->
398 ('obj GrafiteAst.command) disambiguator_input ->
399 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
402 (GrafiteTypes.status ->
403 ('term GrafiteAst.macro) disambiguator_input ->
404 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
407 GrafiteTypes.status ->
408 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
409 GrafiteTypes.status * UriManager.uri list
412 type 'a eval_from_moo =
413 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
415 let coercion_moo_statement_of uri =
416 GrafiteAst.Coercion (HExtlib.dummy_floc, uri, false)
418 let refinement_toolkit = {
419 RefinementTool.type_of_aux' =
420 (fun ?localization_tbl e c t u ->
421 let saved = !CicRefine.insert_coercions in
422 CicRefine.insert_coercions:= false;
425 let t, ty, metasenv, ugraph =
426 CicRefine.type_of_aux' ?localization_tbl e c t u in
427 RefinementTool.Success (t, ty, metasenv, ugraph)
429 | CicRefine.RefineFailure s
430 | CicRefine.Uncertain s
431 | CicRefine.AssertFailure s -> RefinementTool.Exception s
433 CicRefine.insert_coercions := saved;
435 RefinementTool.ppsubst = CicMetaSubst.ppsubst;
436 RefinementTool.apply_subst = CicMetaSubst.apply_subst;
437 RefinementTool.ppmetasenv = CicMetaSubst.ppmetasenv;
438 RefinementTool.pack_coercion_obj = CicRefine.pack_coercion_obj;
441 let eval_coercion status ~add_composites uri =
442 let status,compounds =
443 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri in
445 List.map coercion_moo_statement_of (uri::compounds)
447 let status = GrafiteTypes.add_moo_content moo_content status in
448 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
451 let eval_tactical ~disambiguate_tactic status tac =
452 let apply_tactic = apply_tactic ~disambiguate_tactic in
453 let module MatitaStatus =
455 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
458 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
460 type tactic = input_status -> output_status
462 let id_tactic = apply_tactic ("",0,(GrafiteAst.IdTac HExtlib.dummy_floc))
463 let mk_tactic tac = tac
464 let apply_tactic tac = tac
465 let goals (_, opened, closed) = opened, closed
466 let set_goals (opened, closed) (status, _, _) = (status, opened, closed)
467 let get_stack (status, _) = GrafiteTypes.get_stack status
469 let set_stack stack (status, opened, closed) =
470 GrafiteTypes.set_stack stack status, opened, closed
472 let inject (status, _) = (status, [], [])
473 let focus goal (status, _, _) = (status, goal)
476 let module MatitaTacticals = Tacticals.Make (MatitaStatus) in
477 let rec tactical_of_ast l (text,prefix_len,tac) =
478 let apply_tactic t = apply_tactic (text, prefix_len, t) in
479 let tactical_of_ast l t = tactical_of_ast l (text,prefix_len,t) in
481 | GrafiteAst.Tactic (loc, tactic) ->
482 MatitaTacticals.tactic (MatitaStatus.mk_tactic (apply_tactic tactic))
483 | GrafiteAst.Seq (loc, tacticals) -> (* tac1; tac2; ... *)
485 MatitaTacticals.seq ~tactics:(List.map (tactical_of_ast (l+1)) tacticals)
486 | GrafiteAst.Do (loc, n, tactical) ->
487 MatitaTacticals.do_tactic ~n ~tactic:(tactical_of_ast (l+1) tactical)
488 | GrafiteAst.Repeat (loc, tactical) ->
489 MatitaTacticals.repeat_tactic ~tactic:(tactical_of_ast (l+1) tactical)
490 | GrafiteAst.Then (loc, tactical, tacticals) -> (* tac; [ tac1 | ... ] *)
492 MatitaTacticals.thens ~start:(tactical_of_ast (l+1) tactical)
493 ~continuations:(List.map (tactical_of_ast (l+1)) tacticals)
494 | GrafiteAst.First (loc, tacticals) ->
495 MatitaTacticals.first
496 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
497 | GrafiteAst.Try (loc, tactical) ->
498 MatitaTacticals.try_tactic ~tactic:(tactical_of_ast (l+1) tactical)
499 | GrafiteAst.Solve (loc, tacticals) ->
500 MatitaTacticals.solve_tactics
501 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
503 | GrafiteAst.Skip _loc -> MatitaTacticals.skip
504 | GrafiteAst.Dot _loc -> MatitaTacticals.dot
505 | GrafiteAst.Semicolon _loc -> MatitaTacticals.semicolon
506 | GrafiteAst.Branch _loc -> MatitaTacticals.branch
507 | GrafiteAst.Shift _loc -> MatitaTacticals.shift
508 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.pos i
509 | GrafiteAst.Merge _loc -> MatitaTacticals.merge
510 | GrafiteAst.Focus (_loc, goals) -> MatitaTacticals.focus goals
511 | GrafiteAst.Unfocus _loc -> MatitaTacticals.unfocus
512 | GrafiteAst.Wildcard _loc -> MatitaTacticals.wildcard
514 let status, _, _ = tactical_of_ast 0 tac (status, ~-1) in
515 let status = (* is proof completed? *)
516 match status.GrafiteTypes.proof_status with
517 | GrafiteTypes.Incomplete_proof
518 { GrafiteTypes.stack = stack; proof = proof }
519 when Continuationals.Stack.is_empty stack ->
520 { status with GrafiteTypes.proof_status = GrafiteTypes.Proof proof }
525 let eval_comment status c = status
527 (* since the record syntax allows to declare coercions, we have to put this
528 * information inside the moo *)
529 let add_coercions_of_record_to_moo obj lemmas status =
530 let attributes = CicUtil.attributes_of_obj obj in
531 let is_record = function `Class (`Record att) -> Some att | _-> None in
532 match HExtlib.list_findopt is_record attributes with
535 let is_a_coercion uri =
538 CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri in
539 let attrs = CicUtil.attributes_of_obj obj in
540 List.mem (`Class `Coercion) attrs
541 with Not_found -> assert false
543 (* looking at the fields we can know the 'wanted' coercions, but not the
544 * actually generated ones. So, only the intersection between the wanted
545 * and the actual should be in the moo as coercion, while everithing in
546 * lemmas should go as aliases *)
547 let wanted_coercions =
552 (UriManager.uri_of_string
553 (GrafiteTypes.qualify status name ^ ".con"))
557 (*prerr_endline "wanted coercions:";
559 (fun u -> prerr_endline (UriManager.string_of_uri u))
561 let coercions, moo_content =
565 let is_a_wanted_coercion =
566 List.exists (UriManager.eq uri) wanted_coercions
568 if is_a_coercion uri || is_a_wanted_coercion then
569 Some (uri, coercion_moo_statement_of uri)
574 (*prerr_endline "actual coercions:";
576 (fun u -> prerr_endline (UriManager.string_of_uri u))
578 prerr_endline "lemmas was:";
580 (fun u -> prerr_endline (UriManager.string_of_uri u))
582 let status = GrafiteTypes.add_moo_content moo_content status in
584 GrafiteTypes.coercions = coercions @ status.GrafiteTypes.coercions},
587 let add_obj uri obj status =
588 let status,lemmas = GrafiteSync.add_obj refinement_toolkit uri obj status in
591 let rec eval_command = {ec_go = fun ~disambiguate_command opts status
592 (text,prefix_len,cmd) ->
593 let status,cmd = disambiguate_command status (text,prefix_len,cmd) in
596 | GrafiteAst.Print (_,"proofterm") ->
597 let _,_,p,_ = GrafiteTypes.get_current_proof status in
598 print_endline (AutoTactic.pp_proofterm p);
600 | GrafiteAst.Print (_,_) -> status,[]
601 | GrafiteAst.Default (loc, what, uris) as cmd ->
602 LibraryObjects.set_default what uris;
603 GrafiteTypes.add_moo_content [cmd] status,[]
604 | GrafiteAst.Include (loc, baseuri) ->
605 let moopath_rw, moopath_r =
606 LibraryMisc.obj_file_of_baseuri
607 ~must_exist:false ~baseuri ~writable:true,
608 LibraryMisc.obj_file_of_baseuri
609 ~must_exist:false ~baseuri ~writable:false
612 if Sys.file_exists moopath_r then moopath_r else
613 if Sys.file_exists moopath_rw then moopath_rw else
614 raise (IncludedFileNotCompiled (moopath_rw,baseuri))
616 let status = eval_from_moo.efm_go status moopath in
618 | GrafiteAst.Set (loc, name, value) ->
619 if name = "baseuri" then begin
621 let v = Http_getter_misc.strip_trailing_slash value in
623 ignore (String.index v ' ');
624 GrafiteTypes.command_error "baseuri can't contain spaces"
627 if Http_getter_storage.is_read_only value then begin
628 HLog.error (sprintf "uri %s belongs to a read-only repository" value);
629 raise (ReadOnlyUri value)
631 if not (Http_getter_storage.is_empty value) &&
634 HLog.message ("baseuri " ^ value ^ " is not empty");
635 HLog.message ("cleaning baseuri " ^ value);
636 LibraryClean.clean_baseuris [value];
637 assert (Http_getter_storage.is_empty value);
639 if not (Helm_registry.get_opt_default Helm_registry.bool "matita.nodisk"
643 (Filename.dirname (Http_getter.filename ~writable:true (value ^
646 GrafiteTypes.set_option status name value,[]
647 | GrafiteAst.Drop loc -> raise Drop
648 | GrafiteAst.Qed loc ->
649 let uri, metasenv, bo, ty =
650 match status.GrafiteTypes.proof_status with
651 | GrafiteTypes.Proof (Some uri, metasenv, body, ty) ->
652 uri, metasenv, body, ty
653 | GrafiteTypes.Proof (None, metasenv, body, ty) ->
654 raise (GrafiteTypes.Command_error
655 ("Someone allows to start a theorem without giving the "^
656 "name/uri. This should be fixed!"))
659 (GrafiteTypes.Command_error "You can't Qed an incomplete theorem")
661 if metasenv <> [] then
663 (GrafiteTypes.Command_error
664 "Proof not completed! metasenv is not empty!");
665 let name = UriManager.name_of_uri uri in
666 let obj = Cic.Constant (name,Some bo,ty,[],[]) in
667 let status, lemmas = add_obj uri obj status in
668 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
670 | GrafiteAst.Coercion (loc, uri, add_composites) ->
671 eval_coercion status ~add_composites uri
672 | GrafiteAst.Obj (loc,obj) ->
675 Cic.Constant (name,_,_,_,_)
676 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
677 | Cic.InductiveDefinition (types,_,_,_) ->
679 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
680 | _ -> assert false in
682 UriManager.uri_of_string (GrafiteTypes.qualify status name ^ ext) in
683 let obj = CicRefine.pack_coercion_obj obj in
684 let metasenv = GrafiteTypes.get_proof_metasenv status in
686 | Cic.CurrentProof (_,metasenv',bo,ty,_,_) ->
687 let name = UriManager.name_of_uri uri in
688 if not(CicPp.check name ty) then
689 HLog.error ("Bad name: " ^ name);
690 if opts.do_heavy_checks then
692 let dbd = LibraryDb.instance () in
693 let similar = Whelp.match_term ~dbd ty in
694 let similar_len = List.length similar in
695 if similar_len> 30 then
697 ("Duplicate check will compare your theorem with " ^
698 string_of_int similar_len ^
699 " theorems, this may take a while."));
703 let t = CicUtil.term_of_uri u in
705 CicTypeChecker.type_of_aux'
706 metasenv' [] t CicUniv.empty_ugraph
708 fst(CicReduction.are_convertible [] ty' ty g))
711 (match convertible with
715 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
716 "\nPlease use a variant."));
718 let initial_proof = (Some uri, metasenv', bo, ty) in
719 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
720 { status with GrafiteTypes.proof_status =
721 GrafiteTypes.Incomplete_proof
722 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
725 if metasenv <> [] then
726 raise (GrafiteTypes.Command_error (
727 "metasenv not empty while giving a definition with body: " ^
728 CicMetaSubst.ppmetasenv [] metasenv));
729 let status, lemmas = add_obj uri obj status in
730 let status,new_lemmas =
731 add_coercions_of_record_to_moo obj lemmas status
733 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
734 uri::new_lemmas@lemmas
736 match status.GrafiteTypes.proof_status with
737 GrafiteTypes.Intermediate _ ->
738 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
741 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
742 ~disambiguate_macro opts status (text,prefix_len,ex) ->
744 | GrafiteAst.Tactical (_, tac, None) ->
745 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac),[]
746 | GrafiteAst.Tactical (_, tac, Some punct) ->
748 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac) in
749 eval_tactical ~disambiguate_tactic status (text,prefix_len,punct),[]
750 | GrafiteAst.Command (_, cmd) ->
751 eval_command.ec_go ~disambiguate_command opts status (text,prefix_len,cmd)
752 | GrafiteAst.Macro (loc, macro) ->
753 raise (Macro (loc,disambiguate_macro status (text,prefix_len,macro)))
755 } and eval_from_moo = {efm_go = fun status fname ->
757 ("",0,GrafiteAst.Executable (HExtlib.dummy_floc,
758 GrafiteAst.Command (HExtlib.dummy_floc,
761 let moo = GrafiteMarshal.load_moo fname in
764 let ast = ast_of_cmd ast in
767 ~disambiguate_tactic:(fun status _ (_,_,tactic) -> status,tactic)
768 ~disambiguate_command:(fun status (_,_,cmd) -> status,cmd)
769 ~disambiguate_macro:(fun _ _ -> assert false)
775 } and eval_ast = {ea_go = fun ~disambiguate_tactic ~disambiguate_command
776 ~disambiguate_macro ?(do_heavy_checks=false) ?(clean_baseuri=true) status
780 do_heavy_checks = do_heavy_checks ;
781 clean_baseuri = clean_baseuri }
784 | GrafiteAst.Executable (_,ex) ->
785 eval_executable.ee_go ~disambiguate_tactic ~disambiguate_command
786 ~disambiguate_macro opts status (text,prefix_len,ex)
787 | GrafiteAst.Comment (_,c) -> eval_comment status (text,prefix_len,c),[]
790 let eval_ast = eval_ast.ea_go