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/
28 module PEH = ProofEngineHelpers
31 (* mo file name, ma file name *)
32 exception IncludedFileNotCompiled of string * string
35 (Cic.context -> GrafiteTypes.status * (Cic.term,Cic.lazy_term) GrafiteAst.macro)
37 type 'a disambiguator_input = string * int * 'a
40 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.ApplyP (_, term) -> Tactics.applyP term
86 | GrafiteAst.ApplyS (_, term, params) ->
87 Tactics.applyS ~term ~params ~dbd:(LibraryDb.instance ())
88 ~universe:status.GrafiteTypes.universe
89 | GrafiteAst.Assumption _ -> Tactics.assumption
90 | GrafiteAst.AutoBatch (_,params) ->
91 Tactics.auto ~params ~dbd:(LibraryDb.instance ())
92 ~universe:status.GrafiteTypes.universe
93 | GrafiteAst.Cases (_, what, pattern, (howmany, names)) ->
94 Tactics.cases_intros ?howmany ~mk_fresh_name_callback:(namer_of names)
96 | GrafiteAst.Change (_, pattern, with_what) ->
97 Tactics.change ~pattern with_what
98 | GrafiteAst.Clear (_,id) -> Tactics.clear id
99 | GrafiteAst.ClearBody (_,id) -> Tactics.clearbody id
100 | GrafiteAst.Compose (_,t1,t2,times,(howmany, names)) ->
101 Tactics.compose times t1 t2 ?howmany
102 ~mk_fresh_name_callback:(namer_of names)
103 | GrafiteAst.Contradiction _ -> Tactics.contradiction
104 | GrafiteAst.Constructor (_, n) -> Tactics.constructor n
105 | GrafiteAst.Cut (_, ident, term) ->
106 let names = match ident with None -> [] | Some id -> [Some id] in
107 Tactics.cut ~mk_fresh_name_callback:(namer_of names) term
108 | GrafiteAst.Decompose (_, names) ->
109 let mk_fresh_name_callback = namer_of names in
110 Tactics.decompose ~mk_fresh_name_callback ()
111 | GrafiteAst.Demodulate (_, params) ->
113 ~dbd:(LibraryDb.instance ()) ~params
114 ~universe:status.GrafiteTypes.universe
115 | GrafiteAst.Destruct (_,xterms) -> Tactics.destruct xterms
116 | GrafiteAst.Elim (_, what, using, pattern, (depth, names)) ->
117 Tactics.elim_intros ?using ?depth ~mk_fresh_name_callback:(namer_of names)
119 | GrafiteAst.ElimType (_, what, using, (depth, names)) ->
120 Tactics.elim_type ?using ?depth ~mk_fresh_name_callback:(namer_of names)
122 | GrafiteAst.Exact (_, term) -> Tactics.exact term
123 | GrafiteAst.Exists _ -> Tactics.exists
124 | GrafiteAst.Fail _ -> Tactics.fail
125 | GrafiteAst.Fold (_, reduction_kind, term, pattern) ->
127 match reduction_kind with
129 PET.const_lazy_reduction
130 (CicReduction.normalize ~delta:false ~subst:[])
131 | `Simpl -> PET.const_lazy_reduction ProofEngineReduction.simpl
133 PET.const_lazy_reduction (ProofEngineReduction.unfold ?what:None)
134 | `Unfold (Some lazy_term) ->
135 (fun context metasenv ugraph ->
136 let what, metasenv, ugraph = lazy_term context metasenv ugraph in
137 ProofEngineReduction.unfold ~what, metasenv, ugraph)
139 PET.const_lazy_reduction (CicReduction.whd ~delta:false ~subst:[])
141 Tactics.fold ~reduction ~term ~pattern
142 | GrafiteAst.Fourier _ -> Tactics.fourier
143 | GrafiteAst.FwdSimpl (_, hyp, names) ->
144 Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names)
145 ~dbd:(LibraryDb.instance ()) hyp
146 | GrafiteAst.Generalize (_,pattern,ident) ->
147 let names = match ident with None -> [] | Some id -> [Some id] in
148 Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern
149 | GrafiteAst.IdTac _ -> Tactics.id
150 | GrafiteAst.Intros (_, (howmany, names)) ->
151 PrimitiveTactics.intros_tac ?howmany
152 ~mk_fresh_name_callback:(namer_of names) ()
153 | GrafiteAst.Inversion (_, term) ->
154 Tactics.inversion term
155 | GrafiteAst.LApply (_, linear, how_many, to_what, what, ident) ->
156 let names = match ident with None -> [] | Some id -> [Some id] in
157 Tactics.lapply ~mk_fresh_name_callback:(namer_of names)
158 ~linear ?how_many ~to_what what
159 | GrafiteAst.Left _ -> Tactics.left
160 | GrafiteAst.LetIn (loc,term,name) ->
161 Tactics.letin term ~mk_fresh_name_callback:(namer_of [Some name])
162 | GrafiteAst.Reduce (_, reduction_kind, pattern) ->
163 (match reduction_kind with
164 | `Normalize -> Tactics.normalize ~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.Symmetry _ -> Tactics.symmetry
179 | GrafiteAst.Transitivity (_, term) -> Tactics.transitivity term
180 (* Implementazioni Aggiunte *)
181 | GrafiteAst.Assume (_, id, t) -> Declarative.assume id t
182 | GrafiteAst.Suppose (_, t, id, t1) -> Declarative.suppose t id t1
183 | GrafiteAst.By_just_we_proved (_, just, ty, id, t1) ->
184 Declarative.by_just_we_proved ~dbd:(LibraryDb.instance())
185 ~universe:status.GrafiteTypes.universe just ty id t1
186 | GrafiteAst.We_need_to_prove (_, t, id, t2) ->
187 Declarative.we_need_to_prove t id t2
188 | GrafiteAst.Bydone (_, t) ->
189 Declarative.bydone ~dbd:(LibraryDb.instance())
190 ~universe:status.GrafiteTypes.universe t
191 | GrafiteAst.We_proceed_by_cases_on (_, t, t1) ->
192 Declarative.we_proceed_by_cases_on t t1
193 | GrafiteAst.We_proceed_by_induction_on (_, t, t1) ->
194 Declarative.we_proceed_by_induction_on t t1
195 | GrafiteAst.Byinduction (_, t, id) -> Declarative.byinduction t id
196 | GrafiteAst.Thesisbecomes (_, t) -> Declarative.thesisbecomes t
197 | GrafiteAst.ExistsElim (_, just, id1, t1, id2, t2) ->
198 Declarative.existselim ~dbd:(LibraryDb.instance())
199 ~universe:status.GrafiteTypes.universe just id1 t1 id2 t2
200 | GrafiteAst.Case (_,id,params) -> Declarative.case id params
201 | GrafiteAst.AndElim(_,just,id1,t1,id2,t2) ->
202 Declarative.andelim ~dbd:(LibraryDb.instance ())
203 ~universe:status.GrafiteTypes.universe just id1 t1 id2 t2
204 | GrafiteAst.RewritingStep (_,termine,t1,t2,cont) ->
205 Declarative.rewritingstep ~dbd:(LibraryDb.instance ())
206 ~universe:status.GrafiteTypes.universe termine t1 t2 cont
208 let classify_tactic tactic =
210 (* tactics that can't close the goal (return a goal we want to "select") *)
211 | GrafiteAst.Rewrite _
213 | GrafiteAst.Replace _
214 | GrafiteAst.Reduce _
216 | GrafiteAst.Generalize _
219 | GrafiteAst.Decompose _ -> true
220 (* tactics like apply *)
223 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
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,'lazy_term) GrafiteAst.macro) disambiguator_input ->
410 Cic.context -> GrafiteTypes.status * (Cic.term,Cic.lazy_term) GrafiteAst.macro) ->
412 ?do_heavy_checks:bool ->
413 GrafiteTypes.status ->
414 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
415 disambiguator_input ->
416 GrafiteTypes.status * UriManager.uri list
419 type 'a eval_command =
421 disambiguate_command:
422 (GrafiteTypes.status -> (('term,'obj) GrafiteAst.command) disambiguator_input ->
423 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
424 options -> GrafiteTypes.status ->
425 (('term,'obj) GrafiteAst.command) disambiguator_input ->
426 GrafiteTypes.status * UriManager.uri list
429 type 'a eval_executable =
430 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
432 (GrafiteTypes.status ->
433 ProofEngineTypes.goal ->
434 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
435 disambiguator_input ->
436 GrafiteTypes.status *
437 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
439 disambiguate_command:
440 (GrafiteTypes.status ->
441 (('term,'obj) GrafiteAst.command) disambiguator_input ->
442 GrafiteTypes.status * (Cic.term,Cic.obj) GrafiteAst.command) ->
445 (GrafiteTypes.status ->
446 (('term,'lazy_term) GrafiteAst.macro) disambiguator_input ->
447 Cic.context -> GrafiteTypes.status * (Cic.term,Cic.lazy_term) GrafiteAst.macro) ->
450 GrafiteTypes.status ->
451 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
452 GrafiteTypes.status * UriManager.uri list
455 type 'a eval_from_moo =
456 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
458 let coercion_moo_statement_of (uri,arity, saturations,_) =
460 (HExtlib.dummy_floc, CicUtil.term_of_uri uri, false, arity, saturations)
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 saturations =
487 try CicUtil.uri_of_term uri
488 with Invalid_argument _ ->
489 raise (Invalid_argument "coercion can only be constants/constructors")
491 let status,compounds =
492 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri arity
493 saturations (GrafiteTypes.get_baseuri status)
496 List.map coercion_moo_statement_of ((uri,arity,saturations,0)::compounds)
498 let status = GrafiteTypes.add_moo_content moo_content status in
499 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
500 List.map (fun u,_,_,_ -> u) compounds
502 module MatitaStatus =
504 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
507 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
509 type tactic = input_status -> output_status
511 let mk_tactic tac = tac
512 let apply_tactic tac = tac
513 let goals (_, opened, closed) = opened, closed
514 let get_stack (status, _) = GrafiteTypes.get_stack status
516 let set_stack stack (status, opened, closed) =
517 GrafiteTypes.set_stack stack status, opened, closed
519 let inject (status, _) = (status, [], [])
520 let focus goal (status, _, _) = (status, goal)
523 module MatitaTacticals = Continuationals.Make(MatitaStatus)
525 let tactic_of_ast' tac =
526 MatitaTacticals.Tactical (MatitaTacticals.Tactic (MatitaStatus.mk_tactic tac))
528 let punctuation_tactical_of_ast (text,prefix_len,punct) =
530 | GrafiteAst.Dot _loc -> MatitaTacticals.Dot
531 | GrafiteAst.Semicolon _loc -> MatitaTacticals.Semicolon
532 | GrafiteAst.Branch _loc -> MatitaTacticals.Branch
533 | GrafiteAst.Shift _loc -> MatitaTacticals.Shift
534 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.Pos i
535 | GrafiteAst.Merge _loc -> MatitaTacticals.Merge
536 | GrafiteAst.Wildcard _loc -> MatitaTacticals.Wildcard
538 let non_punctuation_tactical_of_ast (text,prefix_len,punct) =
540 | GrafiteAst.Focus (_loc,goals) -> MatitaTacticals.Focus goals
541 | GrafiteAst.Unfocus _loc -> MatitaTacticals.Unfocus
542 | GrafiteAst.Skip _loc -> MatitaTacticals.Tactical MatitaTacticals.Skip
544 let eval_tactical status tac =
545 let status, _, _ = MatitaTacticals.eval tac (status, ~-1) in
546 let status = (* is proof completed? *)
547 match status.GrafiteTypes.proof_status with
548 | GrafiteTypes.Incomplete_proof
549 { GrafiteTypes.stack = stack; proof = proof }
550 when Continuationals.Stack.is_empty stack ->
551 { status with GrafiteTypes.proof_status = GrafiteTypes.Proof proof }
556 let eval_comment status c = status
558 (* since the record syntax allows to declare coercions, we have to put this
559 * information inside the moo *)
560 let add_coercions_of_record_to_moo obj lemmas status =
561 let attributes = CicUtil.attributes_of_obj obj in
562 let is_record = function `Class (`Record att) -> Some att | _-> None in
563 match HExtlib.list_findopt is_record attributes with
566 let is_a_coercion uri =
569 CicEnvironment.get_cooked_obj CicUniv.oblivion_ugraph uri in
570 let attrs = CicUtil.attributes_of_obj obj in
573 (function `Class (`Coercion _) -> true | _-> false) attrs
574 with `Class (`Coercion n) -> true,n | _ -> assert false
575 with Not_found -> false,0
576 with Not_found -> assert false
578 let buri = GrafiteTypes.get_baseuri status in
579 (* looking at the fields we can know the 'wanted' coercions, but not the
580 * actually generated ones. So, only the intersection between the wanted
581 * and the actual should be in the moo as coercion, while everithing in
582 * lemmas should go as aliases *)
583 let wanted_coercions =
586 | (name,true,arity) ->
588 (arity, UriManager.uri_of_string (buri ^ "/" ^ name ^ ".con" ))
592 (*prerr_endline "wanted coercions:";
594 (fun u -> prerr_endline (UriManager.string_of_uri u))
596 let coercions, moo_content =
600 let is_a_wanted_coercion,arity_wanted =
603 List.find (fun (n,u) -> UriManager.eq u uri)
607 with Not_found -> false, 0
609 let is_a_coercion, arity_coercion = is_a_coercion uri in
610 if is_a_coercion then
611 Some (uri, coercion_moo_statement_of (uri,arity_coercion,0,0))
612 else if is_a_wanted_coercion then
613 Some (uri, coercion_moo_statement_of (uri,arity_wanted,0,0))
618 (*prerr_endline "actual coercions:";
620 (fun u -> prerr_endline (UriManager.string_of_uri u))
622 prerr_endline "lemmas was:";
624 (fun u -> prerr_endline (UriManager.string_of_uri u))
626 let status = GrafiteTypes.add_moo_content moo_content status in
628 GrafiteTypes.coercions = coercions @ status.GrafiteTypes.coercions},
631 let add_obj uri obj status =
632 let status,lemmas = GrafiteSync.add_obj refinement_toolkit uri obj status in
635 let rec eval_command = {ec_go = fun ~disambiguate_command opts status
636 (text,prefix_len,cmd) ->
637 let status,cmd = disambiguate_command status (text,prefix_len,cmd) in
640 | GrafiteAst.Index (loc,None,uri) ->
641 assert false (* TODO: for user input *)
642 | GrafiteAst.Index (loc,Some key,uri) ->
643 let universe = Universe.index
644 status.GrafiteTypes.universe key (CicUtil.term_of_uri uri) in
645 let status = {status with GrafiteTypes.universe = universe} in
648 let candidates = Universe.get_candidates status.GrafiteTypes.universe key in
649 ("candidates for " ^ (CicPp.ppterm key) ^ " = " ^
650 (String.concat "\n" (List.map CicPp.ppterm candidates)))
654 let status = GrafiteTypes.add_moo_content [cmd] status in
656 | GrafiteAst.Coercion (loc, uri, add_composites, arity, saturations) ->
657 eval_coercion status ~add_composites uri arity saturations
658 | GrafiteAst.Default (loc, what, uris) as cmd ->
659 LibraryObjects.set_default what uris;
660 GrafiteTypes.add_moo_content [cmd] status,[]
661 | GrafiteAst.Drop loc -> raise Drop
662 | GrafiteAst.Include (loc, baseuri) ->
663 let moopath_rw, moopath_r =
664 LibraryMisc.obj_file_of_baseuri
665 ~must_exist:false ~baseuri ~writable:true,
666 LibraryMisc.obj_file_of_baseuri
667 ~must_exist:false ~baseuri ~writable:false
670 if Sys.file_exists moopath_r then moopath_r else
671 if Sys.file_exists moopath_rw then moopath_rw else
672 raise (IncludedFileNotCompiled (moopath_rw,baseuri))
674 let status = eval_from_moo.efm_go status moopath in
676 let lt_uri = UriManager.uri_of_string "cic:/matita/nat/orders/lt.con" in
677 let nat_uri = UriManager.uri_of_string "cic:/matita/nat/nat/nat.ind" in
678 let nat = Cic.MutInd(nat_uri,0,[]) in
679 let zero = Cic.MutConstruct(nat_uri,0,1,[]) in
680 let succ = Cic.MutConstruct(nat_uri,0,2,[]) in
681 let fake= Cic.Meta(-1,[]) in
682 let term= Cic.Appl [Cic.Const (lt_uri,[]);zero;Cic.Appl[succ;zero]] in let msg =
683 let candidates = Universe.get_candidates status.GrafiteTypes.universe term in
684 ("candidates for " ^ (CicPp.ppterm term) ^ " = " ^
685 (String.concat "\n" (List.map CicPp.ppterm candidates)))
690 | GrafiteAst.Print (_,"proofterm") ->
691 let _,_,_,p,_, _ = GrafiteTypes.get_current_proof status in
692 prerr_endline (Auto.pp_proofterm (Lazy.force p));
694 | GrafiteAst.Print (_,_) -> status,[]
695 | GrafiteAst.Qed loc ->
696 let uri, metasenv, _subst, bo, ty, attrs =
697 match status.GrafiteTypes.proof_status with
698 | GrafiteTypes.Proof (Some uri, metasenv, subst, body, ty, attrs) ->
699 uri, metasenv, subst, body, ty, attrs
700 | GrafiteTypes.Proof (None, metasenv, subst, body, ty, attrs) ->
701 raise (GrafiteTypes.Command_error
702 ("Someone allows to start a theorem without giving the "^
703 "name/uri. This should be fixed!"))
706 (GrafiteTypes.Command_error "You can't Qed an incomplete theorem")
708 if metasenv <> [] then
710 (GrafiteTypes.Command_error
711 "Proof not completed! metasenv is not empty!");
712 let name = UriManager.name_of_uri uri in
713 let obj = Cic.Constant (name,Some (Lazy.force bo),ty,[],attrs) in
714 let status, lemmas = add_obj uri obj status in
716 GrafiteTypes.proof_status = GrafiteTypes.No_proof},
717 (*CSC: I throw away the arities *)
719 | GrafiteAst.Relation (loc, id, a, aeq, refl, sym, trans) ->
720 Setoids.add_relation id a aeq refl sym trans;
721 status, [] (*CSC: TO BE FIXED *)
722 | GrafiteAst.Set (loc, name, value) -> status, []
723 (* GrafiteTypes.set_option status name value,[] *)
724 | GrafiteAst.Obj (loc,obj) ->
727 Cic.Constant (name,_,_,_,_)
728 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
729 | Cic.InductiveDefinition (types,_,_,_) ->
731 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
732 | _ -> assert false in
733 let buri = GrafiteTypes.get_baseuri status in
734 let uri = UriManager.uri_of_string (buri ^ "/" ^ name ^ ext) in
735 let obj = CicRefine.pack_coercion_obj obj in
736 let metasenv = GrafiteTypes.get_proof_metasenv status in
738 | Cic.CurrentProof (_,metasenv',bo,ty,_, attrs) ->
739 let name = UriManager.name_of_uri uri in
740 if not(CicPp.check name ty) then
741 HLog.warn ("Bad name: " ^ name);
742 if opts.do_heavy_checks then
744 let dbd = LibraryDb.instance () in
745 let similar = Whelp.match_term ~dbd ty in
746 let similar_len = List.length similar in
747 if similar_len> 30 then
749 ("Duplicate check will compare your theorem with " ^
750 string_of_int similar_len ^
751 " theorems, this may take a while."));
755 let t = CicUtil.term_of_uri u in
757 CicTypeChecker.type_of_aux'
758 metasenv' [] t CicUniv.oblivion_ugraph
760 fst(CicReduction.are_convertible [] ty' ty g))
763 (match convertible with
767 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
768 "\nPlease use a variant."));
771 let initial_proof = (Some uri, metasenv', _subst, lazy bo, ty, attrs) in
772 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
773 { status with GrafiteTypes.proof_status =
774 GrafiteTypes.Incomplete_proof
775 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
778 if metasenv <> [] then
779 raise (GrafiteTypes.Command_error (
780 "metasenv not empty while giving a definition with body: " ^
781 CicMetaSubst.ppmetasenv [] metasenv));
782 let status, lemmas = add_obj uri obj status in
783 let status,new_lemmas =
784 add_coercions_of_record_to_moo obj lemmas status
786 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
787 uri::new_lemmas@lemmas
789 match status.GrafiteTypes.proof_status with
790 GrafiteTypes.Intermediate _ ->
791 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
794 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
795 ~disambiguate_macro opts status (text,prefix_len,ex) ->
797 | GrafiteAst.Tactic (_(*loc*), Some tac, punct) ->
798 let tac = apply_tactic ~disambiguate_tactic (text,prefix_len,tac) in
799 let status = eval_tactical status (tactic_of_ast' tac) in
800 (* CALL auto on every goal, easy way of testing it
803 (loc, ([],["depth","2";"timeout","1";"type","1"])) in
805 let auto = apply_tactic ~disambiguate_tactic ("",0,auto) in
806 let _ = eval_tactical status (tactic_of_ast' auto) in
807 print_endline "GOOD"; ()
808 with ProofEngineTypes.Fail _ -> print_endline "BAD" | _ -> ());*)
810 (punctuation_tactical_of_ast (text,prefix_len,punct)),[]
811 | GrafiteAst.Tactic (_, None, punct) ->
813 (punctuation_tactical_of_ast (text,prefix_len,punct)),[]
814 | GrafiteAst.NonPunctuationTactical (_, tac, punct) ->
817 (non_punctuation_tactical_of_ast (text,prefix_len,tac))
820 (punctuation_tactical_of_ast (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) status
850 let opts = { do_heavy_checks = do_heavy_checks ; } in
852 | GrafiteAst.Executable (_,ex) ->
853 eval_executable.ee_go ~disambiguate_tactic ~disambiguate_command
854 ~disambiguate_macro opts status (text,prefix_len,ex)
855 | GrafiteAst.Comment (_,c) -> eval_comment status (text,prefix_len,c),[]
858 let eval_ast = eval_ast.ea_go