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.Replace (_, pattern, with_what) ->
155 Tactics.replace ~pattern ~with_what
156 | GrafiteAst.Rewrite (_, direction, t, pattern) ->
157 EqualityTactics.rewrite_tac ~direction ~pattern t
158 | GrafiteAst.Right _ -> Tactics.right
159 | GrafiteAst.Ring _ -> Tactics.ring
160 | GrafiteAst.Split _ -> Tactics.split
161 | GrafiteAst.Subst _ -> Tactics.subst
162 | GrafiteAst.Symmetry _ -> Tactics.symmetry
163 | GrafiteAst.Transitivity (_, term) -> Tactics.transitivity term
164 (* Implementazioni Aggiunte *)
165 | GrafiteAst.Assume (_, id, t) -> Declarative.assume id t
166 | GrafiteAst.Suppose (_, t, id, t1) -> Declarative.suppose t id t1
167 | GrafiteAst.By_term_we_proved (_, t, ty, id, t1) ->
168 Declarative.by_term_we_proved ~dbd:(LibraryDb.instance())
169 ~universe:status.GrafiteTypes.universe t ty id t1
170 | GrafiteAst.We_need_to_prove (_, t, id, t2) ->
171 Declarative.we_need_to_prove t id t2
172 | GrafiteAst.Bydone (_, t) ->
173 Declarative.bydone ~dbd:(LibraryDb.instance())
174 ~universe:status.GrafiteTypes.universe t
175 | GrafiteAst.We_proceed_by_induction_on (_, t, t1) ->
176 Declarative.we_proceed_by_induction_on t t1
177 | GrafiteAst.Byinduction (_, t, id) -> Declarative.byinduction t id
178 | GrafiteAst.Thesisbecomes (_, t) -> Declarative.thesisbecomes t
179 | GrafiteAst.ExistsElim (_, t, id1, t1, id2, t2) ->
180 Declarative.existselim t id1 t1 id2 t2
181 | GrafiteAst.Case (_,id,params) -> Declarative.case id params
182 | GrafiteAst.AndElim(_,t,id1,t1,id2,t2) -> Declarative.andelim t id1 t1 id2 t2
183 | GrafiteAst.RewritingStep (_,termine,t1,t2,cont) ->
184 Declarative.rewritingstep ~dbd:(LibraryDb.instance ())
185 ~universe:status.GrafiteTypes.universe termine t1 t2 cont
187 let classify_tactic tactic =
189 (* tactics that can't close the goal (return a goal we want to "select") *)
190 | GrafiteAst.Rewrite _
192 | GrafiteAst.Replace _
193 | GrafiteAst.Reduce _
195 | GrafiteAst.Generalize _
198 | GrafiteAst.Decompose _ -> true, true
199 (* tactics we don't want to reorder goals. I think only Goal needs this. *)
200 | GrafiteAst.Goal _ -> false, true
201 (* tactics like apply *)
204 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
205 let module PEH = ProofEngineHelpers in
206 (* let print_m name metasenv =
207 prerr_endline (">>>>> " ^ name);
208 prerr_endline (CicMetaSubst.ppmetasenv [] metasenv)
210 (* phase one calculates:
211 * new_goals_from_refine: goals added by refine
212 * head_goal: the first goal opened by ythe tactic
213 * other_goals: other goals opened by the tactic
215 let new_goals_from_refine = PEH.compare_metasenvs start refine in
216 let new_goals_from_tactic = PEH.compare_metasenvs refine tactic in
217 let head_goal, other_goals, goals =
219 | [] -> None,[],goals
221 (* assert (List.mem hd new_goals_from_tactic);
222 * invalidato dalla goal_tac
224 Some hd, List.filter ((<>) hd) new_goals_from_tactic, List.filter ((<>)
229 | None -> new_goals_from_refine @ other_goals
230 | Some x -> x :: new_goals_from_refine @ other_goals
232 (* extract the metas generated by refine and tactic *)
233 let metas_for_tactic_head =
236 | Some head_goal -> List.filter (fun (n,_,_) -> n = head_goal) tactic in
237 let metas_for_tactic_goals =
239 (fun x -> List.find (fun (metano,_,_) -> metano = x) tactic)
242 let metas_for_refine_goals =
243 List.filter (fun (n,_,_) -> List.mem n new_goals_from_refine) tactic in
244 let produced_metas, goals =
246 if always_opens_a_goal then
247 metas_for_tactic_head @ metas_for_refine_goals @
248 metas_for_tactic_goals
250 (* print_m "metas_for_refine_goals" metas_for_refine_goals;
251 print_m "metas_for_tactic_head" metas_for_tactic_head;
252 print_m "metas_for_tactic_goals" metas_for_tactic_goals; *)
253 metas_for_refine_goals @ metas_for_tactic_head @
254 metas_for_tactic_goals
257 let goals = List.map (fun (metano, _, _) -> metano) produced_metas in
258 produced_metas, goals
260 (* residual metas, preserving the original order *)
265 | (metano, _, _) :: tl when metano = e ->
266 [], List.map (fun (x,_,_) -> x) tl
267 | (metano, _, _) :: tl -> let b, a = split e tl in metano :: b, a
269 let find n metasenv =
271 Some (List.find (fun (metano, _, _) -> metano = n) metasenv)
272 with Not_found -> None
277 match find n tactic with
281 let before_l, after_l = split current_goal start in
283 List.filter (fun x -> not (List.mem x produced_goals)) before_l in
285 List.filter (fun x -> not (List.mem x produced_goals)) after_l in
286 let before = extract before_l in
287 let after = extract after_l in
291 print_m "BEGIN" start;
292 prerr_endline ("goal was: " ^ string_of_int current_goal);
293 prerr_endline ("and metas from refine are:");
295 (fun t -> prerr_string (" " ^ string_of_int t))
296 new_goals_from_refine;
298 print_m "before" before;
299 print_m "metas_for_tactic_head" metas_for_tactic_head;
300 print_m "metas_for_refine_goals" metas_for_refine_goals;
301 print_m "metas_for_tactic_goals" metas_for_tactic_goals;
302 print_m "produced_metas" produced_metas;
303 print_m "after" after;
304 |+ FINE DEBUG CODE +| *)
305 before @ produced_metas @ after, goals
307 let apply_tactic ~disambiguate_tactic (text,prefix_len,tactic) (status, goal) =
308 (* prerr_endline "apply_tactic"; *)
309 (* prerr_endline (Continuationals.Stack.pp (GrafiteTypes.get_stack status)); *)
310 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
311 let before = List.map (fun g, _, _ -> g) starting_metasenv in
312 (* prerr_endline "disambiguate"; *)
313 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
314 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
315 let proof = GrafiteTypes.get_current_proof status in
316 let proof_status = proof, goal in
317 let needs_reordering, always_opens_a_goal = classify_tactic tactic in
318 let tactic = tactic_of_ast status tactic in
319 (* apply tactic will change the lexicon_status ... *)
320 (* prerr_endline "apply_tactic bassa"; *)
321 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
322 let after = ProofEngineTypes.goals_of_proof proof in
323 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
324 (* prerr_endline("before: " ^ String.concat ", " (List.map string_of_int before));
325 prerr_endline("after: " ^ String.concat ", " (List.map string_of_int after));
326 prerr_endline("opened: " ^ String.concat ", " (List.map string_of_int opened)); *)
327 (* prerr_endline("opened_goals: " ^ String.concat ", " (List.map string_of_int opened_goals));
328 prerr_endline("closed_goals: " ^ String.concat ", " (List.map string_of_int closed_goals)); *)
329 let proof, opened_goals =
330 if needs_reordering then begin
331 let uri, metasenv_after_tactic, t, ty = proof in
332 (* prerr_endline ("goal prima del riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof))); *)
333 let reordered_metasenv, opened_goals =
336 metasenv_after_refinement metasenv_after_tactic
337 opened goal always_opens_a_goal
339 let proof' = uri, reordered_metasenv, t, ty in
340 (* prerr_endline ("goal dopo il riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof'))); *)
346 let incomplete_proof =
347 match status.GrafiteTypes.proof_status with
348 | GrafiteTypes.Incomplete_proof p -> p
351 { status with GrafiteTypes.proof_status =
352 GrafiteTypes.Incomplete_proof
353 { incomplete_proof with GrafiteTypes.proof = proof } },
354 opened_goals, closed_goals
358 'term 'lazy_term 'reduction 'obj 'ident.
360 (GrafiteTypes.status ->
361 ProofEngineTypes.goal ->
362 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
363 disambiguator_input ->
364 GrafiteTypes.status *
365 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
367 disambiguate_command:
368 (GrafiteTypes.status ->
369 (('term,'obj) GrafiteAst.command) disambiguator_input ->
370 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
373 (GrafiteTypes.status ->
374 ('term GrafiteAst.macro) disambiguator_input ->
375 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
377 ?do_heavy_checks:bool ->
378 ?clean_baseuri:bool ->
379 GrafiteTypes.status ->
380 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
381 disambiguator_input ->
382 GrafiteTypes.status * UriManager.uri list
385 type 'a eval_command =
387 disambiguate_command:
388 (GrafiteTypes.status -> (('term,'obj) GrafiteAst.command) disambiguator_input ->
389 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
390 options -> GrafiteTypes.status ->
391 (('term,'obj) GrafiteAst.command) disambiguator_input ->
392 GrafiteTypes.status * UriManager.uri list
395 type 'a eval_executable =
396 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
398 (GrafiteTypes.status ->
399 ProofEngineTypes.goal ->
400 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
401 disambiguator_input ->
402 GrafiteTypes.status *
403 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
405 disambiguate_command:
406 (GrafiteTypes.status ->
407 (('term,'obj) GrafiteAst.command) disambiguator_input ->
408 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
411 (GrafiteTypes.status ->
412 ('term GrafiteAst.macro) disambiguator_input ->
413 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
416 GrafiteTypes.status ->
417 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
418 GrafiteTypes.status * UriManager.uri list
421 type 'a eval_from_moo =
422 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
424 let coercion_moo_statement_of arity uri =
425 GrafiteAst.Coercion (HExtlib.dummy_floc, uri, false, arity)
427 let refinement_toolkit = {
428 RefinementTool.type_of_aux' =
429 (fun ?localization_tbl e c t u ->
430 let saved = !CicRefine.insert_coercions in
431 CicRefine.insert_coercions:= false;
434 let t, ty, metasenv, ugraph =
435 CicRefine.type_of_aux' ?localization_tbl e c t u in
436 RefinementTool.Success (t, ty, metasenv, ugraph)
438 | CicRefine.RefineFailure s
439 | CicRefine.Uncertain s
440 | CicRefine.AssertFailure s -> RefinementTool.Exception s
442 CicRefine.insert_coercions := saved;
444 RefinementTool.ppsubst = CicMetaSubst.ppsubst;
445 RefinementTool.apply_subst = CicMetaSubst.apply_subst;
446 RefinementTool.ppmetasenv = CicMetaSubst.ppmetasenv;
447 RefinementTool.pack_coercion_obj = CicRefine.pack_coercion_obj;
450 let eval_coercion status ~add_composites uri arity baseuri =
451 let status,compounds =
452 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri arity
456 List.map (coercion_moo_statement_of arity) (uri::compounds)
458 let status = GrafiteTypes.add_moo_content moo_content status in
459 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
462 let eval_tactical ~disambiguate_tactic status tac =
463 let apply_tactic = apply_tactic ~disambiguate_tactic in
464 let module MatitaStatus =
466 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
469 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
471 type tactic = input_status -> output_status
473 let id_tactic = apply_tactic ("",0,(GrafiteAst.IdTac HExtlib.dummy_floc))
474 let mk_tactic tac = tac
475 let apply_tactic tac = tac
476 let goals (_, opened, closed) = opened, closed
477 let set_goals (opened, closed) (status, _, _) = (status, opened, closed)
478 let get_stack (status, _) = GrafiteTypes.get_stack status
480 let get_status (status, goal) =
481 match status.GrafiteTypes.proof_status with
482 | GrafiteTypes.Incomplete_proof incomplete -> incomplete.GrafiteTypes.proof, goal
485 let get_proof (status, _, _) =
486 match status.GrafiteTypes.proof_status with
487 | GrafiteTypes.Incomplete_proof incomplete -> incomplete.GrafiteTypes.proof
490 let set_stack stack (status, opened, closed) =
491 GrafiteTypes.set_stack stack status, opened, closed
493 let inject (status, _) = (status, [], [])
494 let focus goal (status, _, _) = (status, goal)
497 let module MatitaTacticals = Tacticals.Make (MatitaStatus) in
498 let rec tactical_of_ast l (text,prefix_len,tac) =
499 let apply_tactic t = apply_tactic (text, prefix_len, t) in
500 let tactical_of_ast l t = tactical_of_ast l (text,prefix_len,t) in
502 | GrafiteAst.Tactic (loc, tactic) ->
503 MatitaTacticals.tactic (MatitaStatus.mk_tactic (apply_tactic tactic))
504 | GrafiteAst.Seq (loc, tacticals) -> (* tac1; tac2; ... *)
506 MatitaTacticals.seq ~tactics:(List.map (tactical_of_ast (l+1)) tacticals)
507 | GrafiteAst.Do (loc, n, tactical) ->
508 MatitaTacticals.do_tactic ~n ~tactic:(tactical_of_ast (l+1) tactical)
509 | GrafiteAst.Repeat (loc, tactical) ->
510 MatitaTacticals.repeat_tactic ~tactic:(tactical_of_ast (l+1) tactical)
511 | GrafiteAst.Then (loc, tactical, tacticals) -> (* tac; [ tac1 | ... ] *)
513 MatitaTacticals.thens ~start:(tactical_of_ast (l+1) tactical)
514 ~continuations:(List.map (tactical_of_ast (l+1)) tacticals)
515 | GrafiteAst.First (loc, tacticals) ->
516 MatitaTacticals.first
517 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
518 | GrafiteAst.Try (loc, tactical) ->
519 MatitaTacticals.try_tactic ~tactic:(tactical_of_ast (l+1) tactical)
520 | GrafiteAst.Solve (loc, tacticals) ->
521 MatitaTacticals.solve_tactics
522 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
523 | GrafiteAst.Progress (loc, tactical) ->
524 MatitaTacticals.progress_tactic ~tactic:(tactical_of_ast (l+1) tactical)
526 | GrafiteAst.Skip _loc -> MatitaTacticals.skip
527 | GrafiteAst.Dot _loc -> MatitaTacticals.dot
528 | GrafiteAst.Semicolon _loc -> MatitaTacticals.semicolon
529 | GrafiteAst.Branch _loc -> MatitaTacticals.branch
530 | GrafiteAst.Shift _loc -> MatitaTacticals.shift
531 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.pos i
532 | GrafiteAst.Merge _loc -> MatitaTacticals.merge
533 | GrafiteAst.Focus (_loc, goals) -> MatitaTacticals.focus goals
534 | GrafiteAst.Unfocus _loc -> MatitaTacticals.unfocus
535 | GrafiteAst.Wildcard _loc -> MatitaTacticals.wildcard
537 let status, _, _ = tactical_of_ast 0 tac (status, ~-1) in
538 let status = (* is proof completed? *)
539 match status.GrafiteTypes.proof_status with
540 | GrafiteTypes.Incomplete_proof
541 { GrafiteTypes.stack = stack; proof = proof }
542 when Continuationals.Stack.is_empty stack ->
543 { status with GrafiteTypes.proof_status = GrafiteTypes.Proof proof }
548 let eval_comment status c = status
550 (* since the record syntax allows to declare coercions, we have to put this
551 * information inside the moo *)
552 let add_coercions_of_record_to_moo obj lemmas status =
553 let attributes = CicUtil.attributes_of_obj obj in
554 let is_record = function `Class (`Record att) -> Some att | _-> None in
555 match HExtlib.list_findopt is_record attributes with
558 let is_a_coercion uri =
561 CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri in
562 let attrs = CicUtil.attributes_of_obj obj in
565 (function `Class (`Coercion _) -> true | _-> false) attrs
566 with `Class (`Coercion n) -> true,n | _ -> assert false
567 with Not_found -> false,0
568 with Not_found -> assert false
570 (* looking at the fields we can know the 'wanted' coercions, but not the
571 * actually generated ones. So, only the intersection between the wanted
572 * and the actual should be in the moo as coercion, while everithing in
573 * lemmas should go as aliases *)
574 let wanted_coercions =
577 | (name,true,arity) ->
579 (arity, UriManager.uri_of_string
580 (GrafiteTypes.qualify status name ^ ".con"))
584 (*prerr_endline "wanted coercions:";
586 (fun u -> prerr_endline (UriManager.string_of_uri u))
588 let coercions, moo_content =
592 let is_a_wanted_coercion,arity_wanted =
595 List.find (fun (n,u) -> UriManager.eq u uri)
599 with Not_found -> false, 0
601 let is_a_coercion, arity_coercion = is_a_coercion uri in
602 if is_a_coercion then
603 Some (uri, coercion_moo_statement_of arity_coercion uri)
604 else if is_a_wanted_coercion then
605 Some (uri, coercion_moo_statement_of arity_wanted uri)
610 (*prerr_endline "actual coercions:";
612 (fun u -> prerr_endline (UriManager.string_of_uri u))
614 prerr_endline "lemmas was:";
616 (fun u -> prerr_endline (UriManager.string_of_uri u))
618 let status = GrafiteTypes.add_moo_content moo_content status in
620 GrafiteTypes.coercions = coercions @ status.GrafiteTypes.coercions},
623 let add_obj uri obj status =
624 let status,lemmas = GrafiteSync.add_obj refinement_toolkit uri obj status in
627 let rec eval_command = {ec_go = fun ~disambiguate_command opts status
628 (text,prefix_len,cmd) ->
629 let status,cmd = disambiguate_command status (text,prefix_len,cmd) in
632 | GrafiteAst.Index (loc,None,uri) ->
633 assert false (* TODO: for user input *)
634 | GrafiteAst.Index (loc,Some key,uri) ->
635 let universe = Universe.index
636 status.GrafiteTypes.universe key (CicUtil.term_of_uri uri) in
637 let status = {status with GrafiteTypes.universe = universe} in
640 let candidates = Universe.get_candidates status.GrafiteTypes.universe key in
641 ("candidates for " ^ (CicPp.ppterm key) ^ " = " ^
642 (String.concat "\n" (List.map CicPp.ppterm candidates)))
646 let status = GrafiteTypes.add_moo_content [cmd] status in
648 | GrafiteAst.Coercion (loc, uri, add_composites, arity) ->
649 eval_coercion status ~add_composites uri arity
650 (GrafiteTypes.get_string_option status "baseuri")
651 | GrafiteAst.Default (loc, what, uris) as cmd ->
652 LibraryObjects.set_default what uris;
653 GrafiteTypes.add_moo_content [cmd] status,[]
654 | GrafiteAst.Drop loc -> raise Drop
655 | GrafiteAst.Include (loc, baseuri) ->
656 let moopath_rw, moopath_r =
657 LibraryMisc.obj_file_of_baseuri
658 ~must_exist:false ~baseuri ~writable:true,
659 LibraryMisc.obj_file_of_baseuri
660 ~must_exist:false ~baseuri ~writable:false
663 if Sys.file_exists moopath_r then moopath_r else
664 if Sys.file_exists moopath_rw then moopath_rw else
665 raise (IncludedFileNotCompiled (moopath_rw,baseuri))
667 let status = eval_from_moo.efm_go status moopath in
669 let lt_uri = UriManager.uri_of_string "cic:/matita/nat/orders/lt.con" in
670 let nat_uri = UriManager.uri_of_string "cic:/matita/nat/nat/nat.ind" in
671 let nat = Cic.MutInd(nat_uri,0,[]) in
672 let zero = Cic.MutConstruct(nat_uri,0,1,[]) in
673 let succ = Cic.MutConstruct(nat_uri,0,2,[]) in
674 let fake= Cic.Meta(-1,[]) in
675 let term= Cic.Appl [Cic.Const (lt_uri,[]);zero;Cic.Appl[succ;zero]] in let msg =
676 let candidates = Universe.get_candidates status.GrafiteTypes.universe term in
677 ("candidates for " ^ (CicPp.ppterm term) ^ " = " ^
678 (String.concat "\n" (List.map CicPp.ppterm candidates)))
683 | GrafiteAst.Print (_,"proofterm") ->
684 let _,_,p,_ = GrafiteTypes.get_current_proof status in
685 print_endline (AutoTactic.pp_proofterm p);
687 | GrafiteAst.Print (_,_) -> status,[]
688 | GrafiteAst.Qed loc ->
689 let uri, metasenv, bo, ty =
690 match status.GrafiteTypes.proof_status with
691 | GrafiteTypes.Proof (Some uri, metasenv, body, ty) ->
692 uri, metasenv, body, ty
693 | GrafiteTypes.Proof (None, metasenv, body, ty) ->
694 raise (GrafiteTypes.Command_error
695 ("Someone allows to start a theorem without giving the "^
696 "name/uri. This should be fixed!"))
699 (GrafiteTypes.Command_error "You can't Qed an incomplete theorem")
701 if metasenv <> [] then
703 (GrafiteTypes.Command_error
704 "Proof not completed! metasenv is not empty!");
705 let name = UriManager.name_of_uri uri in
706 let obj = Cic.Constant (name,Some bo,ty,[],[]) in
707 let status, lemmas = add_obj uri obj status in
709 GrafiteTypes.proof_status = GrafiteTypes.No_proof},
711 | GrafiteAst.Relation (loc, id, a, aeq, refl, sym, trans) ->
712 Setoids.add_relation id a aeq refl sym trans;
713 status, [] (*CSC: TO BE FIXED *)
714 | GrafiteAst.Set (loc, name, value) ->
715 if name = "baseuri" then begin
717 let v = Http_getter_misc.strip_trailing_slash value in
719 ignore (String.index v ' ');
720 GrafiteTypes.command_error "baseuri can't contain spaces"
723 if Http_getter_storage.is_read_only value then begin
724 HLog.error (sprintf "uri %s belongs to a read-only repository" value);
725 raise (ReadOnlyUri value)
727 if not (Http_getter_storage.is_empty value) &&
730 HLog.message ("baseuri " ^ value ^ " is not empty");
731 HLog.message ("cleaning baseuri " ^ value);
732 LibraryClean.clean_baseuris [value];
733 assert (Http_getter_storage.is_empty value);
735 if not (Helm_registry.get_opt_default Helm_registry.bool "matita.nodisk"
739 (Filename.dirname (Http_getter.filename ~writable:true (value ^
742 GrafiteTypes.set_option status name value,[]
743 | GrafiteAst.Obj (loc,obj) ->
746 Cic.Constant (name,_,_,_,_)
747 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
748 | Cic.InductiveDefinition (types,_,_,_) ->
750 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
751 | _ -> assert false in
753 UriManager.uri_of_string (GrafiteTypes.qualify status name ^ ext) in
754 let obj = CicRefine.pack_coercion_obj obj in
755 let metasenv = GrafiteTypes.get_proof_metasenv status in
757 | Cic.CurrentProof (_,metasenv',bo,ty,_,_) ->
758 let name = UriManager.name_of_uri uri in
759 if not(CicPp.check name ty) then
760 HLog.error ("Bad name: " ^ name);
761 if opts.do_heavy_checks then
763 let dbd = LibraryDb.instance () in
764 let similar = Whelp.match_term ~dbd ty in
765 let similar_len = List.length similar in
766 if similar_len> 30 then
768 ("Duplicate check will compare your theorem with " ^
769 string_of_int similar_len ^
770 " theorems, this may take a while."));
774 let t = CicUtil.term_of_uri u in
776 CicTypeChecker.type_of_aux'
777 metasenv' [] t CicUniv.empty_ugraph
779 fst(CicReduction.are_convertible [] ty' ty g))
782 (match convertible with
786 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
787 "\nPlease use a variant."));
789 let initial_proof = (Some uri, metasenv', bo, ty) in
790 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
791 { status with GrafiteTypes.proof_status =
792 GrafiteTypes.Incomplete_proof
793 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
796 if metasenv <> [] then
797 raise (GrafiteTypes.Command_error (
798 "metasenv not empty while giving a definition with body: " ^
799 CicMetaSubst.ppmetasenv [] metasenv));
800 let status, lemmas = add_obj uri obj status in
801 let status,new_lemmas =
802 add_coercions_of_record_to_moo obj lemmas status
804 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
805 uri::new_lemmas@lemmas
807 match status.GrafiteTypes.proof_status with
808 GrafiteTypes.Intermediate _ ->
809 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
812 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
813 ~disambiguate_macro opts status (text,prefix_len,ex) ->
815 | GrafiteAst.Tactical (_, tac, None) ->
816 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac),[]
817 | GrafiteAst.Tactical (_, tac, Some punct) ->
819 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac) in
820 eval_tactical ~disambiguate_tactic status (text,prefix_len,punct),[]
821 | GrafiteAst.Command (_, cmd) ->
822 eval_command.ec_go ~disambiguate_command opts status (text,prefix_len,cmd)
823 | GrafiteAst.Macro (loc, macro) ->
824 raise (Macro (loc,disambiguate_macro status (text,prefix_len,macro)))
826 } and eval_from_moo = {efm_go = fun status fname ->
828 ("",0,GrafiteAst.Executable (HExtlib.dummy_floc,
829 GrafiteAst.Command (HExtlib.dummy_floc,
832 let moo = GrafiteMarshal.load_moo fname in
835 let ast = ast_of_cmd ast in
838 ~disambiguate_tactic:(fun status _ (_,_,tactic) -> status,tactic)
839 ~disambiguate_command:(fun status (_,_,cmd) -> status,cmd)
840 ~disambiguate_macro:(fun _ _ -> assert false)
846 } and eval_ast = {ea_go = fun ~disambiguate_tactic ~disambiguate_command
847 ~disambiguate_macro ?(do_heavy_checks=false) ?(clean_baseuri=true) status
851 do_heavy_checks = do_heavy_checks ;
852 clean_baseuri = clean_baseuri }
855 | GrafiteAst.Executable (_,ex) ->
856 eval_executable.ee_go ~disambiguate_tactic ~disambiguate_command
857 ~disambiguate_macro opts status (text,prefix_len,ex)
858 | GrafiteAst.Comment (_,c) -> eval_comment status (text,prefix_len,c),[]
861 let eval_ast = eval_ast.ea_go