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.Change (_, pattern, with_what) ->
72 Tactics.change ~pattern with_what
73 | GrafiteAst.Clear (_,id) -> Tactics.clear id
74 | GrafiteAst.ClearBody (_,id) -> Tactics.clearbody id
75 | GrafiteAst.Contradiction _ -> Tactics.contradiction
76 | GrafiteAst.Constructor (_, n) -> Tactics.constructor n
77 | GrafiteAst.Cut (_, ident, term) ->
78 let names = match ident with None -> [] | Some id -> [id] in
79 Tactics.cut ~mk_fresh_name_callback:(namer_of names) term
80 | GrafiteAst.Decompose (_, types, what, names) ->
81 let to_type = function
82 | GrafiteAst.Type (uri, typeno) -> uri, typeno
83 | GrafiteAst.Ident _ -> assert false
85 let user_types = List.rev_map to_type types in
86 let dbd = LibraryDb.instance () in
87 let mk_fresh_name_callback = namer_of names in
88 Tactics.decompose ~mk_fresh_name_callback ~dbd ~user_types ?what
89 | GrafiteAst.Demodulate _ -> Tactics.demodulate ~dbd:(LibraryDb.instance ())
90 | GrafiteAst.Destruct (_,term) -> Tactics.destruct term
91 | GrafiteAst.Elim (_, what, using, depth, names) ->
92 Tactics.elim_intros ?using ?depth ~mk_fresh_name_callback:(namer_of names)
94 | GrafiteAst.ElimType (_, what, using, depth, names) ->
95 Tactics.elim_type ?using ?depth ~mk_fresh_name_callback:(namer_of names)
97 | GrafiteAst.Exact (_, term) -> Tactics.exact term
98 | GrafiteAst.Exists _ -> Tactics.exists
99 | GrafiteAst.Fail _ -> Tactics.fail
100 | GrafiteAst.Fold (_, reduction_kind, term, pattern) ->
102 match reduction_kind with
104 PET.const_lazy_reduction
105 (CicReduction.normalize ~delta:false ~subst:[])
106 | `Reduce -> PET.const_lazy_reduction ProofEngineReduction.reduce
107 | `Simpl -> PET.const_lazy_reduction ProofEngineReduction.simpl
109 PET.const_lazy_reduction (ProofEngineReduction.unfold ?what:None)
110 | `Unfold (Some lazy_term) ->
111 (fun context metasenv ugraph ->
112 let what, metasenv, ugraph = lazy_term context metasenv ugraph in
113 ProofEngineReduction.unfold ~what, metasenv, ugraph)
115 PET.const_lazy_reduction (CicReduction.whd ~delta:false ~subst:[])
117 Tactics.fold ~reduction ~term ~pattern
118 | GrafiteAst.Fourier _ -> Tactics.fourier
119 | GrafiteAst.FwdSimpl (_, hyp, names) ->
120 Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names)
121 ~dbd:(LibraryDb.instance ()) hyp
122 | GrafiteAst.Generalize (_,pattern,ident) ->
123 let names = match ident with None -> [] | Some id -> [id] in
124 Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern
125 | GrafiteAst.Goal (_, n) -> Tactics.set_goal n
126 | GrafiteAst.IdTac _ -> Tactics.id
127 | GrafiteAst.Intros (_, None, names) ->
128 PrimitiveTactics.intros_tac ~mk_fresh_name_callback:(namer_of names) ()
129 | GrafiteAst.Intros (_, Some num, names) ->
130 PrimitiveTactics.intros_tac ~howmany:num
131 ~mk_fresh_name_callback:(namer_of names) ()
132 | GrafiteAst.Inversion (_, term) ->
133 Tactics.inversion term
134 | GrafiteAst.LApply (_, linear, how_many, to_what, what, ident) ->
135 let names = match ident with None -> [] | Some id -> [id] in
136 Tactics.lapply ~mk_fresh_name_callback:(namer_of names)
137 ~linear ?how_many ~to_what what
138 | GrafiteAst.Left _ -> Tactics.left
139 | GrafiteAst.LetIn (loc,term,name) ->
140 Tactics.letin term ~mk_fresh_name_callback:(namer_of [name])
141 | GrafiteAst.Reduce (_, reduction_kind, pattern) ->
142 (match reduction_kind with
143 | `Normalize -> Tactics.normalize ~pattern
144 | `Reduce -> Tactics.reduce ~pattern
145 | `Simpl -> Tactics.simpl ~pattern
146 | `Unfold what -> Tactics.unfold ~pattern what
147 | `Whd -> Tactics.whd ~pattern)
148 | GrafiteAst.Reflexivity _ -> Tactics.reflexivity
149 | GrafiteAst.Replace (_, pattern, with_what) ->
150 Tactics.replace ~pattern ~with_what
151 | GrafiteAst.Rewrite (_, direction, t, pattern) ->
152 EqualityTactics.rewrite_tac ~direction ~pattern t
153 | GrafiteAst.Right _ -> Tactics.right
154 | GrafiteAst.Ring _ -> Tactics.ring
155 | GrafiteAst.Split _ -> Tactics.split
156 | GrafiteAst.Subst _ -> Tactics.subst
157 | GrafiteAst.Symmetry _ -> Tactics.symmetry
158 | GrafiteAst.Transitivity (_, term) -> Tactics.transitivity term
159 (* Implementazioni Aggiunte *)
160 | GrafiteAst.Assume (_, id, t) -> Declarative.assume id t
161 | GrafiteAst.Suppose (_, t, id, t1) -> Declarative.suppose t id t1
162 | GrafiteAst.By_term_we_proved (_, t, ty, id, t1) ->
163 Declarative.by_term_we_proved ~dbd:(LibraryDb.instance())
164 ~universe:status.GrafiteTypes.universe t ty id t1
165 | GrafiteAst.We_need_to_prove (_, t, id, t2) ->
166 Declarative.we_need_to_prove t id t2
167 | GrafiteAst.Bydone (_, t) ->
168 Declarative.bydone ~dbd:(LibraryDb.instance())
169 ~universe:status.GrafiteTypes.universe t
170 | GrafiteAst.We_proceed_by_induction_on (_, t, t1) ->
171 Declarative.we_proceed_by_induction_on t t1
172 | GrafiteAst.Byinduction (_, t, id) -> Declarative.byinduction t id
173 | GrafiteAst.Thesisbecomes (_, t) -> Declarative.thesisbecomes t
174 | GrafiteAst.ExistsElim (_, t, id1, t1, id2, t2) ->
175 Declarative.existselim t id1 t1 id2 t2
176 | GrafiteAst.Case (_,id,params) -> Declarative.case id params
177 | GrafiteAst.AndElim(_,t,id1,t1,id2,t2) -> Declarative.andelim t id1 t1 id2 t2
178 | GrafiteAst.RewritingStep (_,termine,t1,t2,cont) ->
179 Declarative.rewritingstep ~dbd:(LibraryDb.instance ())
180 ~universe:status.GrafiteTypes.universe termine t1 t2 cont
182 let classify_tactic tactic =
184 (* tactics that can't close the goal (return a goal we want to "select") *)
185 | GrafiteAst.Rewrite _
187 | GrafiteAst.Replace _
188 | GrafiteAst.Reduce _
190 | GrafiteAst.Generalize _
193 | GrafiteAst.Decompose _ -> true, true
194 (* tactics we don't want to reorder goals. I think only Goal needs this. *)
195 | GrafiteAst.Goal _ -> false, true
196 (* tactics like apply *)
199 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
200 let module PEH = ProofEngineHelpers in
201 (* let print_m name metasenv =
202 prerr_endline (">>>>> " ^ name);
203 prerr_endline (CicMetaSubst.ppmetasenv [] metasenv)
205 (* phase one calculates:
206 * new_goals_from_refine: goals added by refine
207 * head_goal: the first goal opened by ythe tactic
208 * other_goals: other goals opened by the tactic
210 let new_goals_from_refine = PEH.compare_metasenvs start refine in
211 let new_goals_from_tactic = PEH.compare_metasenvs refine tactic in
212 let head_goal, other_goals, goals =
214 | [] -> None,[],goals
216 (* assert (List.mem hd new_goals_from_tactic);
217 * invalidato dalla goal_tac
219 Some hd, List.filter ((<>) hd) new_goals_from_tactic, List.filter ((<>)
224 | None -> new_goals_from_refine @ other_goals
225 | Some x -> x :: new_goals_from_refine @ other_goals
227 (* extract the metas generated by refine and tactic *)
228 let metas_for_tactic_head =
231 | Some head_goal -> List.filter (fun (n,_,_) -> n = head_goal) tactic in
232 let metas_for_tactic_goals =
234 (fun x -> List.find (fun (metano,_,_) -> metano = x) tactic)
237 let metas_for_refine_goals =
238 List.filter (fun (n,_,_) -> List.mem n new_goals_from_refine) tactic in
239 let produced_metas, goals =
241 if always_opens_a_goal then
242 metas_for_tactic_head @ metas_for_refine_goals @
243 metas_for_tactic_goals
245 (* print_m "metas_for_refine_goals" metas_for_refine_goals;
246 print_m "metas_for_tactic_head" metas_for_tactic_head;
247 print_m "metas_for_tactic_goals" metas_for_tactic_goals; *)
248 metas_for_refine_goals @ metas_for_tactic_head @
249 metas_for_tactic_goals
252 let goals = List.map (fun (metano, _, _) -> metano) produced_metas in
253 produced_metas, goals
255 (* residual metas, preserving the original order *)
260 | (metano, _, _) :: tl when metano = e ->
261 [], List.map (fun (x,_,_) -> x) tl
262 | (metano, _, _) :: tl -> let b, a = split e tl in metano :: b, a
264 let find n metasenv =
266 Some (List.find (fun (metano, _, _) -> metano = n) metasenv)
267 with Not_found -> None
272 match find n tactic with
276 let before_l, after_l = split current_goal start in
278 List.filter (fun x -> not (List.mem x produced_goals)) before_l in
280 List.filter (fun x -> not (List.mem x produced_goals)) after_l in
281 let before = extract before_l in
282 let after = extract after_l in
286 print_m "BEGIN" start;
287 prerr_endline ("goal was: " ^ string_of_int current_goal);
288 prerr_endline ("and metas from refine are:");
290 (fun t -> prerr_string (" " ^ string_of_int t))
291 new_goals_from_refine;
293 print_m "before" before;
294 print_m "metas_for_tactic_head" metas_for_tactic_head;
295 print_m "metas_for_refine_goals" metas_for_refine_goals;
296 print_m "metas_for_tactic_goals" metas_for_tactic_goals;
297 print_m "produced_metas" produced_metas;
298 print_m "after" after;
299 |+ FINE DEBUG CODE +| *)
300 before @ produced_metas @ after, goals
302 let apply_tactic ~disambiguate_tactic (text,prefix_len,tactic) (status, goal) =
303 (* prerr_endline "apply_tactic"; *)
304 (* prerr_endline (Continuationals.Stack.pp (GrafiteTypes.get_stack status)); *)
305 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
306 let before = List.map (fun g, _, _ -> g) starting_metasenv in
307 (* prerr_endline "disambiguate"; *)
308 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
309 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
310 let proof = GrafiteTypes.get_current_proof status in
311 let proof_status = proof, goal in
312 let needs_reordering, always_opens_a_goal = classify_tactic tactic in
313 let tactic = tactic_of_ast status tactic in
314 (* apply tactic will change the lexicon_status ... *)
315 (* prerr_endline "apply_tactic bassa"; *)
316 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
317 let after = ProofEngineTypes.goals_of_proof proof in
318 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
319 (* prerr_endline("before: " ^ String.concat ", " (List.map string_of_int before));
320 prerr_endline("after: " ^ String.concat ", " (List.map string_of_int after));
321 prerr_endline("opened: " ^ String.concat ", " (List.map string_of_int opened)); *)
322 (* prerr_endline("opened_goals: " ^ String.concat ", " (List.map string_of_int opened_goals));
323 prerr_endline("closed_goals: " ^ String.concat ", " (List.map string_of_int closed_goals)); *)
324 let proof, opened_goals =
325 if needs_reordering then begin
326 let uri, metasenv_after_tactic, t, ty = proof in
327 (* prerr_endline ("goal prima del riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof))); *)
328 let reordered_metasenv, opened_goals =
331 metasenv_after_refinement metasenv_after_tactic
332 opened goal always_opens_a_goal
334 let proof' = uri, reordered_metasenv, t, ty in
335 (* prerr_endline ("goal dopo il riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof'))); *)
341 let incomplete_proof =
342 match status.GrafiteTypes.proof_status with
343 | GrafiteTypes.Incomplete_proof p -> p
346 { status with GrafiteTypes.proof_status =
347 GrafiteTypes.Incomplete_proof
348 { incomplete_proof with GrafiteTypes.proof = proof } },
349 opened_goals, closed_goals
353 'term 'lazy_term 'reduction 'obj 'ident.
355 (GrafiteTypes.status ->
356 ProofEngineTypes.goal ->
357 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
358 disambiguator_input ->
359 GrafiteTypes.status *
360 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
362 disambiguate_command:
363 (GrafiteTypes.status ->
364 (('term,'obj) GrafiteAst.command) disambiguator_input ->
365 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
368 (GrafiteTypes.status ->
369 ('term GrafiteAst.macro) disambiguator_input ->
370 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
372 ?do_heavy_checks:bool ->
373 ?clean_baseuri:bool ->
374 GrafiteTypes.status ->
375 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
376 disambiguator_input ->
377 GrafiteTypes.status * UriManager.uri list
380 type 'a eval_command =
382 disambiguate_command:
383 (GrafiteTypes.status -> (('term,'obj) GrafiteAst.command) disambiguator_input ->
384 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
385 options -> GrafiteTypes.status ->
386 (('term,'obj) GrafiteAst.command) disambiguator_input ->
387 GrafiteTypes.status * UriManager.uri list
390 type 'a eval_executable =
391 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
393 (GrafiteTypes.status ->
394 ProofEngineTypes.goal ->
395 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
396 disambiguator_input ->
397 GrafiteTypes.status *
398 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
400 disambiguate_command:
401 (GrafiteTypes.status ->
402 (('term,'obj) GrafiteAst.command) disambiguator_input ->
403 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
406 (GrafiteTypes.status ->
407 ('term GrafiteAst.macro) disambiguator_input ->
408 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
411 GrafiteTypes.status ->
412 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
413 GrafiteTypes.status * UriManager.uri list
416 type 'a eval_from_moo =
417 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
419 let coercion_moo_statement_of arity uri =
420 GrafiteAst.Coercion (HExtlib.dummy_floc, uri, false, arity)
422 let refinement_toolkit = {
423 RefinementTool.type_of_aux' =
424 (fun ?localization_tbl e c t u ->
425 let saved = !CicRefine.insert_coercions in
426 CicRefine.insert_coercions:= false;
429 let t, ty, metasenv, ugraph =
430 CicRefine.type_of_aux' ?localization_tbl e c t u in
431 RefinementTool.Success (t, ty, metasenv, ugraph)
433 | CicRefine.RefineFailure s
434 | CicRefine.Uncertain s
435 | CicRefine.AssertFailure s -> RefinementTool.Exception s
437 CicRefine.insert_coercions := saved;
439 RefinementTool.ppsubst = CicMetaSubst.ppsubst;
440 RefinementTool.apply_subst = CicMetaSubst.apply_subst;
441 RefinementTool.ppmetasenv = CicMetaSubst.ppmetasenv;
442 RefinementTool.pack_coercion_obj = CicRefine.pack_coercion_obj;
445 let eval_coercion status ~add_composites uri arity =
446 let status,compounds =
447 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri arity
450 List.map (coercion_moo_statement_of arity) (uri::compounds)
452 let status = GrafiteTypes.add_moo_content moo_content status in
453 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
456 let eval_tactical ~disambiguate_tactic status tac =
457 let apply_tactic = apply_tactic ~disambiguate_tactic in
458 let module MatitaStatus =
460 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
463 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
465 type tactic = input_status -> output_status
467 let id_tactic = apply_tactic ("",0,(GrafiteAst.IdTac HExtlib.dummy_floc))
468 let mk_tactic tac = tac
469 let apply_tactic tac = tac
470 let goals (_, opened, closed) = opened, closed
471 let set_goals (opened, closed) (status, _, _) = (status, opened, closed)
472 let get_stack (status, _) = GrafiteTypes.get_stack status
474 let get_status (status, goal) =
475 match status.GrafiteTypes.proof_status with
476 | GrafiteTypes.Incomplete_proof incomplete -> incomplete.GrafiteTypes.proof, goal
479 let get_proof (status, _, _) =
480 match status.GrafiteTypes.proof_status with
481 | GrafiteTypes.Incomplete_proof incomplete -> incomplete.GrafiteTypes.proof
484 let set_stack stack (status, opened, closed) =
485 GrafiteTypes.set_stack stack status, opened, closed
487 let inject (status, _) = (status, [], [])
488 let focus goal (status, _, _) = (status, goal)
491 let module MatitaTacticals = Tacticals.Make (MatitaStatus) in
492 let rec tactical_of_ast l (text,prefix_len,tac) =
493 let apply_tactic t = apply_tactic (text, prefix_len, t) in
494 let tactical_of_ast l t = tactical_of_ast l (text,prefix_len,t) in
496 | GrafiteAst.Tactic (loc, tactic) ->
497 MatitaTacticals.tactic (MatitaStatus.mk_tactic (apply_tactic tactic))
498 | GrafiteAst.Seq (loc, tacticals) -> (* tac1; tac2; ... *)
500 MatitaTacticals.seq ~tactics:(List.map (tactical_of_ast (l+1)) tacticals)
501 | GrafiteAst.Do (loc, n, tactical) ->
502 MatitaTacticals.do_tactic ~n ~tactic:(tactical_of_ast (l+1) tactical)
503 | GrafiteAst.Repeat (loc, tactical) ->
504 MatitaTacticals.repeat_tactic ~tactic:(tactical_of_ast (l+1) tactical)
505 | GrafiteAst.Then (loc, tactical, tacticals) -> (* tac; [ tac1 | ... ] *)
507 MatitaTacticals.thens ~start:(tactical_of_ast (l+1) tactical)
508 ~continuations:(List.map (tactical_of_ast (l+1)) tacticals)
509 | GrafiteAst.First (loc, tacticals) ->
510 MatitaTacticals.first
511 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
512 | GrafiteAst.Try (loc, tactical) ->
513 MatitaTacticals.try_tactic ~tactic:(tactical_of_ast (l+1) tactical)
514 | GrafiteAst.Solve (loc, tacticals) ->
515 MatitaTacticals.solve_tactics
516 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
517 | GrafiteAst.Progress (loc, tactical) ->
518 MatitaTacticals.progress_tactic ~tactic:(tactical_of_ast (l+1) tactical)
520 | GrafiteAst.Skip _loc -> MatitaTacticals.skip
521 | GrafiteAst.Dot _loc -> MatitaTacticals.dot
522 | GrafiteAst.Semicolon _loc -> MatitaTacticals.semicolon
523 | GrafiteAst.Branch _loc -> MatitaTacticals.branch
524 | GrafiteAst.Shift _loc -> MatitaTacticals.shift
525 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.pos i
526 | GrafiteAst.Merge _loc -> MatitaTacticals.merge
527 | GrafiteAst.Focus (_loc, goals) -> MatitaTacticals.focus goals
528 | GrafiteAst.Unfocus _loc -> MatitaTacticals.unfocus
529 | GrafiteAst.Wildcard _loc -> MatitaTacticals.wildcard
531 let status, _, _ = tactical_of_ast 0 tac (status, ~-1) in
532 let status = (* is proof completed? *)
533 match status.GrafiteTypes.proof_status with
534 | GrafiteTypes.Incomplete_proof
535 { GrafiteTypes.stack = stack; proof = proof }
536 when Continuationals.Stack.is_empty stack ->
537 { status with GrafiteTypes.proof_status = GrafiteTypes.Proof proof }
542 let eval_comment status c = status
544 (* since the record syntax allows to declare coercions, we have to put this
545 * information inside the moo *)
546 let add_coercions_of_record_to_moo obj lemmas status =
547 let attributes = CicUtil.attributes_of_obj obj in
548 let is_record = function `Class (`Record att) -> Some att | _-> None in
549 match HExtlib.list_findopt is_record attributes with
552 let is_a_coercion uri =
555 CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri in
556 let attrs = CicUtil.attributes_of_obj obj in
559 (function `Class (`Coercion _) -> true | _-> false) attrs
560 with `Class (`Coercion n) -> true,n | _ -> assert false
561 with Not_found -> false,0
562 with Not_found -> assert false
564 (* looking at the fields we can know the 'wanted' coercions, but not the
565 * actually generated ones. So, only the intersection between the wanted
566 * and the actual should be in the moo as coercion, while everithing in
567 * lemmas should go as aliases *)
568 let wanted_coercions =
571 | (name,true,arity) ->
573 (arity, UriManager.uri_of_string
574 (GrafiteTypes.qualify status name ^ ".con"))
578 (*prerr_endline "wanted coercions:";
580 (fun u -> prerr_endline (UriManager.string_of_uri u))
582 let coercions, moo_content =
586 let is_a_wanted_coercion,arity_wanted =
589 List.find (fun (n,u) -> UriManager.eq u uri)
593 with Not_found -> false, 0
595 let is_a_coercion, arity_coercion = is_a_coercion uri in
596 if is_a_coercion then
597 Some (uri, coercion_moo_statement_of arity_coercion uri)
598 else if is_a_wanted_coercion then
599 Some (uri, coercion_moo_statement_of arity_wanted uri)
604 (*prerr_endline "actual coercions:";
606 (fun u -> prerr_endline (UriManager.string_of_uri u))
608 prerr_endline "lemmas was:";
610 (fun u -> prerr_endline (UriManager.string_of_uri u))
612 let status = GrafiteTypes.add_moo_content moo_content status in
614 GrafiteTypes.coercions = coercions @ status.GrafiteTypes.coercions},
617 let add_obj uri obj status =
618 let status,lemmas = GrafiteSync.add_obj refinement_toolkit uri obj status in
621 let rec eval_command = {ec_go = fun ~disambiguate_command opts status
622 (text,prefix_len,cmd) ->
623 let status,cmd = disambiguate_command status (text,prefix_len,cmd) in
626 | GrafiteAst.Index (loc,None,uri) ->
627 assert false (* TODO: for user input *)
628 | GrafiteAst.Index (loc,Some key,uri) ->
629 let universe = Universe.index
630 status.GrafiteTypes.universe key (CicUtil.term_of_uri uri) in
631 let status = {status with GrafiteTypes.universe = universe} in
634 let candidates = Universe.get_candidates status.GrafiteTypes.universe key in
635 ("candidates for " ^ (CicPp.ppterm key) ^ " = " ^
636 (String.concat "\n" (List.map CicPp.ppterm candidates)))
640 let status = GrafiteTypes.add_moo_content [cmd] status in
642 | GrafiteAst.Coercion (loc, uri, add_composites, arity) ->
643 eval_coercion status ~add_composites uri arity
644 | GrafiteAst.Default (loc, what, uris) as cmd ->
645 LibraryObjects.set_default what uris;
646 GrafiteTypes.add_moo_content [cmd] status,[]
647 | GrafiteAst.Drop loc -> raise Drop
648 | GrafiteAst.Include (loc, baseuri) ->
649 let moopath_rw, moopath_r =
650 LibraryMisc.obj_file_of_baseuri
651 ~must_exist:false ~baseuri ~writable:true,
652 LibraryMisc.obj_file_of_baseuri
653 ~must_exist:false ~baseuri ~writable:false
656 if Sys.file_exists moopath_r then moopath_r else
657 if Sys.file_exists moopath_rw then moopath_rw else
658 raise (IncludedFileNotCompiled (moopath_rw,baseuri))
660 let status = eval_from_moo.efm_go status moopath in
662 let lt_uri = UriManager.uri_of_string "cic:/matita/nat/orders/lt.con" in
663 let nat_uri = UriManager.uri_of_string "cic:/matita/nat/nat/nat.ind" in
664 let nat = Cic.MutInd(nat_uri,0,[]) in
665 let zero = Cic.MutConstruct(nat_uri,0,1,[]) in
666 let succ = Cic.MutConstruct(nat_uri,0,2,[]) in
667 let fake= Cic.Meta(-1,[]) in
668 let term= Cic.Appl [Cic.Const (lt_uri,[]);zero;Cic.Appl[succ;zero]] in let msg =
669 let candidates = Universe.get_candidates status.GrafiteTypes.universe term in
670 ("candidates for " ^ (CicPp.ppterm term) ^ " = " ^
671 (String.concat "\n" (List.map CicPp.ppterm candidates)))
676 | GrafiteAst.Print (_,"proofterm") ->
677 let _,_,p,_ = GrafiteTypes.get_current_proof status in
678 print_endline (AutoTactic.pp_proofterm p);
680 | GrafiteAst.Print (_,_) -> status,[]
681 | GrafiteAst.Qed loc ->
682 let uri, metasenv, bo, ty =
683 match status.GrafiteTypes.proof_status with
684 | GrafiteTypes.Proof (Some uri, metasenv, body, ty) ->
685 uri, metasenv, body, ty
686 | GrafiteTypes.Proof (None, metasenv, body, ty) ->
687 raise (GrafiteTypes.Command_error
688 ("Someone allows to start a theorem without giving the "^
689 "name/uri. This should be fixed!"))
692 (GrafiteTypes.Command_error "You can't Qed an incomplete theorem")
694 if metasenv <> [] then
696 (GrafiteTypes.Command_error
697 "Proof not completed! metasenv is not empty!");
698 let name = UriManager.name_of_uri uri in
699 let obj = Cic.Constant (name,Some bo,ty,[],[]) in
700 let status, lemmas = add_obj uri obj status in
702 GrafiteTypes.proof_status = GrafiteTypes.No_proof},
704 | GrafiteAst.Relation (loc, id, a, aeq, refl, sym, trans) ->
705 Setoids.add_relation id a aeq refl sym trans;
706 status, [] (*CSC: TO BE FIXED *)
707 | GrafiteAst.Set (loc, name, value) ->
708 if name = "baseuri" then begin
710 let v = Http_getter_misc.strip_trailing_slash value in
712 ignore (String.index v ' ');
713 GrafiteTypes.command_error "baseuri can't contain spaces"
716 if Http_getter_storage.is_read_only value then begin
717 HLog.error (sprintf "uri %s belongs to a read-only repository" value);
718 raise (ReadOnlyUri value)
720 if not (Http_getter_storage.is_empty value) &&
723 HLog.message ("baseuri " ^ value ^ " is not empty");
724 HLog.message ("cleaning baseuri " ^ value);
725 LibraryClean.clean_baseuris [value];
726 assert (Http_getter_storage.is_empty value);
728 if not (Helm_registry.get_opt_default Helm_registry.bool "matita.nodisk"
732 (Filename.dirname (Http_getter.filename ~writable:true (value ^
735 GrafiteTypes.set_option status name value,[]
736 | GrafiteAst.Obj (loc,obj) ->
739 Cic.Constant (name,_,_,_,_)
740 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
741 | Cic.InductiveDefinition (types,_,_,_) ->
743 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
744 | _ -> assert false in
746 UriManager.uri_of_string (GrafiteTypes.qualify status name ^ ext) in
747 let obj = CicRefine.pack_coercion_obj obj in
748 let metasenv = GrafiteTypes.get_proof_metasenv status in
750 | Cic.CurrentProof (_,metasenv',bo,ty,_,_) ->
751 let name = UriManager.name_of_uri uri in
752 if not(CicPp.check name ty) then
753 HLog.error ("Bad name: " ^ name);
754 if opts.do_heavy_checks then
756 let dbd = LibraryDb.instance () in
757 let similar = Whelp.match_term ~dbd ty in
758 let similar_len = List.length similar in
759 if similar_len> 30 then
761 ("Duplicate check will compare your theorem with " ^
762 string_of_int similar_len ^
763 " theorems, this may take a while."));
767 let t = CicUtil.term_of_uri u in
769 CicTypeChecker.type_of_aux'
770 metasenv' [] t CicUniv.empty_ugraph
772 fst(CicReduction.are_convertible [] ty' ty g))
775 (match convertible with
779 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
780 "\nPlease use a variant."));
782 let initial_proof = (Some uri, metasenv', bo, ty) in
783 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
784 { status with GrafiteTypes.proof_status =
785 GrafiteTypes.Incomplete_proof
786 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
789 if metasenv <> [] then
790 raise (GrafiteTypes.Command_error (
791 "metasenv not empty while giving a definition with body: " ^
792 CicMetaSubst.ppmetasenv [] metasenv));
793 let status, lemmas = add_obj uri obj status in
794 let status,new_lemmas =
795 add_coercions_of_record_to_moo obj lemmas status
797 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
798 uri::new_lemmas@lemmas
800 match status.GrafiteTypes.proof_status with
801 GrafiteTypes.Intermediate _ ->
802 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
805 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
806 ~disambiguate_macro opts status (text,prefix_len,ex) ->
808 | GrafiteAst.Tactical (_, tac, None) ->
809 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac),[]
810 | GrafiteAst.Tactical (_, tac, Some punct) ->
812 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac) in
813 eval_tactical ~disambiguate_tactic status (text,prefix_len,punct),[]
814 | GrafiteAst.Command (_, cmd) ->
815 eval_command.ec_go ~disambiguate_command opts status (text,prefix_len,cmd)
816 | GrafiteAst.Macro (loc, macro) ->
817 raise (Macro (loc,disambiguate_macro status (text,prefix_len,macro)))
819 } and eval_from_moo = {efm_go = fun status fname ->
821 ("",0,GrafiteAst.Executable (HExtlib.dummy_floc,
822 GrafiteAst.Command (HExtlib.dummy_floc,
825 let moo = GrafiteMarshal.load_moo fname in
828 let ast = ast_of_cmd ast in
831 ~disambiguate_tactic:(fun status _ (_,_,tactic) -> status,tactic)
832 ~disambiguate_command:(fun status (_,_,cmd) -> status,cmd)
833 ~disambiguate_macro:(fun _ _ -> assert false)
839 } and eval_ast = {ea_go = fun ~disambiguate_tactic ~disambiguate_command
840 ~disambiguate_macro ?(do_heavy_checks=false) ?(clean_baseuri=true) status
844 do_heavy_checks = do_heavy_checks ;
845 clean_baseuri = clean_baseuri }
848 | GrafiteAst.Executable (_,ex) ->
849 eval_executable.ee_go ~disambiguate_tactic ~disambiguate_command
850 ~disambiguate_macro opts status (text,prefix_len,ex)
851 | GrafiteAst.Comment (_,c) -> eval_comment status (text,prefix_len,c),[]
854 let eval_ast = eval_ast.ea_go