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 exception IncludedFileNotCompiled of string (* file name *)
34 (Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro)
35 exception ReadOnlyUri of string
37 type 'a disambiguator_input = string * int * 'a
40 do_heavy_checks: bool ;
44 (** create a ProofEngineTypes.mk_fresh_name_type function which uses given
45 * names as long as they are available, then it fallbacks to name generation
46 * using FreshNamesGenerator module *)
48 let len = List.length names in
50 fun metasenv context name ~typ ->
51 if !count < len then begin
52 let name = Cic.Name (List.nth names !count) in
56 FreshNamesGenerator.mk_fresh_name ~subst:[] metasenv context name ~typ
58 let tactic_of_ast ast =
59 let module PET = ProofEngineTypes in
61 | GrafiteAst.Absurd (_, term) -> Tactics.absurd term
62 | GrafiteAst.Apply (_, term) -> Tactics.apply term
63 | GrafiteAst.ApplyS (_, term) ->
64 Tactics.applyS ~term ~dbd:(LibraryDb.instance ())
65 | GrafiteAst.Assumption _ -> Tactics.assumption
66 | GrafiteAst.Auto (_,params) ->
67 AutoTactic.auto_tac ~params ~dbd:(LibraryDb.instance ())
68 | GrafiteAst.Change (_, pattern, with_what) ->
69 Tactics.change ~pattern with_what
70 | GrafiteAst.Clear (_,id) -> Tactics.clear id
71 | GrafiteAst.ClearBody (_,id) -> Tactics.clearbody id
72 | GrafiteAst.Contradiction _ -> Tactics.contradiction
73 | GrafiteAst.Constructor (_, n) -> Tactics.constructor n
74 | GrafiteAst.Cut (_, ident, term) ->
75 let names = match ident with None -> [] | Some id -> [id] in
76 Tactics.cut ~mk_fresh_name_callback:(namer_of names) term
77 | GrafiteAst.Decompose (_, types, what, names) ->
78 let to_type = function
79 | GrafiteAst.Type (uri, typeno) -> uri, typeno
80 | GrafiteAst.Ident _ -> assert false
82 let user_types = List.rev_map to_type types in
83 let dbd = LibraryDb.instance () in
84 let mk_fresh_name_callback = namer_of names in
85 Tactics.decompose ~mk_fresh_name_callback ~dbd ~user_types ?what
86 | GrafiteAst.Demodulate _ -> Tactics.demodulate ~dbd:(LibraryDb.instance ())
87 | GrafiteAst.Discriminate (_,term) -> Tactics.discriminate term
88 | GrafiteAst.Elim (_, what, using, depth, names) ->
89 Tactics.elim_intros ?using ?depth ~mk_fresh_name_callback:(namer_of names)
91 | GrafiteAst.ElimType (_, what, using, depth, names) ->
92 Tactics.elim_type ?using ?depth ~mk_fresh_name_callback:(namer_of names)
94 | GrafiteAst.Exact (_, term) -> Tactics.exact term
95 | GrafiteAst.Exists _ -> Tactics.exists
96 | GrafiteAst.Fail _ -> Tactics.fail
97 | GrafiteAst.Fold (_, reduction_kind, term, pattern) ->
99 match reduction_kind with
101 PET.const_lazy_reduction
102 (CicReduction.normalize ~delta:false ~subst:[])
103 | `Reduce -> PET.const_lazy_reduction ProofEngineReduction.reduce
104 | `Simpl -> PET.const_lazy_reduction ProofEngineReduction.simpl
106 PET.const_lazy_reduction (ProofEngineReduction.unfold ?what:None)
107 | `Unfold (Some lazy_term) ->
108 (fun context metasenv ugraph ->
109 let what, metasenv, ugraph = lazy_term context metasenv ugraph in
110 ProofEngineReduction.unfold ~what, metasenv, ugraph)
112 PET.const_lazy_reduction (CicReduction.whd ~delta:false ~subst:[])
114 Tactics.fold ~reduction ~term ~pattern
115 | GrafiteAst.Fourier _ -> Tactics.fourier
116 | GrafiteAst.FwdSimpl (_, hyp, names) ->
117 Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names)
118 ~dbd:(LibraryDb.instance ()) hyp
119 | GrafiteAst.Generalize (_,pattern,ident) ->
120 let names = match ident with None -> [] | Some id -> [id] in
121 Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern
122 | GrafiteAst.Goal (_, n) -> Tactics.set_goal n
123 | GrafiteAst.IdTac _ -> Tactics.id
124 | GrafiteAst.Injection (_,term) -> Tactics.injection term
125 | GrafiteAst.Intros (_, None, names) ->
126 PrimitiveTactics.intros_tac ~mk_fresh_name_callback:(namer_of names) ()
127 | GrafiteAst.Intros (_, Some num, names) ->
128 PrimitiveTactics.intros_tac ~howmany:num
129 ~mk_fresh_name_callback:(namer_of names) ()
130 | GrafiteAst.Inversion (_, term) ->
131 Tactics.inversion term
132 | GrafiteAst.LApply (_, linear, how_many, to_what, what, ident) ->
133 let names = match ident with None -> [] | Some id -> [id] in
134 Tactics.lapply ~mk_fresh_name_callback:(namer_of names)
135 ~linear ?how_many ~to_what what
136 | GrafiteAst.Left _ -> Tactics.left
137 | GrafiteAst.LetIn (loc,term,name) ->
138 Tactics.letin term ~mk_fresh_name_callback:(namer_of [name])
139 | GrafiteAst.Reduce (_, reduction_kind, pattern) ->
140 (match reduction_kind with
141 | `Normalize -> Tactics.normalize ~pattern
142 | `Reduce -> Tactics.reduce ~pattern
143 | `Simpl -> Tactics.simpl ~pattern
144 | `Unfold what -> Tactics.unfold ~pattern what
145 | `Whd -> Tactics.whd ~pattern)
146 | GrafiteAst.Reflexivity _ -> Tactics.reflexivity
147 | GrafiteAst.Replace (_, pattern, with_what) ->
148 Tactics.replace ~pattern ~with_what
149 | GrafiteAst.Rewrite (_, direction, t, pattern) ->
150 EqualityTactics.rewrite_tac ~direction ~pattern t
151 | GrafiteAst.Right _ -> Tactics.right
152 | GrafiteAst.Ring _ -> Tactics.ring
153 | GrafiteAst.Split _ -> Tactics.split
154 | GrafiteAst.Symmetry _ -> Tactics.symmetry
155 | GrafiteAst.Transitivity (_, term) -> Tactics.transitivity term
157 (* maybe we only need special cases for apply and goal *)
158 let classify_tactic tactic =
160 (* tactics that can't close the goal (return a goal we want to "select") *)
161 | GrafiteAst.Rewrite _
163 | GrafiteAst.Replace _
164 | GrafiteAst.Reduce _
165 | GrafiteAst.Injection _
167 | GrafiteAst.Generalize _
170 | GrafiteAst.Decompose _ -> true, true
171 (* tactics we don't want to reorder goals. I think only Goal needs this. *)
172 | GrafiteAst.Goal _ -> false, true
173 (* tactics like apply *)
176 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
177 let module PEH = ProofEngineHelpers in
178 (* let print_m name metasenv =
179 prerr_endline (">>>>> " ^ name);
180 prerr_endline (CicMetaSubst.ppmetasenv [] metasenv)
182 (* phase one calculates:
183 * new_goals_from_refine: goals added by refine
184 * head_goal: the first goal opened by ythe tactic
185 * other_goals: other goals opened by the tactic
187 let new_goals_from_refine = PEH.compare_metasenvs start refine in
188 let new_goals_from_tactic = PEH.compare_metasenvs refine tactic in
189 let head_goal, other_goals, goals =
191 | [] -> None,[],goals
193 (* assert (List.mem hd new_goals_from_tactic);
194 * invalidato dalla goal_tac
196 Some hd, List.filter ((<>) hd) new_goals_from_tactic, List.filter ((<>)
201 | None -> new_goals_from_refine @ other_goals
202 | Some x -> x :: new_goals_from_refine @ other_goals
204 (* extract the metas generated by refine and tactic *)
205 let metas_for_tactic_head =
208 | Some head_goal -> List.filter (fun (n,_,_) -> n = head_goal) tactic in
209 let metas_for_tactic_goals =
211 (fun x -> List.find (fun (metano,_,_) -> metano = x) tactic)
214 let metas_for_refine_goals =
215 List.filter (fun (n,_,_) -> List.mem n new_goals_from_refine) tactic in
216 let produced_metas, goals =
218 if always_opens_a_goal then
219 metas_for_tactic_head @ metas_for_refine_goals @
220 metas_for_tactic_goals
222 (* print_m "metas_for_refine_goals" metas_for_refine_goals;
223 print_m "metas_for_tactic_head" metas_for_tactic_head;
224 print_m "metas_for_tactic_goals" metas_for_tactic_goals; *)
225 metas_for_refine_goals @ metas_for_tactic_head @
226 metas_for_tactic_goals
229 let goals = List.map (fun (metano, _, _) -> metano) produced_metas in
230 produced_metas, goals
232 (* residual metas, preserving the original order *)
237 | (metano, _, _) :: tl when metano = e ->
238 [], List.map (fun (x,_,_) -> x) tl
239 | (metano, _, _) :: tl -> let b, a = split e tl in metano :: b, a
241 let find n metasenv =
243 Some (List.find (fun (metano, _, _) -> metano = n) metasenv)
244 with Not_found -> None
249 match find n tactic with
253 let before_l, after_l = split current_goal start in
255 List.filter (fun x -> not (List.mem x produced_goals)) before_l in
257 List.filter (fun x -> not (List.mem x produced_goals)) after_l in
258 let before = extract before_l in
259 let after = extract after_l in
263 print_m "BEGIN" start;
264 prerr_endline ("goal was: " ^ string_of_int current_goal);
265 prerr_endline ("and metas from refine are:");
267 (fun t -> prerr_string (" " ^ string_of_int t))
268 new_goals_from_refine;
270 print_m "before" before;
271 print_m "metas_for_tactic_head" metas_for_tactic_head;
272 print_m "metas_for_refine_goals" metas_for_refine_goals;
273 print_m "metas_for_tactic_goals" metas_for_tactic_goals;
274 print_m "produced_metas" produced_metas;
275 print_m "after" after;
276 |+ FINE DEBUG CODE +| *)
277 before @ produced_metas @ after, goals
279 let apply_tactic ~disambiguate_tactic (text,prefix_len,tactic) (status, goal) =
280 (* prerr_endline "apply_tactic"; *)
281 (* prerr_endline (Continuationals.Stack.pp (GrafiteTypes.get_stack status)); *)
282 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
283 let before = List.map (fun g, _, _ -> g) starting_metasenv in
284 (* prerr_endline "disambiguate"; *)
285 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
286 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
287 let proof = GrafiteTypes.get_current_proof status in
288 let proof_status = proof, goal in
289 let needs_reordering, always_opens_a_goal = classify_tactic tactic in
290 let tactic = tactic_of_ast tactic in
291 (* apply tactic will change the lexicon_status ... *)
292 (* prerr_endline "apply_tactic bassa"; *)
293 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
294 let after = ProofEngineTypes.goals_of_proof proof in
295 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
296 (* prerr_endline("before: " ^ String.concat ", " (List.map string_of_int before));
297 prerr_endline("after: " ^ String.concat ", " (List.map string_of_int after));
298 prerr_endline("opened: " ^ String.concat ", " (List.map string_of_int opened)); *)
299 (* prerr_endline("opened_goals: " ^ String.concat ", " (List.map string_of_int opened_goals));
300 prerr_endline("closed_goals: " ^ String.concat ", " (List.map string_of_int closed_goals)); *)
301 let proof, opened_goals =
302 if needs_reordering then begin
303 let uri, metasenv_after_tactic, t, ty = proof in
304 (* prerr_endline ("goal prima del riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof))); *)
305 let reordered_metasenv, opened_goals =
308 metasenv_after_refinement metasenv_after_tactic
309 opened goal always_opens_a_goal
311 let proof' = uri, reordered_metasenv, t, ty in
312 (* prerr_endline ("goal dopo il riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof'))); *)
318 let incomplete_proof =
319 match status.GrafiteTypes.proof_status with
320 | GrafiteTypes.Incomplete_proof p -> p
323 { status with GrafiteTypes.proof_status =
324 GrafiteTypes.Incomplete_proof
325 { incomplete_proof with GrafiteTypes.proof = proof } },
326 opened_goals, closed_goals
330 'term 'lazy_term 'reduction 'obj 'ident.
332 (GrafiteTypes.status ->
333 ProofEngineTypes.goal ->
334 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
335 disambiguator_input ->
336 GrafiteTypes.status *
337 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
339 disambiguate_command:
340 (GrafiteTypes.status ->
341 ('obj GrafiteAst.command) disambiguator_input ->
342 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
345 (GrafiteTypes.status ->
346 ('term GrafiteAst.macro) disambiguator_input ->
347 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
349 ?do_heavy_checks:bool ->
350 ?clean_baseuri:bool ->
351 GrafiteTypes.status ->
352 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
353 disambiguator_input ->
354 GrafiteTypes.status * UriManager.uri list
357 type 'a eval_command =
359 disambiguate_command:
360 (GrafiteTypes.status -> ('obj GrafiteAst.command) disambiguator_input ->
361 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
362 options -> GrafiteTypes.status ->
363 ('obj GrafiteAst.command) disambiguator_input ->
364 GrafiteTypes.status * UriManager.uri list
367 type 'a eval_executable =
368 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
370 (GrafiteTypes.status ->
371 ProofEngineTypes.goal ->
372 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
373 disambiguator_input ->
374 GrafiteTypes.status *
375 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
377 disambiguate_command:
378 (GrafiteTypes.status ->
379 ('obj GrafiteAst.command) disambiguator_input ->
380 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
383 (GrafiteTypes.status ->
384 ('term GrafiteAst.macro) disambiguator_input ->
385 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
388 GrafiteTypes.status ->
389 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
390 GrafiteTypes.status * UriManager.uri list
393 type 'a eval_from_moo =
394 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
396 let coercion_moo_statement_of uri =
397 GrafiteAst.Coercion (HExtlib.dummy_floc, uri, false)
399 let refinement_toolkit = {
400 RefinementTool.type_of_aux' =
401 (fun ?localization_tbl e c t u ->
402 let saved = !CicRefine.insert_coercions in
403 CicRefine.insert_coercions:= false;
406 let t, ty, metasenv, ugraph =
407 CicRefine.type_of_aux' ?localization_tbl e c t u in
408 RefinementTool.Success (t, ty, metasenv, ugraph)
410 | CicRefine.RefineFailure s
411 | CicRefine.Uncertain s
412 | CicRefine.AssertFailure s -> RefinementTool.Exception s
414 CicRefine.insert_coercions := saved;
416 RefinementTool.ppsubst = CicMetaSubst.ppsubst;
417 RefinementTool.apply_subst = CicMetaSubst.apply_subst;
418 RefinementTool.ppmetasenv = CicMetaSubst.ppmetasenv;
419 RefinementTool.pack_coercion_obj = CicRefine.pack_coercion_obj;
422 let eval_coercion status ~add_composites uri =
423 let status,compounds =
424 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri in
425 let moo_content = coercion_moo_statement_of uri in
426 let status = GrafiteTypes.add_moo_content [moo_content] status in
427 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
430 let eval_tactical ~disambiguate_tactic status tac =
431 let apply_tactic = apply_tactic ~disambiguate_tactic in
432 let module MatitaStatus =
434 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
437 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
439 type tactic = input_status -> output_status
441 let id_tactic = apply_tactic ("",0,(GrafiteAst.IdTac HExtlib.dummy_floc))
442 let mk_tactic tac = tac
443 let apply_tactic tac = tac
444 let goals (_, opened, closed) = opened, closed
445 let set_goals (opened, closed) (status, _, _) = (status, opened, closed)
446 let get_stack (status, _) = GrafiteTypes.get_stack status
448 let set_stack stack (status, opened, closed) =
449 GrafiteTypes.set_stack stack status, opened, closed
451 let inject (status, _) = (status, [], [])
452 let focus goal (status, _, _) = (status, goal)
455 let module MatitaTacticals = Tacticals.Make (MatitaStatus) in
456 let rec tactical_of_ast l (text,prefix_len,tac) =
457 let apply_tactic t = apply_tactic (text, prefix_len, t) in
458 let tactical_of_ast l t = tactical_of_ast l (text,prefix_len,t) in
460 | GrafiteAst.Tactic (loc, tactic) ->
461 MatitaTacticals.tactic (MatitaStatus.mk_tactic (apply_tactic tactic))
462 | GrafiteAst.Seq (loc, tacticals) -> (* tac1; tac2; ... *)
464 MatitaTacticals.seq ~tactics:(List.map (tactical_of_ast (l+1)) tacticals)
465 | GrafiteAst.Do (loc, n, tactical) ->
466 MatitaTacticals.do_tactic ~n ~tactic:(tactical_of_ast (l+1) tactical)
467 | GrafiteAst.Repeat (loc, tactical) ->
468 MatitaTacticals.repeat_tactic ~tactic:(tactical_of_ast (l+1) tactical)
469 | GrafiteAst.Then (loc, tactical, tacticals) -> (* tac; [ tac1 | ... ] *)
471 MatitaTacticals.thens ~start:(tactical_of_ast (l+1) tactical)
472 ~continuations:(List.map (tactical_of_ast (l+1)) tacticals)
473 | GrafiteAst.First (loc, tacticals) ->
474 MatitaTacticals.first
475 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
476 | GrafiteAst.Try (loc, tactical) ->
477 MatitaTacticals.try_tactic ~tactic:(tactical_of_ast (l+1) tactical)
478 | GrafiteAst.Solve (loc, tacticals) ->
479 MatitaTacticals.solve_tactics
480 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
482 | GrafiteAst.Skip _loc -> MatitaTacticals.skip
483 | GrafiteAst.Dot _loc -> MatitaTacticals.dot
484 | GrafiteAst.Semicolon _loc -> MatitaTacticals.semicolon
485 | GrafiteAst.Branch _loc -> MatitaTacticals.branch
486 | GrafiteAst.Shift _loc -> MatitaTacticals.shift
487 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.pos i
488 | GrafiteAst.Merge _loc -> MatitaTacticals.merge
489 | GrafiteAst.Focus (_loc, goals) -> MatitaTacticals.focus goals
490 | GrafiteAst.Unfocus _loc -> MatitaTacticals.unfocus
491 | GrafiteAst.Wildcard _loc -> MatitaTacticals.wildcard
493 let status, _, _ = tactical_of_ast 0 tac (status, ~-1) in
494 let status = (* is proof completed? *)
495 match status.GrafiteTypes.proof_status with
496 | GrafiteTypes.Incomplete_proof
497 { GrafiteTypes.stack = stack; proof = proof }
498 when Continuationals.Stack.is_empty stack ->
499 { status with GrafiteTypes.proof_status = GrafiteTypes.Proof proof }
504 let eval_comment status c = status
506 (* since the record syntax allows to declare coercions, we have to put this
507 * information inside the moo *)
508 let add_coercions_of_record_to_moo obj lemmas status =
509 let attributes = CicUtil.attributes_of_obj obj in
510 let is_record = function `Class (`Record att) -> Some att | _-> None in
511 match HExtlib.list_findopt is_record attributes with
514 let is_a_coercion uri =
517 CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri in
518 let attrs = CicUtil.attributes_of_obj obj in
519 List.mem (`Class `Projection) attrs
520 with Not_found -> assert false
522 (* looking at the fields we can know the 'wanted' coercions, but not the
523 * actually generated ones. So, only the intersection between the wanted
524 * and the actual should be in the moo as coercion, while everithing in
525 * lemmas should go as aliases *)
526 let wanted_coercions =
531 (UriManager.uri_of_string
532 (GrafiteTypes.qualify status name ^ ".con"))
537 prerr_endline "wanted coercions:";
539 (fun u -> prerr_endline (UriManager.string_of_uri u))
541 let coercions, moo_content =
545 let is_a_wanted_coercion =
546 List.exists (UriManager.eq uri) wanted_coercions in
547 if is_a_coercion uri && is_a_wanted_coercion then
548 Some (uri, coercion_moo_statement_of uri)
553 (* prerr_endline "actual coercions:";
555 (fun u -> prerr_endline (UriManager.string_of_uri u))
557 let status = GrafiteTypes.add_moo_content moo_content status in
559 GrafiteTypes.coercions = coercions @ status.GrafiteTypes.coercions},
562 let add_obj uri obj status =
563 let status,lemmas = GrafiteSync.add_obj refinement_toolkit uri obj status in
566 let rec eval_command = {ec_go = fun ~disambiguate_command opts status
567 (text,prefix_len,cmd) ->
568 let status,cmd = disambiguate_command status (text,prefix_len,cmd) in
571 | GrafiteAst.Default (loc, what, uris) as cmd ->
572 LibraryObjects.set_default what uris;
573 GrafiteTypes.add_moo_content [cmd] status,[]
574 | GrafiteAst.Include (loc, baseuri) ->
575 let moopath_rw, moopath_r =
576 LibraryMisc.obj_file_of_baseuri
577 ~must_exist:false ~baseuri ~writable:true,
578 LibraryMisc.obj_file_of_baseuri
579 ~must_exist:false ~baseuri ~writable:false
582 if Sys.file_exists moopath_r then moopath_r else
583 if Sys.file_exists moopath_rw then moopath_rw else
584 raise (IncludedFileNotCompiled moopath_rw)
586 let status = eval_from_moo.efm_go status moopath in
588 | GrafiteAst.Set (loc, name, value) ->
589 if name = "baseuri" then begin
591 let v = Http_getter_misc.strip_trailing_slash value in
593 ignore (String.index v ' ');
594 GrafiteTypes.command_error "baseuri can't contain spaces"
597 if Http_getter_storage.is_read_only value then begin
598 HLog.error (sprintf "uri %s belongs to a read-only repository" value);
599 raise (ReadOnlyUri value)
601 if not (Http_getter_storage.is_empty value) &&
604 HLog.message ("baseuri " ^ value ^ " is not empty");
605 HLog.message ("cleaning baseuri " ^ value);
606 LibraryClean.clean_baseuris [value];
607 assert (Http_getter_storage.is_empty value);
610 (Filename.dirname (Http_getter.filename ~writable:true (value ^
613 GrafiteTypes.set_option status name value,[]
614 | GrafiteAst.Drop loc -> raise Drop
615 | GrafiteAst.Qed loc ->
616 let uri, metasenv, bo, ty =
617 match status.GrafiteTypes.proof_status with
618 | GrafiteTypes.Proof (Some uri, metasenv, body, ty) ->
619 uri, metasenv, body, ty
620 | GrafiteTypes.Proof (None, metasenv, body, ty) ->
621 raise (GrafiteTypes.Command_error
622 ("Someone allows to start a theorem without giving the "^
623 "name/uri. This should be fixed!"))
626 (GrafiteTypes.Command_error "You can't Qed an incomplete theorem")
628 if metasenv <> [] then
630 (GrafiteTypes.Command_error
631 "Proof not completed! metasenv is not empty!");
632 let name = UriManager.name_of_uri uri in
633 let obj = Cic.Constant (name,Some bo,ty,[],[]) in
634 let status, lemmas = add_obj uri obj status in
635 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
637 | GrafiteAst.Coercion (loc, uri, add_composites) ->
638 eval_coercion status ~add_composites uri
639 | GrafiteAst.Obj (loc,obj) ->
642 Cic.Constant (name,_,_,_,_)
643 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
644 | Cic.InductiveDefinition (types,_,_,_) ->
646 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
647 | _ -> assert false in
649 UriManager.uri_of_string (GrafiteTypes.qualify status name ^ ext) in
650 let obj = CicRefine.pack_coercion_obj obj in
651 let metasenv = GrafiteTypes.get_proof_metasenv status in
653 | Cic.CurrentProof (_,metasenv',bo,ty,_,_) ->
654 let name = UriManager.name_of_uri uri in
655 if not(CicPp.check name ty) then
656 HLog.error ("Bad name: " ^ name);
657 if opts.do_heavy_checks then
659 let dbd = LibraryDb.instance () in
660 let similar = Whelp.match_term ~dbd ty in
661 let similar_len = List.length similar in
662 if similar_len> 30 then
664 ("Duplicate check will compare your theorem with " ^
665 string_of_int similar_len ^
666 " theorems, this may take a while."));
670 let t = CicUtil.term_of_uri u in
672 CicTypeChecker.type_of_aux'
673 metasenv' [] t CicUniv.empty_ugraph
675 fst(CicReduction.are_convertible [] ty' ty g))
678 (match convertible with
682 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
683 "\nPlease use a variant."));
685 let initial_proof = (Some uri, metasenv', bo, ty) in
686 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
687 { status with GrafiteTypes.proof_status =
688 GrafiteTypes.Incomplete_proof
689 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
692 if metasenv <> [] then
693 raise (GrafiteTypes.Command_error (
694 "metasenv not empty while giving a definition with body: " ^
695 CicMetaSubst.ppmetasenv [] metasenv));
696 let status, lemmas = add_obj uri obj status in
697 let status,new_lemmas =
698 add_coercions_of_record_to_moo obj lemmas status
700 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
701 uri::new_lemmas@lemmas
703 match status.GrafiteTypes.proof_status with
704 GrafiteTypes.Intermediate _ ->
705 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
708 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
709 ~disambiguate_macro opts status (text,prefix_len,ex) ->
711 | GrafiteAst.Tactical (_, tac, None) ->
712 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac),[]
713 | GrafiteAst.Tactical (_, tac, Some punct) ->
715 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac) in
716 eval_tactical ~disambiguate_tactic status (text,prefix_len,punct),[]
717 | GrafiteAst.Command (_, cmd) ->
718 eval_command.ec_go ~disambiguate_command opts status (text,prefix_len,cmd)
719 | GrafiteAst.Macro (loc, macro) ->
720 raise (Macro (loc,disambiguate_macro status (text,prefix_len,macro)))
722 } and eval_from_moo = {efm_go = fun status fname ->
724 ("",0,GrafiteAst.Executable (HExtlib.dummy_floc,
725 GrafiteAst.Command (HExtlib.dummy_floc,
728 let moo = GrafiteMarshal.load_moo fname in
731 let ast = ast_of_cmd ast in
734 ~disambiguate_tactic:(fun status _ (_,_,tactic) -> status,tactic)
735 ~disambiguate_command:(fun status (_,_,cmd) -> status,cmd)
736 ~disambiguate_macro:(fun _ _ -> assert false)
742 } and eval_ast = {ea_go = fun ~disambiguate_tactic ~disambiguate_command
743 ~disambiguate_macro ?(do_heavy_checks=false) ?(clean_baseuri=true) status
747 do_heavy_checks = do_heavy_checks ;
748 clean_baseuri = clean_baseuri }
751 | GrafiteAst.Executable (_,ex) ->
752 eval_executable.ee_go ~disambiguate_tactic ~disambiguate_command
753 ~disambiguate_macro opts status (text,prefix_len,ex)
754 | GrafiteAst.Comment (_,c) -> eval_comment status (text,prefix_len,c),[]
757 let eval_ast = eval_ast.ea_go