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 (_, types, what, names) ->
84 let to_type = function
85 | GrafiteAst.Type (uri, typeno) -> uri, Some typeno
86 | GrafiteAst.Ident _ -> assert false
88 let user_types = List.rev_map to_type types in
89 let dbd = LibraryDb.instance () in
90 let mk_fresh_name_callback = namer_of names in
91 Tactics.decompose ~mk_fresh_name_callback ~dbd ~user_types ?what
92 | GrafiteAst.Demodulate _ ->
94 ~dbd:(LibraryDb.instance ()) ~universe:status.GrafiteTypes.universe
95 | GrafiteAst.Destruct (_,term) -> Tactics.destruct term
96 | GrafiteAst.Elim (_, what, using, depth, names) ->
97 Tactics.elim_intros ?using ?depth ~mk_fresh_name_callback:(namer_of names)
99 | GrafiteAst.ElimType (_, what, using, depth, names) ->
100 Tactics.elim_type ?using ?depth ~mk_fresh_name_callback:(namer_of names)
102 | GrafiteAst.Exact (_, term) -> Tactics.exact term
103 | GrafiteAst.Exists _ -> Tactics.exists
104 | GrafiteAst.Fail _ -> Tactics.fail
105 | GrafiteAst.Fold (_, reduction_kind, term, pattern) ->
107 match reduction_kind with
109 PET.const_lazy_reduction
110 (CicReduction.normalize ~delta:false ~subst:[])
111 | `Reduce -> PET.const_lazy_reduction ProofEngineReduction.reduce
112 | `Simpl -> PET.const_lazy_reduction ProofEngineReduction.simpl
114 PET.const_lazy_reduction (ProofEngineReduction.unfold ?what:None)
115 | `Unfold (Some lazy_term) ->
116 (fun context metasenv ugraph ->
117 let what, metasenv, ugraph = lazy_term context metasenv ugraph in
118 ProofEngineReduction.unfold ~what, metasenv, ugraph)
120 PET.const_lazy_reduction (CicReduction.whd ~delta:false ~subst:[])
122 Tactics.fold ~reduction ~term ~pattern
123 | GrafiteAst.Fourier _ -> Tactics.fourier
124 | GrafiteAst.FwdSimpl (_, hyp, names) ->
125 Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names)
126 ~dbd:(LibraryDb.instance ()) hyp
127 | GrafiteAst.Generalize (_,pattern,ident) ->
128 let names = match ident with None -> [] | Some id -> [id] in
129 Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern
130 | GrafiteAst.Goal (_, n) -> Tactics.set_goal n
131 | GrafiteAst.IdTac _ -> Tactics.id
132 | GrafiteAst.Intros (_, None, names) ->
133 PrimitiveTactics.intros_tac ~mk_fresh_name_callback:(namer_of names) ()
134 | GrafiteAst.Intros (_, Some num, names) ->
135 PrimitiveTactics.intros_tac ~howmany:num
136 ~mk_fresh_name_callback:(namer_of names) ()
137 | GrafiteAst.Inversion (_, term) ->
138 Tactics.inversion term
139 | GrafiteAst.LApply (_, linear, how_many, to_what, what, ident) ->
140 let names = match ident with None -> [] | Some id -> [id] in
141 Tactics.lapply ~mk_fresh_name_callback:(namer_of names)
142 ~linear ?how_many ~to_what what
143 | GrafiteAst.Left _ -> Tactics.left
144 | GrafiteAst.LetIn (loc,term,name) ->
145 Tactics.letin term ~mk_fresh_name_callback:(namer_of [name])
146 | GrafiteAst.Reduce (_, reduction_kind, pattern) ->
147 (match reduction_kind with
148 | `Normalize -> Tactics.normalize ~pattern
149 | `Reduce -> Tactics.reduce ~pattern
150 | `Simpl -> Tactics.simpl ~pattern
151 | `Unfold what -> Tactics.unfold ~pattern what
152 | `Whd -> Tactics.whd ~pattern)
153 | GrafiteAst.Reflexivity _ -> Tactics.reflexivity
154 | GrafiteAst.Rename (_, froms, tos) -> Tactics.rename ~froms ~tos
155 | GrafiteAst.Replace (_, pattern, with_what) ->
156 Tactics.replace ~pattern ~with_what
157 | GrafiteAst.Rewrite (_, direction, t, pattern, names) ->
158 EqualityTactics.rewrite_tac ~direction ~pattern t names
159 | GrafiteAst.Right _ -> Tactics.right
160 | GrafiteAst.Ring _ -> Tactics.ring
161 | GrafiteAst.Split _ -> Tactics.split
162 | GrafiteAst.Subst _ -> Tactics.subst
163 | GrafiteAst.Symmetry _ -> Tactics.symmetry
164 | GrafiteAst.Transitivity (_, term) -> Tactics.transitivity term
165 (* Implementazioni Aggiunte *)
166 | GrafiteAst.Assume (_, id, t) -> Declarative.assume id t
167 | GrafiteAst.Suppose (_, t, id, t1) -> Declarative.suppose t id t1
168 | GrafiteAst.By_term_we_proved (_, t, ty, id, t1) ->
169 Declarative.by_term_we_proved ~dbd:(LibraryDb.instance())
170 ~universe:status.GrafiteTypes.universe t ty id t1
171 | GrafiteAst.We_need_to_prove (_, t, id, t2) ->
172 Declarative.we_need_to_prove t id t2
173 | GrafiteAst.Bydone (_, t) ->
174 Declarative.bydone ~dbd:(LibraryDb.instance())
175 ~universe:status.GrafiteTypes.universe t
176 | GrafiteAst.We_proceed_by_cases_on (_, t, t1) ->
177 Declarative.we_proceed_by_cases_on t t1
178 | GrafiteAst.We_proceed_by_induction_on (_, t, t1) ->
179 Declarative.we_proceed_by_induction_on t t1
180 | GrafiteAst.Byinduction (_, t, id) -> Declarative.byinduction t id
181 | GrafiteAst.Thesisbecomes (_, t) -> Declarative.thesisbecomes t
182 | GrafiteAst.ExistsElim (_, t, id1, t1, id2, t2) ->
183 Declarative.existselim t id1 t1 id2 t2
184 | GrafiteAst.Case (_,id,params) -> Declarative.case id params
185 | GrafiteAst.AndElim(_,t,id1,t1,id2,t2) -> Declarative.andelim t id1 t1 id2 t2
186 | GrafiteAst.RewritingStep (_,termine,t1,t2,cont) ->
187 Declarative.rewritingstep ~dbd:(LibraryDb.instance ())
188 ~universe:status.GrafiteTypes.universe termine t1 t2 cont
190 let classify_tactic tactic =
192 (* tactics that can't close the goal (return a goal we want to "select") *)
193 | GrafiteAst.Rewrite _
195 | GrafiteAst.Replace _
196 | GrafiteAst.Reduce _
198 | GrafiteAst.Generalize _
201 | GrafiteAst.Decompose _ -> true, true
202 (* tactics we don't want to reorder goals. I think only Goal needs this. *)
203 | GrafiteAst.Goal _ -> false, true
204 (* tactics like apply *)
207 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
208 let module PEH = ProofEngineHelpers in
209 (* let print_m name metasenv =
210 prerr_endline (">>>>> " ^ name);
211 prerr_endline (CicMetaSubst.ppmetasenv [] metasenv)
213 (* phase one calculates:
214 * new_goals_from_refine: goals added by refine
215 * head_goal: the first goal opened by ythe tactic
216 * other_goals: other goals opened by the tactic
218 let new_goals_from_refine = PEH.compare_metasenvs start refine in
219 let new_goals_from_tactic = PEH.compare_metasenvs refine tactic in
220 let head_goal, other_goals, goals =
222 | [] -> None,[],goals
224 (* assert (List.mem hd new_goals_from_tactic);
225 * invalidato dalla goal_tac
227 Some hd, List.filter ((<>) hd) new_goals_from_tactic, List.filter ((<>)
232 | None -> new_goals_from_refine @ other_goals
233 | Some x -> x :: new_goals_from_refine @ other_goals
235 (* extract the metas generated by refine and tactic *)
236 let metas_for_tactic_head =
239 | Some head_goal -> List.filter (fun (n,_,_) -> n = head_goal) tactic in
240 let metas_for_tactic_goals =
242 (fun x -> List.find (fun (metano,_,_) -> metano = x) tactic)
245 let metas_for_refine_goals =
246 List.filter (fun (n,_,_) -> List.mem n new_goals_from_refine) tactic in
247 let produced_metas, goals =
249 if always_opens_a_goal then
250 metas_for_tactic_head @ metas_for_refine_goals @
251 metas_for_tactic_goals
253 (* print_m "metas_for_refine_goals" metas_for_refine_goals;
254 print_m "metas_for_tactic_head" metas_for_tactic_head;
255 print_m "metas_for_tactic_goals" metas_for_tactic_goals; *)
256 metas_for_refine_goals @ metas_for_tactic_head @
257 metas_for_tactic_goals
260 let goals = List.map (fun (metano, _, _) -> metano) produced_metas in
261 produced_metas, goals
263 (* residual metas, preserving the original order *)
268 | (metano, _, _) :: tl when metano = e ->
269 [], List.map (fun (x,_,_) -> x) tl
270 | (metano, _, _) :: tl -> let b, a = split e tl in metano :: b, a
272 let find n metasenv =
274 Some (List.find (fun (metano, _, _) -> metano = n) metasenv)
275 with Not_found -> None
280 match find n tactic with
284 let before_l, after_l = split current_goal start in
286 List.filter (fun x -> not (List.mem x produced_goals)) before_l in
288 List.filter (fun x -> not (List.mem x produced_goals)) after_l in
289 let before = extract before_l in
290 let after = extract after_l in
294 print_m "BEGIN" start;
295 prerr_endline ("goal was: " ^ string_of_int current_goal);
296 prerr_endline ("and metas from refine are:");
298 (fun t -> prerr_string (" " ^ string_of_int t))
299 new_goals_from_refine;
301 print_m "before" before;
302 print_m "metas_for_tactic_head" metas_for_tactic_head;
303 print_m "metas_for_refine_goals" metas_for_refine_goals;
304 print_m "metas_for_tactic_goals" metas_for_tactic_goals;
305 print_m "produced_metas" produced_metas;
306 print_m "after" after;
307 |+ FINE DEBUG CODE +| *)
308 before @ produced_metas @ after, goals
310 let apply_tactic ~disambiguate_tactic (text,prefix_len,tactic) (status, goal) =
311 (* prerr_endline "apply_tactic"; *)
312 (* prerr_endline (Continuationals.Stack.pp (GrafiteTypes.get_stack status)); *)
313 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
314 let before = List.map (fun g, _, _ -> g) starting_metasenv in
315 (* prerr_endline "disambiguate"; *)
316 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
317 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
318 let proof = GrafiteTypes.get_current_proof status in
319 let proof_status = proof, goal in
320 let needs_reordering, always_opens_a_goal = classify_tactic tactic in
321 let tactic = tactic_of_ast status tactic in
322 (* apply tactic will change the lexicon_status ... *)
323 (* prerr_endline "apply_tactic bassa"; *)
324 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
325 let after = ProofEngineTypes.goals_of_proof proof in
326 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
327 (* prerr_endline("before: " ^ String.concat ", " (List.map string_of_int before));
328 prerr_endline("after: " ^ String.concat ", " (List.map string_of_int after));
329 prerr_endline("opened: " ^ String.concat ", " (List.map string_of_int opened)); *)
330 (* prerr_endline("opened_goals: " ^ String.concat ", " (List.map string_of_int opened_goals));
331 prerr_endline("closed_goals: " ^ String.concat ", " (List.map string_of_int closed_goals)); *)
332 let proof, opened_goals =
333 if needs_reordering then begin
334 let uri, metasenv_after_tactic, t, ty = proof in
335 (* prerr_endline ("goal prima del riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof))); *)
336 let reordered_metasenv, opened_goals =
339 metasenv_after_refinement metasenv_after_tactic
340 opened goal always_opens_a_goal
342 let proof' = uri, reordered_metasenv, t, ty in
343 (* prerr_endline ("goal dopo il riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof'))); *)
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
361 'term 'lazy_term 'reduction 'obj 'ident.
363 (GrafiteTypes.status ->
364 ProofEngineTypes.goal ->
365 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
366 disambiguator_input ->
367 GrafiteTypes.status *
368 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
370 disambiguate_command:
371 (GrafiteTypes.status ->
372 (('term,'obj) GrafiteAst.command) disambiguator_input ->
373 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
376 (GrafiteTypes.status ->
377 ('term GrafiteAst.macro) disambiguator_input ->
378 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
380 ?do_heavy_checks:bool ->
381 ?clean_baseuri:bool ->
382 GrafiteTypes.status ->
383 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
384 disambiguator_input ->
385 GrafiteTypes.status * UriManager.uri list
388 type 'a eval_command =
390 disambiguate_command:
391 (GrafiteTypes.status -> (('term,'obj) GrafiteAst.command) disambiguator_input ->
392 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
393 options -> GrafiteTypes.status ->
394 (('term,'obj) GrafiteAst.command) disambiguator_input ->
395 GrafiteTypes.status * UriManager.uri list
398 type 'a eval_executable =
399 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
401 (GrafiteTypes.status ->
402 ProofEngineTypes.goal ->
403 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
404 disambiguator_input ->
405 GrafiteTypes.status *
406 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
408 disambiguate_command:
409 (GrafiteTypes.status ->
410 (('term,'obj) GrafiteAst.command) disambiguator_input ->
411 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
414 (GrafiteTypes.status ->
415 ('term GrafiteAst.macro) disambiguator_input ->
416 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
419 GrafiteTypes.status ->
420 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
421 GrafiteTypes.status * UriManager.uri list
424 type 'a eval_from_moo =
425 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
427 let coercion_moo_statement_of (uri,arity) =
428 GrafiteAst.Coercion (HExtlib.dummy_floc, uri, false, arity)
430 let refinement_toolkit = {
431 RefinementTool.type_of_aux' =
432 (fun ?localization_tbl e c t u ->
433 let saved = !CicRefine.insert_coercions in
434 CicRefine.insert_coercions:= false;
437 let t, ty, metasenv, ugraph =
438 CicRefine.type_of_aux' ?localization_tbl e c t u in
439 RefinementTool.Success (t, ty, metasenv, ugraph)
441 | CicRefine.RefineFailure s
442 | CicRefine.Uncertain s
443 | CicRefine.AssertFailure s -> RefinementTool.Exception s
445 CicRefine.insert_coercions := saved;
447 RefinementTool.ppsubst = CicMetaSubst.ppsubst;
448 RefinementTool.apply_subst = CicMetaSubst.apply_subst;
449 RefinementTool.ppmetasenv = CicMetaSubst.ppmetasenv;
450 RefinementTool.pack_coercion_obj = CicRefine.pack_coercion_obj;
453 let eval_coercion status ~add_composites uri arity baseuri =
454 let status,compounds =
455 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri arity
459 List.map coercion_moo_statement_of ((uri,arity)::compounds)
461 let status = GrafiteTypes.add_moo_content moo_content status in
462 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
463 List.map fst compounds
465 let eval_tactical ~disambiguate_tactic status tac =
466 let apply_tactic = apply_tactic ~disambiguate_tactic in
467 let module MatitaStatus =
469 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
472 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
474 type tactic = input_status -> output_status
476 let id_tactic = apply_tactic ("",0,(GrafiteAst.IdTac HExtlib.dummy_floc))
477 let mk_tactic tac = tac
478 let apply_tactic tac = tac
479 let goals (_, opened, closed) = opened, closed
480 let set_goals (opened, closed) (status, _, _) = (status, opened, closed)
481 let get_stack (status, _) = GrafiteTypes.get_stack status
483 let get_status (status, goal) =
484 match status.GrafiteTypes.proof_status with
485 | GrafiteTypes.Incomplete_proof incomplete -> incomplete.GrafiteTypes.proof, goal
488 let get_proof (status, _, _) =
489 match status.GrafiteTypes.proof_status with
490 | GrafiteTypes.Incomplete_proof incomplete -> incomplete.GrafiteTypes.proof
493 let set_stack stack (status, opened, closed) =
494 GrafiteTypes.set_stack stack status, opened, closed
496 let inject (status, _) = (status, [], [])
497 let focus goal (status, _, _) = (status, goal)
500 let module MatitaTacticals = Tacticals.Make (MatitaStatus) in
501 let rec tactical_of_ast l (text,prefix_len,tac) =
502 let apply_tactic t = apply_tactic (text, prefix_len, t) in
503 let tactical_of_ast l t = tactical_of_ast l (text,prefix_len,t) in
505 | GrafiteAst.Tactic (loc, tactic) ->
506 MatitaTacticals.tactic (MatitaStatus.mk_tactic (apply_tactic tactic))
507 | GrafiteAst.Seq (loc, tacticals) -> (* tac1; tac2; ... *)
509 MatitaTacticals.seq ~tactics:(List.map (tactical_of_ast (l+1)) tacticals)
510 | GrafiteAst.Do (loc, n, tactical) ->
511 MatitaTacticals.do_tactic ~n ~tactic:(tactical_of_ast (l+1) tactical)
512 | GrafiteAst.Repeat (loc, tactical) ->
513 MatitaTacticals.repeat_tactic ~tactic:(tactical_of_ast (l+1) tactical)
514 | GrafiteAst.Then (loc, tactical, tacticals) -> (* tac; [ tac1 | ... ] *)
516 MatitaTacticals.thens ~start:(tactical_of_ast (l+1) tactical)
517 ~continuations:(List.map (tactical_of_ast (l+1)) tacticals)
518 | GrafiteAst.First (loc, tacticals) ->
519 MatitaTacticals.first
520 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
521 | GrafiteAst.Try (loc, tactical) ->
522 MatitaTacticals.try_tactic ~tactic:(tactical_of_ast (l+1) tactical)
523 | GrafiteAst.Solve (loc, tacticals) ->
524 MatitaTacticals.solve_tactics
525 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
526 | GrafiteAst.Progress (loc, tactical) ->
527 MatitaTacticals.progress_tactic ~tactic:(tactical_of_ast (l+1) tactical)
529 | GrafiteAst.Skip _loc -> MatitaTacticals.skip
530 | GrafiteAst.Dot _loc -> MatitaTacticals.dot
531 | GrafiteAst.Semicolon _loc -> MatitaTacticals.semicolon
532 | GrafiteAst.Branch _loc -> MatitaTacticals.branch
533 | GrafiteAst.Shift _loc -> MatitaTacticals.shift
534 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.pos i
535 | GrafiteAst.Merge _loc -> MatitaTacticals.merge
536 | GrafiteAst.Focus (_loc, goals) -> MatitaTacticals.focus goals
537 | GrafiteAst.Unfocus _loc -> MatitaTacticals.unfocus
538 | GrafiteAst.Wildcard _loc -> MatitaTacticals.wildcard
540 let status, _, _ = tactical_of_ast 0 tac (status, ~-1) in
541 let status = (* is proof completed? *)
542 match status.GrafiteTypes.proof_status with
543 | GrafiteTypes.Incomplete_proof
544 { GrafiteTypes.stack = stack; proof = proof }
545 when Continuationals.Stack.is_empty stack ->
546 { status with GrafiteTypes.proof_status = GrafiteTypes.Proof proof }
551 let eval_comment status c = status
553 (* since the record syntax allows to declare coercions, we have to put this
554 * information inside the moo *)
555 let add_coercions_of_record_to_moo obj lemmas status =
556 let attributes = CicUtil.attributes_of_obj obj in
557 let is_record = function `Class (`Record att) -> Some att | _-> None in
558 match HExtlib.list_findopt is_record attributes with
561 let is_a_coercion uri =
564 CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri in
565 let attrs = CicUtil.attributes_of_obj obj in
568 (function `Class (`Coercion _) -> true | _-> false) attrs
569 with `Class (`Coercion n) -> true,n | _ -> assert false
570 with Not_found -> false,0
571 with Not_found -> assert false
573 (* looking at the fields we can know the 'wanted' coercions, but not the
574 * actually generated ones. So, only the intersection between the wanted
575 * and the actual should be in the moo as coercion, while everithing in
576 * lemmas should go as aliases *)
577 let wanted_coercions =
580 | (name,true,arity) ->
582 (arity, UriManager.uri_of_string
583 (GrafiteTypes.qualify status name ^ ".con"))
587 (*prerr_endline "wanted coercions:";
589 (fun u -> prerr_endline (UriManager.string_of_uri u))
591 let coercions, moo_content =
595 let is_a_wanted_coercion,arity_wanted =
598 List.find (fun (n,u) -> UriManager.eq u uri)
602 with Not_found -> false, 0
604 let is_a_coercion, arity_coercion = is_a_coercion uri in
605 if is_a_coercion then
606 Some (uri, coercion_moo_statement_of (uri,arity_coercion))
607 else if is_a_wanted_coercion then
608 Some (uri, coercion_moo_statement_of (uri,arity_wanted))
613 (*prerr_endline "actual coercions:";
615 (fun u -> prerr_endline (UriManager.string_of_uri u))
617 prerr_endline "lemmas was:";
619 (fun u -> prerr_endline (UriManager.string_of_uri u))
621 let status = GrafiteTypes.add_moo_content moo_content status in
623 GrafiteTypes.coercions = coercions @ status.GrafiteTypes.coercions},
626 let add_obj uri obj status =
627 let status,lemmas = GrafiteSync.add_obj refinement_toolkit uri obj status in
630 let rec eval_command = {ec_go = fun ~disambiguate_command opts status
631 (text,prefix_len,cmd) ->
632 let status,cmd = disambiguate_command status (text,prefix_len,cmd) in
635 | GrafiteAst.Index (loc,None,uri) ->
636 assert false (* TODO: for user input *)
637 | GrafiteAst.Index (loc,Some key,uri) ->
638 let universe = Universe.index
639 status.GrafiteTypes.universe key (CicUtil.term_of_uri uri) in
640 let status = {status with GrafiteTypes.universe = universe} in
643 let candidates = Universe.get_candidates status.GrafiteTypes.universe key in
644 ("candidates for " ^ (CicPp.ppterm key) ^ " = " ^
645 (String.concat "\n" (List.map CicPp.ppterm candidates)))
649 let status = GrafiteTypes.add_moo_content [cmd] status in
651 | GrafiteAst.Coercion (loc, uri, add_composites, arity) ->
652 eval_coercion status ~add_composites uri arity
653 (GrafiteTypes.get_string_option status "baseuri")
654 | GrafiteAst.Default (loc, what, uris) as cmd ->
655 LibraryObjects.set_default what uris;
656 GrafiteTypes.add_moo_content [cmd] status,[]
657 | GrafiteAst.Drop loc -> raise Drop
658 | GrafiteAst.Include (loc, baseuri) ->
659 let moopath_rw, moopath_r =
660 LibraryMisc.obj_file_of_baseuri
661 ~must_exist:false ~baseuri ~writable:true,
662 LibraryMisc.obj_file_of_baseuri
663 ~must_exist:false ~baseuri ~writable:false
666 if Sys.file_exists moopath_r then moopath_r else
667 if Sys.file_exists moopath_rw then moopath_rw else
668 raise (IncludedFileNotCompiled (moopath_rw,baseuri))
670 let status = eval_from_moo.efm_go status moopath in
672 let lt_uri = UriManager.uri_of_string "cic:/matita/nat/orders/lt.con" in
673 let nat_uri = UriManager.uri_of_string "cic:/matita/nat/nat/nat.ind" in
674 let nat = Cic.MutInd(nat_uri,0,[]) in
675 let zero = Cic.MutConstruct(nat_uri,0,1,[]) in
676 let succ = Cic.MutConstruct(nat_uri,0,2,[]) in
677 let fake= Cic.Meta(-1,[]) in
678 let term= Cic.Appl [Cic.Const (lt_uri,[]);zero;Cic.Appl[succ;zero]] in let msg =
679 let candidates = Universe.get_candidates status.GrafiteTypes.universe term in
680 ("candidates for " ^ (CicPp.ppterm term) ^ " = " ^
681 (String.concat "\n" (List.map CicPp.ppterm candidates)))
686 | GrafiteAst.Print (_,"proofterm") ->
687 let _,_,p,_ = GrafiteTypes.get_current_proof status in
688 print_endline (AutoTactic.pp_proofterm p);
690 | GrafiteAst.Print (_,_) -> status,[]
691 | GrafiteAst.Qed loc ->
692 let uri, metasenv, bo, ty =
693 match status.GrafiteTypes.proof_status with
694 | GrafiteTypes.Proof (Some uri, metasenv, body, ty) ->
695 uri, metasenv, body, ty
696 | GrafiteTypes.Proof (None, metasenv, body, ty) ->
697 raise (GrafiteTypes.Command_error
698 ("Someone allows to start a theorem without giving the "^
699 "name/uri. This should be fixed!"))
702 (GrafiteTypes.Command_error "You can't Qed an incomplete theorem")
704 if metasenv <> [] then
706 (GrafiteTypes.Command_error
707 "Proof not completed! metasenv is not empty!");
708 let name = UriManager.name_of_uri uri in
709 let obj = Cic.Constant (name,Some bo,ty,[],[]) in
710 let status, lemmas = add_obj uri obj status in
712 GrafiteTypes.proof_status = GrafiteTypes.No_proof},
713 (*CSC: I throw away the arities *)
715 | GrafiteAst.Relation (loc, id, a, aeq, refl, sym, trans) ->
716 Setoids.add_relation id a aeq refl sym trans;
717 status, [] (*CSC: TO BE FIXED *)
718 | GrafiteAst.Set (loc, name, value) ->
719 if name = "baseuri" then begin
721 let v = Http_getter_misc.strip_trailing_slash value in
723 ignore (String.index v ' ');
724 GrafiteTypes.command_error "baseuri can't contain spaces"
727 if Http_getter_storage.is_read_only value then begin
728 HLog.error (sprintf "uri %s belongs to a read-only repository" value);
729 raise (ReadOnlyUri value)
731 if not (Http_getter_storage.is_empty value) &&
734 HLog.message ("baseuri " ^ value ^ " is not empty");
735 HLog.message ("cleaning baseuri " ^ value);
736 LibraryClean.clean_baseuris [value];
737 assert (Http_getter_storage.is_empty value);
739 if not (Helm_registry.get_opt_default Helm_registry.bool "matita.nodisk"
743 (Filename.dirname (Http_getter.filename ~writable:true (value ^
746 GrafiteTypes.set_option status name value,[]
747 | GrafiteAst.Obj (loc,obj) ->
750 Cic.Constant (name,_,_,_,_)
751 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
752 | Cic.InductiveDefinition (types,_,_,_) ->
754 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
755 | _ -> assert false in
757 UriManager.uri_of_string (GrafiteTypes.qualify status name ^ ext) in
758 let obj = CicRefine.pack_coercion_obj obj in
759 let metasenv = GrafiteTypes.get_proof_metasenv status in
761 | Cic.CurrentProof (_,metasenv',bo,ty,_,_) ->
762 let name = UriManager.name_of_uri uri in
763 if not(CicPp.check name ty) then
764 HLog.error ("Bad name: " ^ name);
765 if opts.do_heavy_checks then
767 let dbd = LibraryDb.instance () in
768 let similar = Whelp.match_term ~dbd ty in
769 let similar_len = List.length similar in
770 if similar_len> 30 then
772 ("Duplicate check will compare your theorem with " ^
773 string_of_int similar_len ^
774 " theorems, this may take a while."));
778 let t = CicUtil.term_of_uri u in
780 CicTypeChecker.type_of_aux'
781 metasenv' [] t CicUniv.empty_ugraph
783 fst(CicReduction.are_convertible [] ty' ty g))
786 (match convertible with
790 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
791 "\nPlease use a variant."));
793 let initial_proof = (Some uri, metasenv', bo, ty) in
794 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
795 { status with GrafiteTypes.proof_status =
796 GrafiteTypes.Incomplete_proof
797 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
800 if metasenv <> [] then
801 raise (GrafiteTypes.Command_error (
802 "metasenv not empty while giving a definition with body: " ^
803 CicMetaSubst.ppmetasenv [] metasenv));
804 let status, lemmas = add_obj uri obj status in
805 let status,new_lemmas =
806 add_coercions_of_record_to_moo obj lemmas status
808 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
809 uri::new_lemmas@lemmas
811 match status.GrafiteTypes.proof_status with
812 GrafiteTypes.Intermediate _ ->
813 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
816 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
817 ~disambiguate_macro opts status (text,prefix_len,ex) ->
819 | GrafiteAst.Tactical (_, tac, None) ->
820 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac),[]
821 | GrafiteAst.Tactical (_, tac, Some punct) ->
823 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac) in
824 eval_tactical ~disambiguate_tactic status (text,prefix_len,punct),[]
825 | GrafiteAst.Command (_, cmd) ->
826 eval_command.ec_go ~disambiguate_command opts status (text,prefix_len,cmd)
827 | GrafiteAst.Macro (loc, macro) ->
828 raise (Macro (loc,disambiguate_macro status (text,prefix_len,macro)))
830 } and eval_from_moo = {efm_go = fun status fname ->
832 ("",0,GrafiteAst.Executable (HExtlib.dummy_floc,
833 GrafiteAst.Command (HExtlib.dummy_floc,
836 let moo = GrafiteMarshal.load_moo fname in
839 let ast = ast_of_cmd ast in
842 ~disambiguate_tactic:(fun status _ (_,_,tactic) -> status,tactic)
843 ~disambiguate_command:(fun status (_,_,cmd) -> status,cmd)
844 ~disambiguate_macro:(fun _ _ -> assert false)
850 } and eval_ast = {ea_go = fun ~disambiguate_tactic ~disambiguate_command
851 ~disambiguate_macro ?(do_heavy_checks=false) ?(clean_baseuri=true) status
855 do_heavy_checks = do_heavy_checks ;
856 clean_baseuri = clean_baseuri }
859 | GrafiteAst.Executable (_,ex) ->
860 eval_executable.ee_go ~disambiguate_tactic ~disambiguate_command
861 ~disambiguate_macro opts status (text,prefix_len,ex)
862 | GrafiteAst.Comment (_,c) -> eval_comment status (text,prefix_len,c),[]
865 let eval_ast = eval_ast.ea_go