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/
29 (* mo file name, ma file name *)
30 exception IncludedFileNotCompiled of string * string
33 (Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro)
34 exception ReadOnlyUri of string
36 type 'a disambiguator_input = string * int * 'a
39 do_heavy_checks: bool ;
43 (** create a ProofEngineTypes.mk_fresh_name_type function which uses given
44 * names as long as they are available, then it fallbacks to name generation
45 * using FreshNamesGenerator module *)
47 let len = List.length names in
49 fun metasenv context name ~typ ->
50 if !count < len then begin
51 let name = match List.nth names !count with
52 | Some s -> Cic.Name s
53 | None -> Cic.Anonymous
58 FreshNamesGenerator.mk_fresh_name ~subst:[] metasenv context name ~typ
60 let rec tactic_of_ast status ast =
61 let module PET = ProofEngineTypes in
63 (* Higher order tactics *)
64 | GrafiteAst.Do (loc, n, tactic) ->
65 Tacticals.do_tactic n (tactic_of_ast status tactic)
66 | GrafiteAst.Seq (loc, tactics) -> (* tac1; tac2; ... *)
67 Tacticals.seq (List.map (tactic_of_ast status) tactics)
68 | GrafiteAst.Repeat (loc, tactic) ->
69 Tacticals.repeat_tactic (tactic_of_ast status tactic)
70 | GrafiteAst.Then (loc, tactic, tactics) -> (* tac; [ tac1 | ... ] *)
72 (tactic_of_ast status tactic)
73 (List.map (tactic_of_ast status) tactics)
74 | GrafiteAst.First (loc, tactics) ->
75 Tacticals.first (List.map (tactic_of_ast status) tactics)
76 | GrafiteAst.Try (loc, tactic) ->
77 Tacticals.try_tactic (tactic_of_ast status tactic)
78 | GrafiteAst.Solve (loc, tactics) ->
79 Tacticals.solve_tactics (List.map (tactic_of_ast status) tactics)
80 | GrafiteAst.Progress (loc, tactic) ->
81 Tacticals.progress_tactic (tactic_of_ast status tactic)
82 (* First order tactics *)
83 | GrafiteAst.Absurd (_, term) -> Tactics.absurd term
84 | GrafiteAst.Apply (_, term) -> Tactics.apply term
85 | GrafiteAst.ApplyS (_, term, params) ->
86 Tactics.applyS ~term ~params ~dbd:(LibraryDb.instance ())
87 ~universe:status.GrafiteTypes.universe
88 | GrafiteAst.Assumption _ -> Tactics.assumption
89 | GrafiteAst.Auto (_,params) ->
90 AutoTactic.auto_tac ~params ~dbd:(LibraryDb.instance ())
91 ~universe:status.GrafiteTypes.universe
92 | GrafiteAst.Cases (_, what, (howmany, names)) ->
93 Tactics.cases_intros ?howmany ~mk_fresh_name_callback:(namer_of names)
95 | GrafiteAst.Change (_, pattern, with_what) ->
96 Tactics.change ~pattern with_what
97 | GrafiteAst.Clear (_,id) -> Tactics.clear id
98 | GrafiteAst.ClearBody (_,id) -> Tactics.clearbody id
99 | GrafiteAst.Contradiction _ -> Tactics.contradiction
100 | GrafiteAst.Constructor (_, n) -> Tactics.constructor n
101 | GrafiteAst.Cut (_, ident, term) ->
102 let names = match ident with None -> [] | Some id -> [Some id] in
103 Tactics.cut ~mk_fresh_name_callback:(namer_of names) term
104 | GrafiteAst.Decompose (_, names) ->
105 let mk_fresh_name_callback = namer_of names in
106 Tactics.decompose ~mk_fresh_name_callback ()
107 | GrafiteAst.Demodulate _ ->
109 ~dbd:(LibraryDb.instance ()) ~universe:status.GrafiteTypes.universe
110 | GrafiteAst.Destruct (_,term) -> Tactics.destruct term
111 | GrafiteAst.Elim (_, what, using, pattern, (depth, names)) ->
112 Tactics.elim_intros ?using ?depth ~mk_fresh_name_callback:(namer_of names)
114 | GrafiteAst.ElimType (_, what, using, (depth, names)) ->
115 Tactics.elim_type ?using ?depth ~mk_fresh_name_callback:(namer_of names)
117 | GrafiteAst.Exact (_, term) -> Tactics.exact term
118 | GrafiteAst.Exists _ -> Tactics.exists
119 | GrafiteAst.Fail _ -> Tactics.fail
120 | GrafiteAst.Fold (_, reduction_kind, term, pattern) ->
122 match reduction_kind with
124 PET.const_lazy_reduction
125 (CicReduction.normalize ~delta:false ~subst:[])
126 | `Reduce -> PET.const_lazy_reduction ProofEngineReduction.reduce
127 | `Simpl -> PET.const_lazy_reduction ProofEngineReduction.simpl
129 PET.const_lazy_reduction (ProofEngineReduction.unfold ?what:None)
130 | `Unfold (Some lazy_term) ->
131 (fun context metasenv ugraph ->
132 let what, metasenv, ugraph = lazy_term context metasenv ugraph in
133 ProofEngineReduction.unfold ~what, metasenv, ugraph)
135 PET.const_lazy_reduction (CicReduction.whd ~delta:false ~subst:[])
137 Tactics.fold ~reduction ~term ~pattern
138 | GrafiteAst.Fourier _ -> Tactics.fourier
139 | GrafiteAst.FwdSimpl (_, hyp, names) ->
140 Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names)
141 ~dbd:(LibraryDb.instance ()) hyp
142 | GrafiteAst.Generalize (_,pattern,ident) ->
143 let names = match ident with None -> [] | Some id -> [Some id] in
144 Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern
145 | GrafiteAst.IdTac _ -> Tactics.id
146 | GrafiteAst.Intros (_, (howmany, names)) ->
147 PrimitiveTactics.intros_tac ?howmany
148 ~mk_fresh_name_callback:(namer_of names) ()
149 | GrafiteAst.Inversion (_, term) ->
150 Tactics.inversion term
151 | GrafiteAst.LApply (_, linear, how_many, to_what, what, ident) ->
152 let names = match ident with None -> [] | Some id -> [Some id] in
153 Tactics.lapply ~mk_fresh_name_callback:(namer_of names)
154 ~linear ?how_many ~to_what what
155 | GrafiteAst.Left _ -> Tactics.left
156 | GrafiteAst.LetIn (loc,term,name) ->
157 Tactics.letin term ~mk_fresh_name_callback:(namer_of [Some name])
158 | GrafiteAst.Reduce (_, reduction_kind, pattern) ->
159 (match reduction_kind with
160 | `Normalize -> Tactics.normalize ~pattern
161 | `Reduce -> Tactics.reduce ~pattern
162 | `Simpl -> Tactics.simpl ~pattern
163 | `Unfold what -> Tactics.unfold ~pattern what
164 | `Whd -> Tactics.whd ~pattern)
165 | GrafiteAst.Reflexivity _ -> Tactics.reflexivity
166 | GrafiteAst.Replace (_, pattern, with_what) ->
167 Tactics.replace ~pattern ~with_what
168 | GrafiteAst.Rewrite (_, direction, t, pattern, names) ->
169 EqualityTactics.rewrite_tac ~direction ~pattern t
170 (* to be replaced with ~mk_fresh_name_callback:(namer_of names) *)
171 (List.map (function Some s -> s | None -> assert false) names)
172 | GrafiteAst.Right _ -> Tactics.right
173 | GrafiteAst.Ring _ -> Tactics.ring
174 | GrafiteAst.Split _ -> Tactics.split
175 | GrafiteAst.Subst _ -> Tactics.subst
176 | GrafiteAst.Symmetry _ -> Tactics.symmetry
177 | GrafiteAst.Transitivity (_, term) -> Tactics.transitivity term
178 (* Implementazioni Aggiunte *)
179 | GrafiteAst.Assume (_, id, t) -> Declarative.assume id t
180 | GrafiteAst.Suppose (_, t, id, t1) -> Declarative.suppose t id t1
181 | GrafiteAst.By_term_we_proved (_, t, ty, id, t1) ->
182 Declarative.by_term_we_proved ~dbd:(LibraryDb.instance())
183 ~universe:status.GrafiteTypes.universe t ty id t1
184 | GrafiteAst.We_need_to_prove (_, t, id, t2) ->
185 Declarative.we_need_to_prove t id t2
186 | GrafiteAst.Bydone (_, t) ->
187 Declarative.bydone ~dbd:(LibraryDb.instance())
188 ~universe:status.GrafiteTypes.universe t
189 | GrafiteAst.We_proceed_by_cases_on (_, t, t1) ->
190 Declarative.we_proceed_by_cases_on t t1
191 | GrafiteAst.We_proceed_by_induction_on (_, t, t1) ->
192 Declarative.we_proceed_by_induction_on t t1
193 | GrafiteAst.Byinduction (_, t, id) -> Declarative.byinduction t id
194 | GrafiteAst.Thesisbecomes (_, t) -> Declarative.thesisbecomes t
195 | GrafiteAst.ExistsElim (_, t, id1, t1, id2, t2) ->
196 Declarative.existselim ~dbd:(LibraryDb.instance())
197 ~universe:status.GrafiteTypes.universe t id1 t1 id2 t2
198 | GrafiteAst.Case (_,id,params) -> Declarative.case id params
199 | GrafiteAst.AndElim(_,t,id1,t1,id2,t2) -> Declarative.andelim t id1 t1 id2 t2
200 | GrafiteAst.RewritingStep (_,termine,t1,t2,cont) ->
201 Declarative.rewritingstep ~dbd:(LibraryDb.instance ())
202 ~universe:status.GrafiteTypes.universe termine t1 t2 cont
204 let classify_tactic tactic =
206 (* tactics that can't close the goal (return a goal we want to "select") *)
207 | GrafiteAst.Rewrite _
209 | GrafiteAst.Replace _
210 | GrafiteAst.Reduce _
212 | GrafiteAst.Generalize _
215 | GrafiteAst.Decompose _ -> true
216 (* tactics like apply *)
219 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
220 let module PEH = ProofEngineHelpers in
221 (* let print_m name metasenv =
222 prerr_endline (">>>>> " ^ name);
223 prerr_endline (CicMetaSubst.ppmetasenv [] metasenv)
225 (* phase one calculates:
226 * new_goals_from_refine: goals added by refine
227 * head_goal: the first goal opened by ythe tactic
228 * other_goals: other goals opened by the tactic
230 let new_goals_from_refine = PEH.compare_metasenvs start refine in
231 let new_goals_from_tactic = PEH.compare_metasenvs refine tactic in
232 let head_goal, other_goals, goals =
234 | [] -> None,[],goals
236 (* assert (List.mem hd new_goals_from_tactic);
237 * invalidato dalla goal_tac
239 Some hd, List.filter ((<>) hd) new_goals_from_tactic, List.filter ((<>)
244 | None -> new_goals_from_refine @ other_goals
245 | Some x -> x :: new_goals_from_refine @ other_goals
247 (* extract the metas generated by refine and tactic *)
248 let metas_for_tactic_head =
251 | Some head_goal -> List.filter (fun (n,_,_) -> n = head_goal) tactic in
252 let metas_for_tactic_goals =
254 (fun x -> List.find (fun (metano,_,_) -> metano = x) tactic)
257 let metas_for_refine_goals =
258 List.filter (fun (n,_,_) -> List.mem n new_goals_from_refine) tactic in
259 let produced_metas, goals =
261 if always_opens_a_goal then
262 metas_for_tactic_head @ metas_for_refine_goals @
263 metas_for_tactic_goals
265 (* print_m "metas_for_refine_goals" metas_for_refine_goals;
266 print_m "metas_for_tactic_head" metas_for_tactic_head;
267 print_m "metas_for_tactic_goals" metas_for_tactic_goals; *)
268 metas_for_refine_goals @ metas_for_tactic_head @
269 metas_for_tactic_goals
272 let goals = List.map (fun (metano, _, _) -> metano) produced_metas in
273 produced_metas, goals
275 (* residual metas, preserving the original order *)
280 | (metano, _, _) :: tl when metano = e ->
281 [], List.map (fun (x,_,_) -> x) tl
282 | (metano, _, _) :: tl -> let b, a = split e tl in metano :: b, a
284 let find n metasenv =
286 Some (List.find (fun (metano, _, _) -> metano = n) metasenv)
287 with Not_found -> None
292 match find n tactic with
296 let before_l, after_l = split current_goal start in
298 List.filter (fun x -> not (List.mem x produced_goals)) before_l in
300 List.filter (fun x -> not (List.mem x produced_goals)) after_l in
301 let before = extract before_l in
302 let after = extract after_l in
306 print_m "BEGIN" start;
307 prerr_endline ("goal was: " ^ string_of_int current_goal);
308 prerr_endline ("and metas from refine are:");
310 (fun t -> prerr_string (" " ^ string_of_int t))
311 new_goals_from_refine;
313 print_m "before" before;
314 print_m "metas_for_tactic_head" metas_for_tactic_head;
315 print_m "metas_for_refine_goals" metas_for_refine_goals;
316 print_m "metas_for_tactic_goals" metas_for_tactic_goals;
317 print_m "produced_metas" produced_metas;
318 print_m "after" after;
319 |+ FINE DEBUG CODE +| *)
320 before @ produced_metas @ after, goals
322 let apply_tactic ~disambiguate_tactic (text,prefix_len,tactic) (status, goal) =
323 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
324 let before = List.map (fun g, _, _ -> g) starting_metasenv in
325 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
326 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
327 let proof = GrafiteTypes.get_current_proof status in
328 let proof_status = proof, goal in
329 let always_opens_a_goal = classify_tactic tactic in
330 let tactic = tactic_of_ast status tactic in
331 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
332 let after = ProofEngineTypes.goals_of_proof proof in
333 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
334 let proof, opened_goals =
335 let uri, metasenv_after_tactic, _subst, t, ty, attrs = proof in
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, _subst, t, ty, attrs in
345 let incomplete_proof =
346 match status.GrafiteTypes.proof_status with
347 | GrafiteTypes.Incomplete_proof p -> p
350 { status with GrafiteTypes.proof_status =
351 GrafiteTypes.Incomplete_proof
352 { incomplete_proof with GrafiteTypes.proof = proof } },
353 opened_goals, closed_goals
355 let apply_atomic_tactical ~disambiguate_tactic ~patch (text,prefix_len,tactic) (status, goal) =
356 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
357 let before = List.map (fun g, _, _ -> g) starting_metasenv in
358 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
359 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
360 let proof = GrafiteTypes.get_current_proof status in
361 let proof_status = proof, goal in
362 let always_opens_a_goal = classify_tactic tactic in
363 let tactic = tactic_of_ast status tactic in
364 let tactic = patch tactic in
365 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
366 let after = ProofEngineTypes.goals_of_proof proof in
367 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
368 let proof, opened_goals =
369 let uri, metasenv_after_tactic, _subst, t, ty, attrs = proof in
370 let reordered_metasenv, opened_goals =
373 metasenv_after_refinement metasenv_after_tactic
374 opened goal always_opens_a_goal
376 let proof' = uri, reordered_metasenv, _subst, t, ty, attrs in
379 let incomplete_proof =
380 match status.GrafiteTypes.proof_status with
381 | GrafiteTypes.Incomplete_proof p -> p
384 { status with GrafiteTypes.proof_status =
385 GrafiteTypes.Incomplete_proof
386 { incomplete_proof with GrafiteTypes.proof = proof } },
387 opened_goals, closed_goals
390 'term 'lazy_term 'reduction 'obj 'ident.
392 (GrafiteTypes.status ->
393 ProofEngineTypes.goal ->
394 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
395 disambiguator_input ->
396 GrafiteTypes.status *
397 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
399 disambiguate_command:
400 (GrafiteTypes.status ->
401 (('term,'obj) GrafiteAst.command) disambiguator_input ->
402 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
405 (GrafiteTypes.status ->
406 ('term GrafiteAst.macro) disambiguator_input ->
407 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
409 ?do_heavy_checks:bool ->
410 ?clean_baseuri:bool ->
411 GrafiteTypes.status ->
412 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
413 disambiguator_input ->
414 GrafiteTypes.status * UriManager.uri list
417 type 'a eval_command =
419 disambiguate_command:
420 (GrafiteTypes.status -> (('term,'obj) GrafiteAst.command) disambiguator_input ->
421 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
422 options -> GrafiteTypes.status ->
423 (('term,'obj) GrafiteAst.command) disambiguator_input ->
424 GrafiteTypes.status * UriManager.uri list
427 type 'a eval_executable =
428 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
430 (GrafiteTypes.status ->
431 ProofEngineTypes.goal ->
432 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
433 disambiguator_input ->
434 GrafiteTypes.status *
435 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
437 disambiguate_command:
438 (GrafiteTypes.status ->
439 (('term,'obj) GrafiteAst.command) disambiguator_input ->
440 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
443 (GrafiteTypes.status ->
444 ('term GrafiteAst.macro) disambiguator_input ->
445 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
448 GrafiteTypes.status ->
449 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
450 GrafiteTypes.status * UriManager.uri list
453 type 'a eval_from_moo =
454 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
456 let coercion_moo_statement_of (uri,arity) =
457 GrafiteAst.Coercion (HExtlib.dummy_floc, uri, false, arity)
459 let refinement_toolkit = {
460 RefinementTool.type_of_aux' =
461 (fun ?localization_tbl e c t u ->
462 let saved = !CicRefine.insert_coercions in
463 CicRefine.insert_coercions:= false;
466 let t, ty, metasenv, ugraph =
467 CicRefine.type_of_aux' ?localization_tbl e c t u in
468 RefinementTool.Success (t, ty, metasenv, ugraph)
470 | CicRefine.RefineFailure s
471 | CicRefine.Uncertain s
472 | CicRefine.AssertFailure s -> RefinementTool.Exception s
474 CicRefine.insert_coercions := saved;
476 RefinementTool.ppsubst = CicMetaSubst.ppsubst;
477 RefinementTool.apply_subst = CicMetaSubst.apply_subst;
478 RefinementTool.ppmetasenv = CicMetaSubst.ppmetasenv;
479 RefinementTool.pack_coercion_obj = CicRefine.pack_coercion_obj;
482 let eval_coercion status ~add_composites uri arity baseuri =
483 let status,compounds =
484 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri arity
488 List.map coercion_moo_statement_of ((uri,arity)::compounds)
490 let status = GrafiteTypes.add_moo_content moo_content status in
491 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
492 List.map fst compounds
494 module MatitaStatus =
496 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
499 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
501 type tactic = input_status -> output_status
503 let mk_tactic tac = tac
504 let apply_tactic tac = tac
505 let goals (_, opened, closed) = opened, closed
506 let get_stack (status, _) = GrafiteTypes.get_stack status
508 let set_stack stack (status, opened, closed) =
509 GrafiteTypes.set_stack stack status, opened, closed
511 let inject (status, _) = (status, [], [])
512 let focus goal (status, _, _) = (status, goal)
515 module MatitaTacticals = Continuationals.Make(MatitaStatus)
517 let tactic_of_ast' tac =
518 MatitaTacticals.Tactical (MatitaTacticals.Tactic (MatitaStatus.mk_tactic tac))
520 let punctuation_tactical_of_ast (text,prefix_len,punct) =
522 | GrafiteAst.Dot _loc -> MatitaTacticals.Dot
523 | GrafiteAst.Semicolon _loc -> MatitaTacticals.Semicolon
524 | GrafiteAst.Branch _loc -> MatitaTacticals.Branch
525 | GrafiteAst.Shift _loc -> MatitaTacticals.Shift
526 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.Pos i
527 | GrafiteAst.Merge _loc -> MatitaTacticals.Merge
528 | GrafiteAst.Wildcard _loc -> MatitaTacticals.Wildcard
530 let non_punctuation_tactical_of_ast (text,prefix_len,punct) =
532 | GrafiteAst.Focus (_loc,goals) -> MatitaTacticals.Focus goals
533 | GrafiteAst.Unfocus _loc -> MatitaTacticals.Unfocus
534 | GrafiteAst.Skip _loc -> MatitaTacticals.Tactical MatitaTacticals.Skip
536 let eval_tactical status tac =
537 let status, _, _ = MatitaTacticals.eval 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 (uri,arity_coercion))
604 else if is_a_wanted_coercion then
605 Some (uri, coercion_moo_statement_of (uri,arity_wanted))
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, _subst, bo, ty, attrs =
690 match status.GrafiteTypes.proof_status with
691 | GrafiteTypes.Proof (Some uri, metasenv, subst, body, ty, attrs) ->
692 uri, metasenv, subst, body, ty, attrs
693 | GrafiteTypes.Proof (None, metasenv, subst, body, ty, attrs) ->
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,[],attrs) in
707 let status, lemmas = add_obj uri obj status in
709 GrafiteTypes.proof_status = GrafiteTypes.No_proof},
710 (*CSC: I throw away the arities *)
712 | GrafiteAst.Relation (loc, id, a, aeq, refl, sym, trans) ->
713 Setoids.add_relation id a aeq refl sym trans;
714 status, [] (*CSC: TO BE FIXED *)
715 | GrafiteAst.Set (loc, name, value) ->
716 if name = "baseuri" then begin
718 let v = Http_getter_misc.strip_trailing_slash value in
720 ignore (String.index v ' ');
721 GrafiteTypes.command_error "baseuri can't contain spaces"
724 if Http_getter_storage.is_read_only value then begin
725 HLog.error (Printf.sprintf "uri %s belongs to a read-only repository" value);
726 raise (ReadOnlyUri value)
728 if not (Http_getter_storage.is_empty value) &&
731 HLog.message ("baseuri " ^ value ^ " is not empty");
732 HLog.message ("cleaning baseuri " ^ value);
733 LibraryClean.clean_baseuris [value];
734 assert (Http_getter_storage.is_empty value);
736 if not (Helm_registry.get_opt_default Helm_registry.bool "matita.nodisk"
740 (Filename.dirname (Http_getter.filename ~writable:true (value ^
743 GrafiteTypes.set_option status name value,[]
744 | GrafiteAst.Obj (loc,obj) ->
747 Cic.Constant (name,_,_,_,_)
748 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
749 | Cic.InductiveDefinition (types,_,_,_) ->
751 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
752 | _ -> assert false in
754 UriManager.uri_of_string (GrafiteTypes.qualify status name ^ ext) in
755 let obj = CicRefine.pack_coercion_obj obj in
756 let metasenv = GrafiteTypes.get_proof_metasenv status in
758 | Cic.CurrentProof (_,metasenv',bo,ty,_, attrs) ->
759 let name = UriManager.name_of_uri uri in
760 if not(CicPp.check name ty) then
761 HLog.error ("Bad name: " ^ name);
762 if opts.do_heavy_checks then
764 let dbd = LibraryDb.instance () in
765 let similar = Whelp.match_term ~dbd ty in
766 let similar_len = List.length similar in
767 if similar_len> 30 then
769 ("Duplicate check will compare your theorem with " ^
770 string_of_int similar_len ^
771 " theorems, this may take a while."));
775 let t = CicUtil.term_of_uri u in
777 CicTypeChecker.type_of_aux'
778 metasenv' [] t CicUniv.empty_ugraph
780 fst(CicReduction.are_convertible [] ty' ty g))
783 (match convertible with
787 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
788 "\nPlease use a variant."));
791 let initial_proof = (Some uri, metasenv', _subst, bo, ty, attrs) in
792 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
793 { status with GrafiteTypes.proof_status =
794 GrafiteTypes.Incomplete_proof
795 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
798 if metasenv <> [] then
799 raise (GrafiteTypes.Command_error (
800 "metasenv not empty while giving a definition with body: " ^
801 CicMetaSubst.ppmetasenv [] metasenv));
802 let status, lemmas = add_obj uri obj status in
803 let status,new_lemmas =
804 add_coercions_of_record_to_moo obj lemmas status
806 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
807 uri::new_lemmas@lemmas
809 match status.GrafiteTypes.proof_status with
810 GrafiteTypes.Intermediate _ ->
811 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
814 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
815 ~disambiguate_macro opts status (text,prefix_len,ex) ->
817 | GrafiteAst.Tactic (_, Some tac, punct) ->
818 let tac = apply_tactic ~disambiguate_tactic (text,prefix_len,tac) in
819 let status = eval_tactical status (tactic_of_ast' tac) in
821 (punctuation_tactical_of_ast (text,prefix_len,punct)),[]
822 | GrafiteAst.Tactic (_, None, punct) ->
824 (punctuation_tactical_of_ast (text,prefix_len,punct)),[]
825 | GrafiteAst.NonPunctuationTactical (_, tac, punct) ->
828 (non_punctuation_tactical_of_ast (text,prefix_len,tac))
831 (punctuation_tactical_of_ast (text,prefix_len,punct)),[]
832 | GrafiteAst.Command (_, cmd) ->
833 eval_command.ec_go ~disambiguate_command opts status (text,prefix_len,cmd)
834 | GrafiteAst.Macro (loc, macro) ->
835 raise (Macro (loc,disambiguate_macro status (text,prefix_len,macro)))
837 } and eval_from_moo = {efm_go = fun status fname ->
839 ("",0,GrafiteAst.Executable (HExtlib.dummy_floc,
840 GrafiteAst.Command (HExtlib.dummy_floc,
843 let moo = GrafiteMarshal.load_moo fname in
846 let ast = ast_of_cmd ast in
849 ~disambiguate_tactic:(fun status _ (_,_,tactic) -> status,tactic)
850 ~disambiguate_command:(fun status (_,_,cmd) -> status,cmd)
851 ~disambiguate_macro:(fun _ _ -> assert false)
857 } and eval_ast = {ea_go = fun ~disambiguate_tactic ~disambiguate_command
858 ~disambiguate_macro ?(do_heavy_checks=false) ?(clean_baseuri=true) status
862 do_heavy_checks = do_heavy_checks ;
863 clean_baseuri = clean_baseuri }
866 | GrafiteAst.Executable (_,ex) ->
867 eval_executable.ee_go ~disambiguate_tactic ~disambiguate_command
868 ~disambiguate_macro opts status (text,prefix_len,ex)
869 | GrafiteAst.Comment (_,c) -> eval_comment status (text,prefix_len,c),[]
872 let eval_ast = eval_ast.ea_go