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 status 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, params) ->
65 Tactics.applyS ~term ~params ~dbd:(LibraryDb.instance ())
66 ~universe:status.GrafiteTypes.universe
67 | GrafiteAst.Assumption _ -> Tactics.assumption
68 | GrafiteAst.Auto (_,params) ->
69 AutoTactic.auto_tac ~params ~dbd:(LibraryDb.instance ())
70 ~universe:status.GrafiteTypes.universe
71 | GrafiteAst.Cases (_, what, names) ->
72 Tactics.cases_intros ~mk_fresh_name_callback:(namer_of names)
74 | GrafiteAst.Change (_, pattern, with_what) ->
75 Tactics.change ~pattern with_what
76 | GrafiteAst.Clear (_,id) -> Tactics.clear id
77 | GrafiteAst.ClearBody (_,id) -> Tactics.clearbody id
78 | GrafiteAst.Contradiction _ -> Tactics.contradiction
79 | GrafiteAst.Constructor (_, n) -> Tactics.constructor n
80 | GrafiteAst.Cut (_, ident, term) ->
81 let names = match ident with None -> [] | Some id -> [id] in
82 Tactics.cut ~mk_fresh_name_callback:(namer_of names) term
83 | GrafiteAst.Decompose (_, names) ->
84 let mk_fresh_name_callback = namer_of names in
85 Tactics.decompose ~mk_fresh_name_callback ()
86 | GrafiteAst.Demodulate _ ->
88 ~dbd:(LibraryDb.instance ()) ~universe:status.GrafiteTypes.universe
89 | GrafiteAst.Destruct (_,term) -> Tactics.destruct term
90 | GrafiteAst.Elim (_, pattern, using, depth, names) ->
91 Tactics.elim_intros ?using ?depth ~mk_fresh_name_callback:(namer_of names)
93 | GrafiteAst.ElimType (_, what, using, depth, names) ->
94 Tactics.elim_type ?using ?depth ~mk_fresh_name_callback:(namer_of names)
96 | GrafiteAst.Exact (_, term) -> Tactics.exact term
97 | GrafiteAst.Exists _ -> Tactics.exists
98 | GrafiteAst.Fail _ -> Tactics.fail
99 | GrafiteAst.Fold (_, reduction_kind, term, pattern) ->
101 match reduction_kind with
103 PET.const_lazy_reduction
104 (CicReduction.normalize ~delta:false ~subst:[])
105 | `Reduce -> PET.const_lazy_reduction ProofEngineReduction.reduce
106 | `Simpl -> PET.const_lazy_reduction ProofEngineReduction.simpl
108 PET.const_lazy_reduction (ProofEngineReduction.unfold ?what:None)
109 | `Unfold (Some lazy_term) ->
110 (fun context metasenv ugraph ->
111 let what, metasenv, ugraph = lazy_term context metasenv ugraph in
112 ProofEngineReduction.unfold ~what, metasenv, ugraph)
114 PET.const_lazy_reduction (CicReduction.whd ~delta:false ~subst:[])
116 Tactics.fold ~reduction ~term ~pattern
117 | GrafiteAst.Fourier _ -> Tactics.fourier
118 | GrafiteAst.FwdSimpl (_, hyp, names) ->
119 Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names)
120 ~dbd:(LibraryDb.instance ()) hyp
121 | GrafiteAst.Generalize (_,pattern,ident) ->
122 let names = match ident with None -> [] | Some id -> [id] in
123 Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern
124 | GrafiteAst.Goal (_, n) -> Tactics.set_goal n
125 | GrafiteAst.IdTac _ -> Tactics.id
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, names) ->
151 EqualityTactics.rewrite_tac ~direction ~pattern t names
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())
163 ~universe:status.GrafiteTypes.universe t ty id t1
164 | GrafiteAst.We_need_to_prove (_, t, id, t2) ->
165 Declarative.we_need_to_prove t id t2
166 | GrafiteAst.Bydone (_, t) ->
167 Declarative.bydone ~dbd:(LibraryDb.instance())
168 ~universe:status.GrafiteTypes.universe t
169 | GrafiteAst.We_proceed_by_cases_on (_, t, t1) ->
170 Declarative.we_proceed_by_cases_on t t1
171 | GrafiteAst.We_proceed_by_induction_on (_, t, t1) ->
172 Declarative.we_proceed_by_induction_on t t1
173 | GrafiteAst.Byinduction (_, t, id) -> Declarative.byinduction t id
174 | GrafiteAst.Thesisbecomes (_, t) -> Declarative.thesisbecomes t
175 | GrafiteAst.ExistsElim (_, t, id1, t1, id2, t2) ->
176 Declarative.existselim ~dbd:(LibraryDb.instance())
177 ~universe:status.GrafiteTypes.universe t id1 t1 id2 t2
178 | GrafiteAst.Case (_,id,params) -> Declarative.case id params
179 | GrafiteAst.AndElim(_,t,id1,t1,id2,t2) -> Declarative.andelim t id1 t1 id2 t2
180 | GrafiteAst.RewritingStep (_,termine,t1,t2,cont) ->
181 Declarative.rewritingstep ~dbd:(LibraryDb.instance ())
182 ~universe:status.GrafiteTypes.universe termine t1 t2 cont
184 let classify_tactic tactic =
186 (* tactics that can't close the goal (return a goal we want to "select") *)
187 | GrafiteAst.Rewrite _
189 | GrafiteAst.Replace _
190 | GrafiteAst.Reduce _
192 | GrafiteAst.Generalize _
195 | GrafiteAst.Decompose _ -> true, true
196 (* tactics we don't want to reorder goals. I think only Goal needs this. *)
197 | GrafiteAst.Goal _ -> false, true
198 (* tactics like apply *)
201 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
202 let module PEH = ProofEngineHelpers in
203 (* let print_m name metasenv =
204 prerr_endline (">>>>> " ^ name);
205 prerr_endline (CicMetaSubst.ppmetasenv [] metasenv)
207 (* phase one calculates:
208 * new_goals_from_refine: goals added by refine
209 * head_goal: the first goal opened by ythe tactic
210 * other_goals: other goals opened by the tactic
212 let new_goals_from_refine = PEH.compare_metasenvs start refine in
213 let new_goals_from_tactic = PEH.compare_metasenvs refine tactic in
214 let head_goal, other_goals, goals =
216 | [] -> None,[],goals
218 (* assert (List.mem hd new_goals_from_tactic);
219 * invalidato dalla goal_tac
221 Some hd, List.filter ((<>) hd) new_goals_from_tactic, List.filter ((<>)
226 | None -> new_goals_from_refine @ other_goals
227 | Some x -> x :: new_goals_from_refine @ other_goals
229 (* extract the metas generated by refine and tactic *)
230 let metas_for_tactic_head =
233 | Some head_goal -> List.filter (fun (n,_,_) -> n = head_goal) tactic in
234 let metas_for_tactic_goals =
236 (fun x -> List.find (fun (metano,_,_) -> metano = x) tactic)
239 let metas_for_refine_goals =
240 List.filter (fun (n,_,_) -> List.mem n new_goals_from_refine) tactic in
241 let produced_metas, goals =
243 if always_opens_a_goal then
244 metas_for_tactic_head @ metas_for_refine_goals @
245 metas_for_tactic_goals
247 (* print_m "metas_for_refine_goals" metas_for_refine_goals;
248 print_m "metas_for_tactic_head" metas_for_tactic_head;
249 print_m "metas_for_tactic_goals" metas_for_tactic_goals; *)
250 metas_for_refine_goals @ metas_for_tactic_head @
251 metas_for_tactic_goals
254 let goals = List.map (fun (metano, _, _) -> metano) produced_metas in
255 produced_metas, goals
257 (* residual metas, preserving the original order *)
262 | (metano, _, _) :: tl when metano = e ->
263 [], List.map (fun (x,_,_) -> x) tl
264 | (metano, _, _) :: tl -> let b, a = split e tl in metano :: b, a
266 let find n metasenv =
268 Some (List.find (fun (metano, _, _) -> metano = n) metasenv)
269 with Not_found -> None
274 match find n tactic with
278 let before_l, after_l = split current_goal start in
280 List.filter (fun x -> not (List.mem x produced_goals)) before_l in
282 List.filter (fun x -> not (List.mem x produced_goals)) after_l in
283 let before = extract before_l in
284 let after = extract after_l in
288 print_m "BEGIN" start;
289 prerr_endline ("goal was: " ^ string_of_int current_goal);
290 prerr_endline ("and metas from refine are:");
292 (fun t -> prerr_string (" " ^ string_of_int t))
293 new_goals_from_refine;
295 print_m "before" before;
296 print_m "metas_for_tactic_head" metas_for_tactic_head;
297 print_m "metas_for_refine_goals" metas_for_refine_goals;
298 print_m "metas_for_tactic_goals" metas_for_tactic_goals;
299 print_m "produced_metas" produced_metas;
300 print_m "after" after;
301 |+ FINE DEBUG CODE +| *)
302 before @ produced_metas @ after, goals
304 let apply_tactic ~disambiguate_tactic (text,prefix_len,tactic) (status, goal) =
305 (* prerr_endline "apply_tactic"; *)
306 (* prerr_endline (Continuationals.Stack.pp (GrafiteTypes.get_stack status)); *)
307 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
308 let before = List.map (fun g, _, _ -> g) starting_metasenv in
309 (* prerr_endline "disambiguate"; *)
310 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
311 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
312 let proof = GrafiteTypes.get_current_proof status in
313 let proof_status = proof, goal in
314 let needs_reordering, always_opens_a_goal = classify_tactic tactic in
315 let tactic = tactic_of_ast status tactic in
316 (* apply tactic will change the lexicon_status ... *)
317 (* prerr_endline "apply_tactic bassa"; *)
318 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
319 let after = ProofEngineTypes.goals_of_proof proof in
320 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
321 (* prerr_endline("before: " ^ String.concat ", " (List.map string_of_int before));
322 prerr_endline("after: " ^ String.concat ", " (List.map string_of_int after));
323 prerr_endline("opened: " ^ String.concat ", " (List.map string_of_int opened)); *)
324 (* prerr_endline("opened_goals: " ^ String.concat ", " (List.map string_of_int opened_goals));
325 prerr_endline("closed_goals: " ^ String.concat ", " (List.map string_of_int closed_goals)); *)
326 let proof, opened_goals =
327 if needs_reordering then begin
328 let uri, metasenv_after_tactic, t, ty, attrs = proof in
329 (* prerr_endline ("goal prima del riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof))); *)
330 let reordered_metasenv, opened_goals =
333 metasenv_after_refinement metasenv_after_tactic
334 opened goal always_opens_a_goal
336 let proof' = uri, reordered_metasenv, t, ty, attrs in
337 (* prerr_endline ("goal dopo il riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof'))); *)
343 let incomplete_proof =
344 match status.GrafiteTypes.proof_status with
345 | GrafiteTypes.Incomplete_proof p -> p
348 { status with GrafiteTypes.proof_status =
349 GrafiteTypes.Incomplete_proof
350 { incomplete_proof with GrafiteTypes.proof = proof } },
351 opened_goals, closed_goals
355 'term 'lazy_term 'reduction 'obj 'ident.
357 (GrafiteTypes.status ->
358 ProofEngineTypes.goal ->
359 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
360 disambiguator_input ->
361 GrafiteTypes.status *
362 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
364 disambiguate_command:
365 (GrafiteTypes.status ->
366 (('term,'obj) GrafiteAst.command) disambiguator_input ->
367 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
370 (GrafiteTypes.status ->
371 ('term GrafiteAst.macro) disambiguator_input ->
372 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
374 ?do_heavy_checks:bool ->
375 ?clean_baseuri:bool ->
376 GrafiteTypes.status ->
377 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
378 disambiguator_input ->
379 GrafiteTypes.status * UriManager.uri list
382 type 'a eval_command =
384 disambiguate_command:
385 (GrafiteTypes.status -> (('term,'obj) GrafiteAst.command) disambiguator_input ->
386 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
387 options -> GrafiteTypes.status ->
388 (('term,'obj) GrafiteAst.command) disambiguator_input ->
389 GrafiteTypes.status * UriManager.uri list
392 type 'a eval_executable =
393 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
395 (GrafiteTypes.status ->
396 ProofEngineTypes.goal ->
397 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
398 disambiguator_input ->
399 GrafiteTypes.status *
400 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
402 disambiguate_command:
403 (GrafiteTypes.status ->
404 (('term,'obj) GrafiteAst.command) disambiguator_input ->
405 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
408 (GrafiteTypes.status ->
409 ('term GrafiteAst.macro) disambiguator_input ->
410 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
413 GrafiteTypes.status ->
414 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
415 GrafiteTypes.status * UriManager.uri list
418 type 'a eval_from_moo =
419 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
421 let coercion_moo_statement_of (uri,arity) =
422 GrafiteAst.Coercion (HExtlib.dummy_floc, uri, false, arity)
424 let refinement_toolkit = {
425 RefinementTool.type_of_aux' =
426 (fun ?localization_tbl e c t u ->
427 let saved = !CicRefine.insert_coercions in
428 CicRefine.insert_coercions:= false;
431 let t, ty, metasenv, ugraph =
432 CicRefine.type_of_aux' ?localization_tbl e c t u in
433 RefinementTool.Success (t, ty, metasenv, ugraph)
435 | CicRefine.RefineFailure s
436 | CicRefine.Uncertain s
437 | CicRefine.AssertFailure s -> RefinementTool.Exception s
439 CicRefine.insert_coercions := saved;
441 RefinementTool.ppsubst = CicMetaSubst.ppsubst;
442 RefinementTool.apply_subst = CicMetaSubst.apply_subst;
443 RefinementTool.ppmetasenv = CicMetaSubst.ppmetasenv;
444 RefinementTool.pack_coercion_obj = CicRefine.pack_coercion_obj;
447 let eval_coercion status ~add_composites uri arity baseuri =
448 let status,compounds =
449 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri arity
453 List.map coercion_moo_statement_of ((uri,arity)::compounds)
455 let status = GrafiteTypes.add_moo_content moo_content status in
456 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
457 List.map fst compounds
459 let eval_tactical ~disambiguate_tactic status tac =
460 let apply_tactic = apply_tactic ~disambiguate_tactic in
461 let module MatitaStatus =
463 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
466 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
468 type tactic = input_status -> output_status
470 let id_tactic = apply_tactic ("",0,(GrafiteAst.IdTac HExtlib.dummy_floc))
471 let mk_tactic tac = tac
472 let apply_tactic tac = tac
473 let goals (_, opened, closed) = opened, closed
474 let set_goals (opened, closed) (status, _, _) = (status, opened, closed)
475 let get_stack (status, _) = GrafiteTypes.get_stack status
477 let get_status (status, goal) =
478 match status.GrafiteTypes.proof_status with
479 | GrafiteTypes.Incomplete_proof incomplete -> incomplete.GrafiteTypes.proof, goal
482 let get_proof (status, _, _) =
483 match status.GrafiteTypes.proof_status with
484 | GrafiteTypes.Incomplete_proof incomplete -> incomplete.GrafiteTypes.proof
487 let set_stack stack (status, opened, closed) =
488 GrafiteTypes.set_stack stack status, opened, closed
490 let inject (status, _) = (status, [], [])
491 let focus goal (status, _, _) = (status, goal)
494 let module MatitaTacticals = Tacticals.Make (MatitaStatus) in
495 let rec tactical_of_ast l (text,prefix_len,tac) =
496 let apply_tactic t = apply_tactic (text, prefix_len, t) in
497 let tactical_of_ast l t = tactical_of_ast l (text,prefix_len,t) in
499 | GrafiteAst.Tactic (loc, tactic) ->
500 MatitaTacticals.tactic (MatitaStatus.mk_tactic (apply_tactic tactic))
501 | GrafiteAst.Seq (loc, tacticals) -> (* tac1; tac2; ... *)
503 MatitaTacticals.seq ~tactics:(List.map (tactical_of_ast (l+1)) tacticals)
504 | GrafiteAst.Do (loc, n, tactical) ->
505 MatitaTacticals.do_tactic ~n ~tactic:(tactical_of_ast (l+1) tactical)
506 | GrafiteAst.Repeat (loc, tactical) ->
507 MatitaTacticals.repeat_tactic ~tactic:(tactical_of_ast (l+1) tactical)
508 | GrafiteAst.Then (loc, tactical, tacticals) -> (* tac; [ tac1 | ... ] *)
510 MatitaTacticals.thens ~start:(tactical_of_ast (l+1) tactical)
511 ~continuations:(List.map (tactical_of_ast (l+1)) tacticals)
512 | GrafiteAst.First (loc, tacticals) ->
513 MatitaTacticals.first
514 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
515 | GrafiteAst.Try (loc, tactical) ->
516 MatitaTacticals.try_tactic ~tactic:(tactical_of_ast (l+1) tactical)
517 | GrafiteAst.Solve (loc, tacticals) ->
518 MatitaTacticals.solve_tactics
519 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
520 | GrafiteAst.Progress (loc, tactical) ->
521 MatitaTacticals.progress_tactic ~tactic:(tactical_of_ast (l+1) tactical)
523 | GrafiteAst.Skip _loc -> MatitaTacticals.skip
524 | GrafiteAst.Dot _loc -> MatitaTacticals.dot
525 | GrafiteAst.Semicolon _loc -> MatitaTacticals.semicolon
526 | GrafiteAst.Branch _loc -> MatitaTacticals.branch
527 | GrafiteAst.Shift _loc -> MatitaTacticals.shift
528 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.pos i
529 | GrafiteAst.Merge _loc -> MatitaTacticals.merge
530 | GrafiteAst.Focus (_loc, goals) -> MatitaTacticals.focus goals
531 | GrafiteAst.Unfocus _loc -> MatitaTacticals.unfocus
532 | GrafiteAst.Wildcard _loc -> MatitaTacticals.wildcard
534 let status, _, _ = tactical_of_ast 0 tac (status, ~-1) in
535 let status = (* is proof completed? *)
536 match status.GrafiteTypes.proof_status with
537 | GrafiteTypes.Incomplete_proof
538 { GrafiteTypes.stack = stack; proof = proof }
539 when Continuationals.Stack.is_empty stack ->
540 { status with GrafiteTypes.proof_status = GrafiteTypes.Proof proof }
545 let eval_comment status c = status
547 (* since the record syntax allows to declare coercions, we have to put this
548 * information inside the moo *)
549 let add_coercions_of_record_to_moo obj lemmas status =
550 let attributes = CicUtil.attributes_of_obj obj in
551 let is_record = function `Class (`Record att) -> Some att | _-> None in
552 match HExtlib.list_findopt is_record attributes with
555 let is_a_coercion uri =
558 CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri in
559 let attrs = CicUtil.attributes_of_obj obj in
562 (function `Class (`Coercion _) -> true | _-> false) attrs
563 with `Class (`Coercion n) -> true,n | _ -> assert false
564 with Not_found -> false,0
565 with Not_found -> assert false
567 (* looking at the fields we can know the 'wanted' coercions, but not the
568 * actually generated ones. So, only the intersection between the wanted
569 * and the actual should be in the moo as coercion, while everithing in
570 * lemmas should go as aliases *)
571 let wanted_coercions =
574 | (name,true,arity) ->
576 (arity, UriManager.uri_of_string
577 (GrafiteTypes.qualify status name ^ ".con"))
581 (*prerr_endline "wanted coercions:";
583 (fun u -> prerr_endline (UriManager.string_of_uri u))
585 let coercions, moo_content =
589 let is_a_wanted_coercion,arity_wanted =
592 List.find (fun (n,u) -> UriManager.eq u uri)
596 with Not_found -> false, 0
598 let is_a_coercion, arity_coercion = is_a_coercion uri in
599 if is_a_coercion then
600 Some (uri, coercion_moo_statement_of (uri,arity_coercion))
601 else if is_a_wanted_coercion then
602 Some (uri, coercion_moo_statement_of (uri,arity_wanted))
607 (*prerr_endline "actual coercions:";
609 (fun u -> prerr_endline (UriManager.string_of_uri u))
611 prerr_endline "lemmas was:";
613 (fun u -> prerr_endline (UriManager.string_of_uri u))
615 let status = GrafiteTypes.add_moo_content moo_content status in
617 GrafiteTypes.coercions = coercions @ status.GrafiteTypes.coercions},
620 let add_obj uri obj status =
621 let status,lemmas = GrafiteSync.add_obj refinement_toolkit uri obj status in
624 let rec eval_command = {ec_go = fun ~disambiguate_command opts status
625 (text,prefix_len,cmd) ->
626 let status,cmd = disambiguate_command status (text,prefix_len,cmd) in
629 | GrafiteAst.Index (loc,None,uri) ->
630 assert false (* TODO: for user input *)
631 | GrafiteAst.Index (loc,Some key,uri) ->
632 let universe = Universe.index
633 status.GrafiteTypes.universe key (CicUtil.term_of_uri uri) in
634 let status = {status with GrafiteTypes.universe = universe} in
637 let candidates = Universe.get_candidates status.GrafiteTypes.universe key in
638 ("candidates for " ^ (CicPp.ppterm key) ^ " = " ^
639 (String.concat "\n" (List.map CicPp.ppterm candidates)))
643 let status = GrafiteTypes.add_moo_content [cmd] status in
645 | GrafiteAst.Coercion (loc, uri, add_composites, arity) ->
646 eval_coercion status ~add_composites uri arity
647 (GrafiteTypes.get_string_option status "baseuri")
648 | GrafiteAst.Default (loc, what, uris) as cmd ->
649 LibraryObjects.set_default what uris;
650 GrafiteTypes.add_moo_content [cmd] status,[]
651 | GrafiteAst.Drop loc -> raise Drop
652 | GrafiteAst.Include (loc, baseuri) ->
653 let moopath_rw, moopath_r =
654 LibraryMisc.obj_file_of_baseuri
655 ~must_exist:false ~baseuri ~writable:true,
656 LibraryMisc.obj_file_of_baseuri
657 ~must_exist:false ~baseuri ~writable:false
660 if Sys.file_exists moopath_r then moopath_r else
661 if Sys.file_exists moopath_rw then moopath_rw else
662 raise (IncludedFileNotCompiled (moopath_rw,baseuri))
664 let status = eval_from_moo.efm_go status moopath in
666 let lt_uri = UriManager.uri_of_string "cic:/matita/nat/orders/lt.con" in
667 let nat_uri = UriManager.uri_of_string "cic:/matita/nat/nat/nat.ind" in
668 let nat = Cic.MutInd(nat_uri,0,[]) in
669 let zero = Cic.MutConstruct(nat_uri,0,1,[]) in
670 let succ = Cic.MutConstruct(nat_uri,0,2,[]) in
671 let fake= Cic.Meta(-1,[]) in
672 let term= Cic.Appl [Cic.Const (lt_uri,[]);zero;Cic.Appl[succ;zero]] in let msg =
673 let candidates = Universe.get_candidates status.GrafiteTypes.universe term in
674 ("candidates for " ^ (CicPp.ppterm term) ^ " = " ^
675 (String.concat "\n" (List.map CicPp.ppterm candidates)))
680 | GrafiteAst.Print (_,"proofterm") ->
681 let _,_,p,_, _ = GrafiteTypes.get_current_proof status in
682 print_endline (AutoTactic.pp_proofterm p);
684 | GrafiteAst.Print (_,_) -> status,[]
685 | GrafiteAst.Qed loc ->
686 let uri, metasenv, bo, ty, attrs =
687 match status.GrafiteTypes.proof_status with
688 | GrafiteTypes.Proof (Some uri, metasenv, body, ty, attrs) ->
689 uri, metasenv, body, ty, attrs
690 | GrafiteTypes.Proof (None, metasenv, body, ty, attrs) ->
691 raise (GrafiteTypes.Command_error
692 ("Someone allows to start a theorem without giving the "^
693 "name/uri. This should be fixed!"))
696 (GrafiteTypes.Command_error "You can't Qed an incomplete theorem")
698 if metasenv <> [] then
700 (GrafiteTypes.Command_error
701 "Proof not completed! metasenv is not empty!");
702 let name = UriManager.name_of_uri uri in
703 let obj = Cic.Constant (name,Some bo,ty,[],attrs) in
704 let status, lemmas = add_obj uri obj status in
706 GrafiteTypes.proof_status = GrafiteTypes.No_proof},
707 (*CSC: I throw away the arities *)
709 | GrafiteAst.Relation (loc, id, a, aeq, refl, sym, trans) ->
710 Setoids.add_relation id a aeq refl sym trans;
711 status, [] (*CSC: TO BE FIXED *)
712 | GrafiteAst.Set (loc, name, value) ->
713 if name = "baseuri" then begin
715 let v = Http_getter_misc.strip_trailing_slash value in
717 ignore (String.index v ' ');
718 GrafiteTypes.command_error "baseuri can't contain spaces"
721 if Http_getter_storage.is_read_only value then begin
722 HLog.error (sprintf "uri %s belongs to a read-only repository" value);
723 raise (ReadOnlyUri value)
725 if not (Http_getter_storage.is_empty value) &&
728 HLog.message ("baseuri " ^ value ^ " is not empty");
729 HLog.message ("cleaning baseuri " ^ value);
730 LibraryClean.clean_baseuris [value];
731 assert (Http_getter_storage.is_empty value);
733 if not (Helm_registry.get_opt_default Helm_registry.bool "matita.nodisk"
737 (Filename.dirname (Http_getter.filename ~writable:true (value ^
740 GrafiteTypes.set_option status name value,[]
741 | GrafiteAst.Obj (loc,obj) ->
744 Cic.Constant (name,_,_,_,_)
745 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
746 | Cic.InductiveDefinition (types,_,_,_) ->
748 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
749 | _ -> assert false in
751 UriManager.uri_of_string (GrafiteTypes.qualify status name ^ ext) in
752 let obj = CicRefine.pack_coercion_obj obj in
753 let metasenv = GrafiteTypes.get_proof_metasenv status in
755 | Cic.CurrentProof (_,metasenv',bo,ty,_, attrs) ->
756 let name = UriManager.name_of_uri uri in
757 if not(CicPp.check name ty) then
758 HLog.error ("Bad name: " ^ name);
759 if opts.do_heavy_checks then
761 let dbd = LibraryDb.instance () in
762 let similar = Whelp.match_term ~dbd ty in
763 let similar_len = List.length similar in
764 if similar_len> 30 then
766 ("Duplicate check will compare your theorem with " ^
767 string_of_int similar_len ^
768 " theorems, this may take a while."));
772 let t = CicUtil.term_of_uri u in
774 CicTypeChecker.type_of_aux'
775 metasenv' [] t CicUniv.empty_ugraph
777 fst(CicReduction.are_convertible [] ty' ty g))
780 (match convertible with
784 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
785 "\nPlease use a variant."));
787 let initial_proof = (Some uri, metasenv', bo, ty, attrs) in
788 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
789 { status with GrafiteTypes.proof_status =
790 GrafiteTypes.Incomplete_proof
791 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
794 if metasenv <> [] then
795 raise (GrafiteTypes.Command_error (
796 "metasenv not empty while giving a definition with body: " ^
797 CicMetaSubst.ppmetasenv [] metasenv));
798 let status, lemmas = add_obj uri obj status in
799 let status,new_lemmas =
800 add_coercions_of_record_to_moo obj lemmas status
802 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
803 uri::new_lemmas@lemmas
805 match status.GrafiteTypes.proof_status with
806 GrafiteTypes.Intermediate _ ->
807 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
810 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
811 ~disambiguate_macro opts status (text,prefix_len,ex) ->
813 | GrafiteAst.Tactical (_, tac, None) ->
814 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac),[]
815 | GrafiteAst.Tactical (_, tac, Some punct) ->
817 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac) in
818 eval_tactical ~disambiguate_tactic status (text,prefix_len,punct),[]
819 | GrafiteAst.Command (_, cmd) ->
820 eval_command.ec_go ~disambiguate_command opts status (text,prefix_len,cmd)
821 | GrafiteAst.Macro (loc, macro) ->
822 raise (Macro (loc,disambiguate_macro status (text,prefix_len,macro)))
824 } and eval_from_moo = {efm_go = fun status fname ->
826 ("",0,GrafiteAst.Executable (HExtlib.dummy_floc,
827 GrafiteAst.Command (HExtlib.dummy_floc,
830 let moo = GrafiteMarshal.load_moo fname in
833 let ast = ast_of_cmd ast in
836 ~disambiguate_tactic:(fun status _ (_,_,tactic) -> status,tactic)
837 ~disambiguate_command:(fun status (_,_,cmd) -> status,cmd)
838 ~disambiguate_macro:(fun _ _ -> assert false)
844 } and eval_ast = {ea_go = fun ~disambiguate_tactic ~disambiguate_command
845 ~disambiguate_macro ?(do_heavy_checks=false) ?(clean_baseuri=true) status
849 do_heavy_checks = do_heavy_checks ;
850 clean_baseuri = clean_baseuri }
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