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.AutoBatch (_,params) ->
90 Tactics.auto ~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.Compose (_,t1,t2,times,(howmany, names)) ->
100 Tactics.compose times t1 t2 ?howmany
101 ~mk_fresh_name_callback:(namer_of names)
102 | GrafiteAst.Contradiction _ -> Tactics.contradiction
103 | GrafiteAst.Constructor (_, n) -> Tactics.constructor n
104 | GrafiteAst.Cut (_, ident, term) ->
105 let names = match ident with None -> [] | Some id -> [Some id] in
106 Tactics.cut ~mk_fresh_name_callback:(namer_of names) term
107 | GrafiteAst.Decompose (_, names) ->
108 let mk_fresh_name_callback = namer_of names in
109 Tactics.decompose ~mk_fresh_name_callback ()
110 | GrafiteAst.Demodulate _ ->
112 ~dbd:(LibraryDb.instance ()) ~universe:status.GrafiteTypes.universe
113 | GrafiteAst.Destruct (_,term) -> Tactics.destruct term
114 | GrafiteAst.Elim (_, what, using, pattern, (depth, names)) ->
115 Tactics.elim_intros ?using ?depth ~mk_fresh_name_callback:(namer_of names)
117 | GrafiteAst.ElimType (_, what, using, (depth, names)) ->
118 Tactics.elim_type ?using ?depth ~mk_fresh_name_callback:(namer_of names)
120 | GrafiteAst.Exact (_, term) -> Tactics.exact term
121 | GrafiteAst.Exists _ -> Tactics.exists
122 | GrafiteAst.Fail _ -> Tactics.fail
123 | GrafiteAst.Fold (_, reduction_kind, term, pattern) ->
125 match reduction_kind with
127 PET.const_lazy_reduction
128 (CicReduction.normalize ~delta:false ~subst:[])
129 | `Reduce -> PET.const_lazy_reduction ProofEngineReduction.reduce
130 | `Simpl -> PET.const_lazy_reduction ProofEngineReduction.simpl
132 PET.const_lazy_reduction (ProofEngineReduction.unfold ?what:None)
133 | `Unfold (Some lazy_term) ->
134 (fun context metasenv ugraph ->
135 let what, metasenv, ugraph = lazy_term context metasenv ugraph in
136 ProofEngineReduction.unfold ~what, metasenv, ugraph)
138 PET.const_lazy_reduction (CicReduction.whd ~delta:false ~subst:[])
140 Tactics.fold ~reduction ~term ~pattern
141 | GrafiteAst.Fourier _ -> Tactics.fourier
142 | GrafiteAst.FwdSimpl (_, hyp, names) ->
143 Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names)
144 ~dbd:(LibraryDb.instance ()) hyp
145 | GrafiteAst.Generalize (_,pattern,ident) ->
146 let names = match ident with None -> [] | Some id -> [Some id] in
147 Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern
148 | GrafiteAst.IdTac _ -> Tactics.id
149 | GrafiteAst.Intros (_, (howmany, names)) ->
150 PrimitiveTactics.intros_tac ?howmany
151 ~mk_fresh_name_callback:(namer_of names) ()
152 | GrafiteAst.Inversion (_, term) ->
153 Tactics.inversion term
154 | GrafiteAst.LApply (_, linear, how_many, to_what, what, ident) ->
155 let names = match ident with None -> [] | Some id -> [Some id] in
156 Tactics.lapply ~mk_fresh_name_callback:(namer_of names)
157 ~linear ?how_many ~to_what what
158 | GrafiteAst.Left _ -> Tactics.left
159 | GrafiteAst.LetIn (loc,term,name) ->
160 Tactics.letin term ~mk_fresh_name_callback:(namer_of [Some name])
161 | GrafiteAst.Reduce (_, reduction_kind, pattern) ->
162 (match reduction_kind with
163 | `Normalize -> Tactics.normalize ~pattern
164 | `Reduce -> Tactics.reduce ~pattern
165 | `Simpl -> Tactics.simpl ~pattern
166 | `Unfold what -> Tactics.unfold ~pattern what
167 | `Whd -> Tactics.whd ~pattern)
168 | GrafiteAst.Reflexivity _ -> Tactics.reflexivity
169 | GrafiteAst.Replace (_, pattern, with_what) ->
170 Tactics.replace ~pattern ~with_what
171 | GrafiteAst.Rewrite (_, direction, t, pattern, names) ->
172 EqualityTactics.rewrite_tac ~direction ~pattern t
173 (* to be replaced with ~mk_fresh_name_callback:(namer_of names) *)
174 (List.map (function Some s -> s | None -> assert false) names)
175 | GrafiteAst.Right _ -> Tactics.right
176 | GrafiteAst.Ring _ -> Tactics.ring
177 | GrafiteAst.Split _ -> Tactics.split
178 | GrafiteAst.Subst _ -> Tactics.subst
179 | GrafiteAst.Symmetry _ -> Tactics.symmetry
180 | GrafiteAst.Transitivity (_, term) -> Tactics.transitivity term
181 (* Implementazioni Aggiunte *)
182 | GrafiteAst.Assume (_, id, t) -> Declarative.assume id t
183 | GrafiteAst.Suppose (_, t, id, t1) -> Declarative.suppose t id t1
184 | GrafiteAst.By_term_we_proved (_, t, ty, id, t1) ->
185 Declarative.by_term_we_proved ~dbd:(LibraryDb.instance())
186 ~universe:status.GrafiteTypes.universe t ty id t1
187 | GrafiteAst.We_need_to_prove (_, t, id, t2) ->
188 Declarative.we_need_to_prove t id t2
189 | GrafiteAst.Bydone (_, t) ->
190 Declarative.bydone ~dbd:(LibraryDb.instance())
191 ~universe:status.GrafiteTypes.universe t
192 | GrafiteAst.We_proceed_by_cases_on (_, t, t1) ->
193 Declarative.we_proceed_by_cases_on t t1
194 | GrafiteAst.We_proceed_by_induction_on (_, t, t1) ->
195 Declarative.we_proceed_by_induction_on t t1
196 | GrafiteAst.Byinduction (_, t, id) -> Declarative.byinduction t id
197 | GrafiteAst.Thesisbecomes (_, t) -> Declarative.thesisbecomes t
198 | GrafiteAst.ExistsElim (_, t, id1, t1, id2, t2) ->
199 Declarative.existselim ~dbd:(LibraryDb.instance())
200 ~universe:status.GrafiteTypes.universe t id1 t1 id2 t2
201 | GrafiteAst.Case (_,id,params) -> Declarative.case id params
202 | GrafiteAst.AndElim(_,t,id1,t1,id2,t2) -> Declarative.andelim t id1 t1 id2 t2
203 | GrafiteAst.RewritingStep (_,termine,t1,t2,cont) ->
204 Declarative.rewritingstep ~dbd:(LibraryDb.instance ())
205 ~universe:status.GrafiteTypes.universe termine t1 t2 cont
207 let classify_tactic tactic =
209 (* tactics that can't close the goal (return a goal we want to "select") *)
210 | GrafiteAst.Rewrite _
212 | GrafiteAst.Replace _
213 | GrafiteAst.Reduce _
215 | GrafiteAst.Generalize _
218 | GrafiteAst.Decompose _ -> true
219 (* tactics like apply *)
222 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
223 let module PEH = ProofEngineHelpers in
224 (* let print_m name metasenv =
225 prerr_endline (">>>>> " ^ name);
226 prerr_endline (CicMetaSubst.ppmetasenv [] metasenv)
228 (* phase one calculates:
229 * new_goals_from_refine: goals added by refine
230 * head_goal: the first goal opened by ythe tactic
231 * other_goals: other goals opened by the tactic
233 let new_goals_from_refine = PEH.compare_metasenvs start refine in
234 let new_goals_from_tactic = PEH.compare_metasenvs refine tactic in
235 let head_goal, other_goals, goals =
237 | [] -> None,[],goals
239 (* assert (List.mem hd new_goals_from_tactic);
240 * invalidato dalla goal_tac
242 Some hd, List.filter ((<>) hd) new_goals_from_tactic, List.filter ((<>)
247 | None -> new_goals_from_refine @ other_goals
248 | Some x -> x :: new_goals_from_refine @ other_goals
250 (* extract the metas generated by refine and tactic *)
251 let metas_for_tactic_head =
254 | Some head_goal -> List.filter (fun (n,_,_) -> n = head_goal) tactic in
255 let metas_for_tactic_goals =
257 (fun x -> List.find (fun (metano,_,_) -> metano = x) tactic)
260 let metas_for_refine_goals =
261 List.filter (fun (n,_,_) -> List.mem n new_goals_from_refine) tactic in
262 let produced_metas, goals =
264 if always_opens_a_goal then
265 metas_for_tactic_head @ metas_for_refine_goals @
266 metas_for_tactic_goals
268 (* print_m "metas_for_refine_goals" metas_for_refine_goals;
269 print_m "metas_for_tactic_head" metas_for_tactic_head;
270 print_m "metas_for_tactic_goals" metas_for_tactic_goals; *)
271 metas_for_refine_goals @ metas_for_tactic_head @
272 metas_for_tactic_goals
275 let goals = List.map (fun (metano, _, _) -> metano) produced_metas in
276 produced_metas, goals
278 (* residual metas, preserving the original order *)
283 | (metano, _, _) :: tl when metano = e ->
284 [], List.map (fun (x,_,_) -> x) tl
285 | (metano, _, _) :: tl -> let b, a = split e tl in metano :: b, a
287 let find n metasenv =
289 Some (List.find (fun (metano, _, _) -> metano = n) metasenv)
290 with Not_found -> None
295 match find n tactic with
299 let before_l, after_l = split current_goal start in
301 List.filter (fun x -> not (List.mem x produced_goals)) before_l in
303 List.filter (fun x -> not (List.mem x produced_goals)) after_l in
304 let before = extract before_l in
305 let after = extract after_l in
309 print_m "BEGIN" start;
310 prerr_endline ("goal was: " ^ string_of_int current_goal);
311 prerr_endline ("and metas from refine are:");
313 (fun t -> prerr_string (" " ^ string_of_int t))
314 new_goals_from_refine;
316 print_m "before" before;
317 print_m "metas_for_tactic_head" metas_for_tactic_head;
318 print_m "metas_for_refine_goals" metas_for_refine_goals;
319 print_m "metas_for_tactic_goals" metas_for_tactic_goals;
320 print_m "produced_metas" produced_metas;
321 print_m "after" after;
322 |+ FINE DEBUG CODE +| *)
323 before @ produced_metas @ after, goals
325 let apply_tactic ~disambiguate_tactic (text,prefix_len,tactic) (status, goal) =
326 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
327 let before = List.map (fun g, _, _ -> g) starting_metasenv in
328 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
329 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
330 let proof = GrafiteTypes.get_current_proof status in
331 let proof_status = proof, goal in
332 let always_opens_a_goal = classify_tactic tactic in
333 let tactic = tactic_of_ast status tactic in
334 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
335 let after = ProofEngineTypes.goals_of_proof proof in
336 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
337 let proof, opened_goals =
338 let uri, metasenv_after_tactic, _subst, t, ty, attrs = proof in
339 let reordered_metasenv, opened_goals =
342 metasenv_after_refinement metasenv_after_tactic
343 opened goal always_opens_a_goal
345 let proof' = uri, reordered_metasenv, _subst, t, ty, attrs in
348 let incomplete_proof =
349 match status.GrafiteTypes.proof_status with
350 | GrafiteTypes.Incomplete_proof p -> p
353 { status with GrafiteTypes.proof_status =
354 GrafiteTypes.Incomplete_proof
355 { incomplete_proof with GrafiteTypes.proof = proof } },
356 opened_goals, closed_goals
358 let apply_atomic_tactical ~disambiguate_tactic ~patch (text,prefix_len,tactic) (status, goal) =
359 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
360 let before = List.map (fun g, _, _ -> g) starting_metasenv in
361 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
362 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
363 let proof = GrafiteTypes.get_current_proof status in
364 let proof_status = proof, goal in
365 let always_opens_a_goal = classify_tactic tactic in
366 let tactic = tactic_of_ast status tactic in
367 let tactic = patch tactic in
368 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
369 let after = ProofEngineTypes.goals_of_proof proof in
370 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
371 let proof, opened_goals =
372 let uri, metasenv_after_tactic, _subst, t, ty, attrs = proof in
373 let reordered_metasenv, opened_goals =
376 metasenv_after_refinement metasenv_after_tactic
377 opened goal always_opens_a_goal
379 let proof' = uri, reordered_metasenv, _subst, t, ty, attrs in
382 let incomplete_proof =
383 match status.GrafiteTypes.proof_status with
384 | GrafiteTypes.Incomplete_proof p -> p
387 { status with GrafiteTypes.proof_status =
388 GrafiteTypes.Incomplete_proof
389 { incomplete_proof with GrafiteTypes.proof = proof } },
390 opened_goals, closed_goals
393 'term 'lazy_term 'reduction 'obj 'ident.
395 (GrafiteTypes.status ->
396 ProofEngineTypes.goal ->
397 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
398 disambiguator_input ->
399 GrafiteTypes.status *
400 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
402 disambiguate_command:
403 (GrafiteTypes.status ->
404 (('term,'obj) GrafiteAst.command) disambiguator_input ->
405 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
408 (GrafiteTypes.status ->
409 ('term GrafiteAst.macro) disambiguator_input ->
410 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
412 ?do_heavy_checks:bool ->
413 ?clean_baseuri:bool ->
414 GrafiteTypes.status ->
415 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
416 disambiguator_input ->
417 GrafiteTypes.status * UriManager.uri list
420 type 'a eval_command =
422 disambiguate_command:
423 (GrafiteTypes.status -> (('term,'obj) GrafiteAst.command) disambiguator_input ->
424 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
425 options -> GrafiteTypes.status ->
426 (('term,'obj) GrafiteAst.command) disambiguator_input ->
427 GrafiteTypes.status * UriManager.uri list
430 type 'a eval_executable =
431 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
433 (GrafiteTypes.status ->
434 ProofEngineTypes.goal ->
435 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
436 disambiguator_input ->
437 GrafiteTypes.status *
438 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
440 disambiguate_command:
441 (GrafiteTypes.status ->
442 (('term,'obj) GrafiteAst.command) disambiguator_input ->
443 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
446 (GrafiteTypes.status ->
447 ('term GrafiteAst.macro) disambiguator_input ->
448 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
451 GrafiteTypes.status ->
452 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
453 GrafiteTypes.status * UriManager.uri list
456 type 'a eval_from_moo =
457 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
459 let coercion_moo_statement_of (uri,arity) =
460 GrafiteAst.Coercion (HExtlib.dummy_floc, uri, false, arity)
462 let refinement_toolkit = {
463 RefinementTool.type_of_aux' =
464 (fun ?localization_tbl e c t u ->
465 let saved = !CicRefine.insert_coercions in
466 CicRefine.insert_coercions:= false;
469 let t, ty, metasenv, ugraph =
470 CicRefine.type_of_aux' ?localization_tbl e c t u in
471 RefinementTool.Success (t, ty, metasenv, ugraph)
473 | CicRefine.RefineFailure s
474 | CicRefine.Uncertain s
475 | CicRefine.AssertFailure s -> RefinementTool.Exception s
477 CicRefine.insert_coercions := saved;
479 RefinementTool.ppsubst = CicMetaSubst.ppsubst;
480 RefinementTool.apply_subst = CicMetaSubst.apply_subst;
481 RefinementTool.ppmetasenv = CicMetaSubst.ppmetasenv;
482 RefinementTool.pack_coercion_obj = CicRefine.pack_coercion_obj;
485 let eval_coercion status ~add_composites uri arity baseuri =
486 let status,compounds =
487 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri arity
491 List.map coercion_moo_statement_of ((uri,arity)::compounds)
493 let status = GrafiteTypes.add_moo_content moo_content status in
494 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
495 List.map fst compounds
497 module MatitaStatus =
499 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
502 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
504 type tactic = input_status -> output_status
506 let mk_tactic tac = tac
507 let apply_tactic tac = tac
508 let goals (_, opened, closed) = opened, closed
509 let get_stack (status, _) = GrafiteTypes.get_stack status
511 let set_stack stack (status, opened, closed) =
512 GrafiteTypes.set_stack stack status, opened, closed
514 let inject (status, _) = (status, [], [])
515 let focus goal (status, _, _) = (status, goal)
518 module MatitaTacticals = Continuationals.Make(MatitaStatus)
520 let tactic_of_ast' tac =
521 MatitaTacticals.Tactical (MatitaTacticals.Tactic (MatitaStatus.mk_tactic tac))
523 let punctuation_tactical_of_ast (text,prefix_len,punct) =
525 | GrafiteAst.Dot _loc -> MatitaTacticals.Dot
526 | GrafiteAst.Semicolon _loc -> MatitaTacticals.Semicolon
527 | GrafiteAst.Branch _loc -> MatitaTacticals.Branch
528 | GrafiteAst.Shift _loc -> MatitaTacticals.Shift
529 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.Pos i
530 | GrafiteAst.Merge _loc -> MatitaTacticals.Merge
531 | GrafiteAst.Wildcard _loc -> MatitaTacticals.Wildcard
533 let non_punctuation_tactical_of_ast (text,prefix_len,punct) =
535 | GrafiteAst.Focus (_loc,goals) -> MatitaTacticals.Focus goals
536 | GrafiteAst.Unfocus _loc -> MatitaTacticals.Unfocus
537 | GrafiteAst.Skip _loc -> MatitaTacticals.Tactical MatitaTacticals.Skip
539 let eval_tactical status tac =
540 let status, _, _ = MatitaTacticals.eval 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 (Auto.pp_proofterm p);
690 | GrafiteAst.Print (_,_) -> status,[]
691 | GrafiteAst.Qed loc ->
692 let uri, metasenv, _subst, bo, ty, attrs =
693 match status.GrafiteTypes.proof_status with
694 | GrafiteTypes.Proof (Some uri, metasenv, subst, body, ty, attrs) ->
695 uri, metasenv, subst, body, ty, attrs
696 | GrafiteTypes.Proof (None, metasenv, subst, body, ty, attrs) ->
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,[],attrs) 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 (Printf.sprintf "uri %s belongs to a read-only repository" value);
729 raise (ReadOnlyUri value)
731 if (not (Http_getter_storage.is_empty value) ||
732 LibraryClean.db_uris_of_baseuri value <> [])
733 && opts.clean_baseuri
735 HLog.message ("baseuri " ^ value ^ " is not empty");
736 HLog.message ("cleaning baseuri " ^ value);
737 LibraryClean.clean_baseuris [value];
738 assert (Http_getter_storage.is_empty value);
740 if not (Helm_registry.get_opt_default Helm_registry.bool "matita.nodisk"
744 (Filename.dirname (Http_getter.filename ~writable:true (value ^
747 GrafiteTypes.set_option status name value,[]
748 | GrafiteAst.Obj (loc,obj) ->
751 Cic.Constant (name,_,_,_,_)
752 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
753 | Cic.InductiveDefinition (types,_,_,_) ->
755 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
756 | _ -> assert false in
758 UriManager.uri_of_string (GrafiteTypes.qualify status name ^ ext) in
759 let obj = CicRefine.pack_coercion_obj obj in
760 let metasenv = GrafiteTypes.get_proof_metasenv status in
762 | Cic.CurrentProof (_,metasenv',bo,ty,_, attrs) ->
763 let name = UriManager.name_of_uri uri in
764 if not(CicPp.check name ty) then
765 HLog.error ("Bad name: " ^ name);
766 if opts.do_heavy_checks then
768 let dbd = LibraryDb.instance () in
769 let similar = Whelp.match_term ~dbd ty in
770 let similar_len = List.length similar in
771 if similar_len> 30 then
773 ("Duplicate check will compare your theorem with " ^
774 string_of_int similar_len ^
775 " theorems, this may take a while."));
779 let t = CicUtil.term_of_uri u in
781 CicTypeChecker.type_of_aux'
782 metasenv' [] t CicUniv.empty_ugraph
784 fst(CicReduction.are_convertible [] ty' ty g))
787 (match convertible with
791 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
792 "\nPlease use a variant."));
795 let initial_proof = (Some uri, metasenv', _subst, bo, ty, attrs) in
796 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
797 { status with GrafiteTypes.proof_status =
798 GrafiteTypes.Incomplete_proof
799 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
802 if metasenv <> [] then
803 raise (GrafiteTypes.Command_error (
804 "metasenv not empty while giving a definition with body: " ^
805 CicMetaSubst.ppmetasenv [] metasenv));
806 let status, lemmas = add_obj uri obj status in
807 let status,new_lemmas =
808 add_coercions_of_record_to_moo obj lemmas status
810 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
811 uri::new_lemmas@lemmas
813 match status.GrafiteTypes.proof_status with
814 GrafiteTypes.Intermediate _ ->
815 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
818 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
819 ~disambiguate_macro opts status (text,prefix_len,ex) ->
821 | GrafiteAst.Tactic (_, Some tac, punct) ->
822 let tac = apply_tactic ~disambiguate_tactic (text,prefix_len,tac) in
823 let status = eval_tactical status (tactic_of_ast' tac) in
825 (punctuation_tactical_of_ast (text,prefix_len,punct)),[]
826 | GrafiteAst.Tactic (_, None, punct) ->
828 (punctuation_tactical_of_ast (text,prefix_len,punct)),[]
829 | GrafiteAst.NonPunctuationTactical (_, tac, punct) ->
832 (non_punctuation_tactical_of_ast (text,prefix_len,tac))
835 (punctuation_tactical_of_ast (text,prefix_len,punct)),[]
836 | GrafiteAst.Command (_, cmd) ->
837 eval_command.ec_go ~disambiguate_command opts status (text,prefix_len,cmd)
838 | GrafiteAst.Macro (loc, macro) ->
839 raise (Macro (loc,disambiguate_macro status (text,prefix_len,macro)))
841 } and eval_from_moo = {efm_go = fun status fname ->
843 ("",0,GrafiteAst.Executable (HExtlib.dummy_floc,
844 GrafiteAst.Command (HExtlib.dummy_floc,
847 let moo = GrafiteMarshal.load_moo fname in
850 let ast = ast_of_cmd ast in
853 ~disambiguate_tactic:(fun status _ (_,_,tactic) -> status,tactic)
854 ~disambiguate_command:(fun status (_,_,cmd) -> status,cmd)
855 ~disambiguate_macro:(fun _ _ -> assert false)
861 } and eval_ast = {ea_go = fun ~disambiguate_tactic ~disambiguate_command
862 ~disambiguate_macro ?(do_heavy_checks=false) ?(clean_baseuri=true) status
866 do_heavy_checks = do_heavy_checks ;
867 clean_baseuri = clean_baseuri }
870 | GrafiteAst.Executable (_,ex) ->
871 eval_executable.ee_go ~disambiguate_tactic ~disambiguate_command
872 ~disambiguate_macro opts status (text,prefix_len,ex)
873 | GrafiteAst.Comment (_,c) -> eval_comment status (text,prefix_len,c),[]
876 let eval_ast = eval_ast.ea_go