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.Discriminate (_,term) -> Tactics.discriminate term
87 | GrafiteAst.Elim (_, what, using, depth, names) ->
88 Tactics.elim_intros ?using ?depth ~mk_fresh_name_callback:(namer_of names)
90 | GrafiteAst.ElimType (_, what, using, depth, names) ->
91 Tactics.elim_type ?using ?depth ~mk_fresh_name_callback:(namer_of names)
93 | GrafiteAst.Exact (_, term) -> Tactics.exact term
94 | GrafiteAst.Exists _ -> Tactics.exists
95 | GrafiteAst.Fail _ -> Tactics.fail
96 | GrafiteAst.Fold (_, reduction_kind, term, pattern) ->
98 match reduction_kind with
100 GrafiteTypes.command_error "demodulation can't be folded"
102 PET.const_lazy_reduction
103 (CicReduction.normalize ~delta:false ~subst:[])
104 | `Reduce -> PET.const_lazy_reduction ProofEngineReduction.reduce
105 | `Simpl -> PET.const_lazy_reduction ProofEngineReduction.simpl
107 PET.const_lazy_reduction (ProofEngineReduction.unfold ?what:None)
108 | `Unfold (Some lazy_term) ->
109 (fun context metasenv ugraph ->
110 let what, metasenv, ugraph = lazy_term context metasenv ugraph in
111 ProofEngineReduction.unfold ~what, metasenv, ugraph)
113 PET.const_lazy_reduction (CicReduction.whd ~delta:false ~subst:[])
115 Tactics.fold ~reduction ~term ~pattern
116 | GrafiteAst.Fourier _ -> Tactics.fourier
117 | GrafiteAst.FwdSimpl (_, hyp, names) ->
118 Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names)
119 ~dbd:(LibraryDb.instance ()) hyp
120 | GrafiteAst.Generalize (_,pattern,ident) ->
121 let names = match ident with None -> [] | Some id -> [id] in
122 Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern
123 | GrafiteAst.Goal (_, n) -> Tactics.set_goal n
124 | GrafiteAst.IdTac _ -> Tactics.id
125 | GrafiteAst.Injection (_,term) -> Tactics.injection term
126 | GrafiteAst.Intros (_, None, names) ->
127 PrimitiveTactics.intros_tac ~mk_fresh_name_callback:(namer_of names) ()
128 | GrafiteAst.Intros (_, Some num, names) ->
129 PrimitiveTactics.intros_tac ~howmany:num
130 ~mk_fresh_name_callback:(namer_of names) ()
131 | GrafiteAst.Inversion (_, term) ->
132 Tactics.inversion term
133 | GrafiteAst.LApply (_, how_many, to_what, what, ident) ->
134 let names = match ident with None -> [] | Some id -> [id] in
135 Tactics.lapply ~mk_fresh_name_callback:(namer_of names) ?how_many
137 | GrafiteAst.Left _ -> Tactics.left
138 | GrafiteAst.LetIn (loc,term,name) ->
139 Tactics.letin term ~mk_fresh_name_callback:(namer_of [name])
140 | GrafiteAst.Reduce (_, reduction_kind, pattern) ->
141 (match reduction_kind with
142 | `Demodulate -> Tactics.demodulate ~dbd:(LibraryDb.instance ()) ~pattern
143 | `Normalize -> Tactics.normalize ~pattern
144 | `Reduce -> Tactics.reduce ~pattern
145 | `Simpl -> Tactics.simpl ~pattern
146 | `Unfold what -> Tactics.unfold ~pattern what
147 | `Whd -> Tactics.whd ~pattern)
148 | GrafiteAst.Reflexivity _ -> Tactics.reflexivity
149 | GrafiteAst.Replace (_, pattern, with_what) ->
150 Tactics.replace ~pattern ~with_what
151 | GrafiteAst.Rewrite (_, direction, t, pattern) ->
152 EqualityTactics.rewrite_tac ~direction ~pattern t
153 | GrafiteAst.Right _ -> Tactics.right
154 | GrafiteAst.Ring _ -> Tactics.ring
155 | GrafiteAst.Split _ -> Tactics.split
156 | GrafiteAst.Symmetry _ -> Tactics.symmetry
157 | GrafiteAst.Transitivity (_, term) -> Tactics.transitivity term
159 (* maybe we only need special cases for apply and goal *)
160 let classify_tactic tactic =
162 (* tactics that can't close the goal (return a goal we want to "select") *)
163 | GrafiteAst.Rewrite _
165 | GrafiteAst.Replace _
166 | GrafiteAst.Reduce _
167 | GrafiteAst.Injection _
169 | GrafiteAst.Generalize _
172 | GrafiteAst.Decompose _ -> true, true
173 (* tactics we don't want to reorder goals. I think only Goal needs this. *)
174 | GrafiteAst.Goal _ -> false, true
175 (* tactics like apply *)
178 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
179 let module PEH = ProofEngineHelpers in
180 (* let print_m name metasenv =
181 prerr_endline (">>>>> " ^ name);
182 prerr_endline (CicMetaSubst.ppmetasenv [] metasenv)
184 (* phase one calculates:
185 * new_goals_from_refine: goals added by refine
186 * head_goal: the first goal opened by ythe tactic
187 * other_goals: other goals opened by the tactic
189 let new_goals_from_refine = PEH.compare_metasenvs start refine in
190 let new_goals_from_tactic = PEH.compare_metasenvs refine tactic in
191 let head_goal, other_goals, goals =
193 | [] -> None,[],goals
195 (* assert (List.mem hd new_goals_from_tactic);
196 * invalidato dalla goal_tac
198 Some hd, List.filter ((<>) hd) new_goals_from_tactic, List.filter ((<>)
203 | None -> new_goals_from_refine @ other_goals
204 | Some x -> x :: new_goals_from_refine @ other_goals
206 (* extract the metas generated by refine and tactic *)
207 let metas_for_tactic_head =
210 | Some head_goal -> List.filter (fun (n,_,_) -> n = head_goal) tactic in
211 let metas_for_tactic_goals =
213 (fun x -> List.find (fun (metano,_,_) -> metano = x) tactic)
216 let metas_for_refine_goals =
217 List.filter (fun (n,_,_) -> List.mem n new_goals_from_refine) tactic in
218 let produced_metas, goals =
220 if always_opens_a_goal then
221 metas_for_tactic_head @ metas_for_refine_goals @
222 metas_for_tactic_goals
224 (* print_m "metas_for_refine_goals" metas_for_refine_goals;
225 print_m "metas_for_tactic_head" metas_for_tactic_head;
226 print_m "metas_for_tactic_goals" metas_for_tactic_goals; *)
227 metas_for_refine_goals @ metas_for_tactic_head @
228 metas_for_tactic_goals
231 let goals = List.map (fun (metano, _, _) -> metano) produced_metas in
232 produced_metas, goals
234 (* residual metas, preserving the original order *)
239 | (metano, _, _) :: tl when metano = e ->
240 [], List.map (fun (x,_,_) -> x) tl
241 | (metano, _, _) :: tl -> let b, a = split e tl in metano :: b, a
243 let find n metasenv =
245 Some (List.find (fun (metano, _, _) -> metano = n) metasenv)
246 with Not_found -> None
251 match find n tactic with
255 let before_l, after_l = split current_goal start in
257 List.filter (fun x -> not (List.mem x produced_goals)) before_l in
259 List.filter (fun x -> not (List.mem x produced_goals)) after_l in
260 let before = extract before_l in
261 let after = extract after_l in
265 print_m "BEGIN" start;
266 prerr_endline ("goal was: " ^ string_of_int current_goal);
267 prerr_endline ("and metas from refine are:");
269 (fun t -> prerr_string (" " ^ string_of_int t))
270 new_goals_from_refine;
272 print_m "before" before;
273 print_m "metas_for_tactic_head" metas_for_tactic_head;
274 print_m "metas_for_refine_goals" metas_for_refine_goals;
275 print_m "metas_for_tactic_goals" metas_for_tactic_goals;
276 print_m "produced_metas" produced_metas;
277 print_m "after" after;
278 |+ FINE DEBUG CODE +| *)
279 before @ produced_metas @ after, goals
281 let apply_tactic ~disambiguate_tactic (text,prefix_len,tactic) (status, goal) =
282 (* prerr_endline "apply_tactic"; *)
283 (* prerr_endline (Continuationals.Stack.pp (GrafiteTypes.get_stack status)); *)
284 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
285 let before = List.map (fun g, _, _ -> g) starting_metasenv in
286 (* prerr_endline "disambiguate"; *)
287 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
288 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
289 let proof = GrafiteTypes.get_current_proof status in
290 let proof_status = proof, goal in
291 let needs_reordering, always_opens_a_goal = classify_tactic tactic in
292 let tactic = tactic_of_ast tactic in
293 (* apply tactic will change the lexicon_status ... *)
294 (* prerr_endline "apply_tactic bassa"; *)
295 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
296 let after = ProofEngineTypes.goals_of_proof proof in
297 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
298 (* prerr_endline("before: " ^ String.concat ", " (List.map string_of_int before));
299 prerr_endline("after: " ^ String.concat ", " (List.map string_of_int after));
300 prerr_endline("opened: " ^ String.concat ", " (List.map string_of_int opened)); *)
301 (* prerr_endline("opened_goals: " ^ String.concat ", " (List.map string_of_int opened_goals));
302 prerr_endline("closed_goals: " ^ String.concat ", " (List.map string_of_int closed_goals)); *)
303 let proof, opened_goals =
304 if needs_reordering then begin
305 let uri, metasenv_after_tactic, t, ty = proof in
306 (* prerr_endline ("goal prima del riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof))); *)
307 let reordered_metasenv, opened_goals =
310 metasenv_after_refinement metasenv_after_tactic
311 opened goal always_opens_a_goal
313 let proof' = uri, reordered_metasenv, t, ty in
314 (* prerr_endline ("goal dopo il riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof'))); *)
320 let incomplete_proof =
321 match status.GrafiteTypes.proof_status with
322 | GrafiteTypes.Incomplete_proof p -> p
325 { status with GrafiteTypes.proof_status =
326 GrafiteTypes.Incomplete_proof
327 { incomplete_proof with GrafiteTypes.proof = proof } },
328 opened_goals, closed_goals
332 'term 'lazy_term 'reduction 'obj 'ident.
334 (GrafiteTypes.status ->
335 ProofEngineTypes.goal ->
336 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
337 disambiguator_input ->
338 GrafiteTypes.status *
339 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
341 disambiguate_command:
342 (GrafiteTypes.status ->
343 ('obj GrafiteAst.command) disambiguator_input ->
344 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
347 (GrafiteTypes.status ->
348 ('term GrafiteAst.macro) disambiguator_input ->
349 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
351 ?do_heavy_checks:bool ->
352 ?clean_baseuri:bool ->
353 GrafiteTypes.status ->
354 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
355 disambiguator_input ->
356 GrafiteTypes.status * UriManager.uri list
359 type 'a eval_command =
361 disambiguate_command:
362 (GrafiteTypes.status -> ('obj GrafiteAst.command) disambiguator_input ->
363 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
364 options -> GrafiteTypes.status ->
365 ('obj GrafiteAst.command) disambiguator_input ->
366 GrafiteTypes.status * UriManager.uri list
369 type 'a eval_executable =
370 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
372 (GrafiteTypes.status ->
373 ProofEngineTypes.goal ->
374 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
375 disambiguator_input ->
376 GrafiteTypes.status *
377 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
379 disambiguate_command:
380 (GrafiteTypes.status ->
381 ('obj GrafiteAst.command) disambiguator_input ->
382 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
385 (GrafiteTypes.status ->
386 ('term GrafiteAst.macro) disambiguator_input ->
387 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
390 GrafiteTypes.status ->
391 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
392 GrafiteTypes.status * UriManager.uri list
395 type 'a eval_from_moo =
396 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
398 let coercion_moo_statement_of uri =
399 GrafiteAst.Coercion (HExtlib.dummy_floc, uri, false)
401 let refinement_toolkit = {
402 RefinementTool.type_of_aux' =
403 (fun ?localization_tbl e c t u ->
404 let saved = !CicRefine.insert_coercions in
405 CicRefine.insert_coercions:= false;
408 let t, ty, metasenv, ugraph =
409 CicRefine.type_of_aux' ?localization_tbl e c t u in
410 RefinementTool.Success (t, ty, metasenv, ugraph)
412 | CicRefine.RefineFailure s
413 | CicRefine.Uncertain s
414 | CicRefine.AssertFailure s -> RefinementTool.Exception s
416 CicRefine.insert_coercions := saved;
418 RefinementTool.ppsubst = CicMetaSubst.ppsubst;
419 RefinementTool.apply_subst = CicMetaSubst.apply_subst;
420 RefinementTool.ppmetasenv = CicMetaSubst.ppmetasenv;
421 RefinementTool.pack_coercion_obj = CicRefine.pack_coercion_obj;
424 let eval_coercion status ~add_composites uri =
425 let status,compounds =
426 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri in
427 let moo_content = coercion_moo_statement_of uri in
428 let status = GrafiteTypes.add_moo_content [moo_content] status in
429 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
432 let eval_tactical ~disambiguate_tactic status tac =
433 let apply_tactic = apply_tactic ~disambiguate_tactic in
434 let module MatitaStatus =
436 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
439 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
441 type tactic = input_status -> output_status
443 let id_tactic = apply_tactic ("",0,(GrafiteAst.IdTac HExtlib.dummy_floc))
444 let mk_tactic tac = tac
445 let apply_tactic tac = tac
446 let goals (_, opened, closed) = opened, closed
447 let set_goals (opened, closed) (status, _, _) = (status, opened, closed)
448 let get_stack (status, _) = GrafiteTypes.get_stack status
450 let set_stack stack (status, opened, closed) =
451 GrafiteTypes.set_stack stack status, opened, closed
453 let inject (status, _) = (status, [], [])
454 let focus goal (status, _, _) = (status, goal)
457 let module MatitaTacticals = Tacticals.Make (MatitaStatus) in
458 let rec tactical_of_ast l (text,prefix_len,tac) =
459 let apply_tactic t = apply_tactic (text, prefix_len, t) in
460 let tactical_of_ast l t = tactical_of_ast l (text,prefix_len,t) in
462 | GrafiteAst.Tactic (loc, tactic) ->
463 MatitaTacticals.tactic (MatitaStatus.mk_tactic (apply_tactic tactic))
464 | GrafiteAst.Seq (loc, tacticals) -> (* tac1; tac2; ... *)
466 MatitaTacticals.seq ~tactics:(List.map (tactical_of_ast (l+1)) tacticals)
467 | GrafiteAst.Do (loc, n, tactical) ->
468 MatitaTacticals.do_tactic ~n ~tactic:(tactical_of_ast (l+1) tactical)
469 | GrafiteAst.Repeat (loc, tactical) ->
470 MatitaTacticals.repeat_tactic ~tactic:(tactical_of_ast (l+1) tactical)
471 | GrafiteAst.Then (loc, tactical, tacticals) -> (* tac; [ tac1 | ... ] *)
473 MatitaTacticals.thens ~start:(tactical_of_ast (l+1) tactical)
474 ~continuations:(List.map (tactical_of_ast (l+1)) tacticals)
475 | GrafiteAst.First (loc, tacticals) ->
476 MatitaTacticals.first
477 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
478 | GrafiteAst.Try (loc, tactical) ->
479 MatitaTacticals.try_tactic ~tactic:(tactical_of_ast (l+1) tactical)
480 | GrafiteAst.Solve (loc, tacticals) ->
481 MatitaTacticals.solve_tactics
482 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
484 | GrafiteAst.Skip _loc -> MatitaTacticals.skip
485 | GrafiteAst.Dot _loc -> MatitaTacticals.dot
486 | GrafiteAst.Semicolon _loc -> MatitaTacticals.semicolon
487 | GrafiteAst.Branch _loc -> MatitaTacticals.branch
488 | GrafiteAst.Shift _loc -> MatitaTacticals.shift
489 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.pos i
490 | GrafiteAst.Merge _loc -> MatitaTacticals.merge
491 | GrafiteAst.Focus (_loc, goals) -> MatitaTacticals.focus goals
492 | GrafiteAst.Unfocus _loc -> MatitaTacticals.unfocus
493 | GrafiteAst.Wildcard _loc -> MatitaTacticals.wildcard
495 let status, _, _ = tactical_of_ast 0 tac (status, ~-1) in
496 let status = (* is proof completed? *)
497 match status.GrafiteTypes.proof_status with
498 | GrafiteTypes.Incomplete_proof
499 { GrafiteTypes.stack = stack; proof = proof }
500 when Continuationals.Stack.is_empty stack ->
501 { status with GrafiteTypes.proof_status = GrafiteTypes.Proof proof }
506 let eval_comment status c = status
508 (* since the record syntax allows to declare coercions, we have to put this
509 * information inside the moo *)
510 let add_coercions_of_record_to_moo obj lemmas status =
511 let attributes = CicUtil.attributes_of_obj obj in
512 let is_record = function `Class (`Record att) -> Some att | _-> None in
513 match HExtlib.list_findopt is_record attributes with
516 let is_a_coercion uri =
519 CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri in
520 let attrs = CicUtil.attributes_of_obj obj in
521 List.mem (`Class `Projection) attrs
522 with Not_found -> assert false
524 (* looking at the fields we can know the 'wanted' coercions, but not the
525 * actually generated ones. So, only the intersection between the wanted
526 * and the actual should be in the moo as coercion, while everithing in
527 * lemmas should go as aliases *)
528 let wanted_coercions =
533 (UriManager.uri_of_string
534 (GrafiteTypes.qualify status name ^ ".con"))
539 prerr_endline "wanted coercions:";
541 (fun u -> prerr_endline (UriManager.string_of_uri u))
543 let coercions, moo_content =
547 let is_a_wanted_coercion =
548 List.exists (UriManager.eq uri) wanted_coercions in
549 if is_a_coercion uri && is_a_wanted_coercion then
550 Some (uri, coercion_moo_statement_of uri)
555 (* prerr_endline "actual coercions:";
557 (fun u -> prerr_endline (UriManager.string_of_uri u))
559 let status = GrafiteTypes.add_moo_content moo_content status in
561 GrafiteTypes.coercions = coercions @ status.GrafiteTypes.coercions},
564 let add_obj uri obj status =
565 let status,lemmas = GrafiteSync.add_obj refinement_toolkit uri obj status in
568 let rec eval_command = {ec_go = fun ~disambiguate_command opts status
569 (text,prefix_len,cmd) ->
570 let status,cmd = disambiguate_command status (text,prefix_len,cmd) in
573 | GrafiteAst.Default (loc, what, uris) as cmd ->
574 LibraryObjects.set_default what uris;
575 GrafiteTypes.add_moo_content [cmd] status,[]
576 | GrafiteAst.Include (loc, baseuri) ->
577 let moopath_rw, moopath_r =
578 LibraryMisc.obj_file_of_baseuri
579 ~must_exist:false ~baseuri ~writable:true,
580 LibraryMisc.obj_file_of_baseuri
581 ~must_exist:false ~baseuri ~writable:false
584 if Sys.file_exists moopath_r then moopath_r else
585 if Sys.file_exists moopath_rw then moopath_rw else
586 raise (IncludedFileNotCompiled moopath_rw)
588 let status = eval_from_moo.efm_go status moopath in
590 | GrafiteAst.Set (loc, name, value) ->
591 if name = "baseuri" then begin
593 let v = Http_getter_misc.strip_trailing_slash value in
595 ignore (String.index v ' ');
596 GrafiteTypes.command_error "baseuri can't contain spaces"
599 if Http_getter_storage.is_read_only value then begin
600 HLog.error (sprintf "uri %s belongs to a read-only repository" value);
601 raise (ReadOnlyUri value)
603 if not (Http_getter_storage.is_empty value) &&
606 HLog.message ("baseuri " ^ value ^ " is not empty");
607 HLog.message ("cleaning baseuri " ^ value);
608 LibraryClean.clean_baseuris [value];
609 assert (Http_getter_storage.is_empty value);
612 (Filename.dirname (Http_getter.filename ~writable:true (value ^
615 GrafiteTypes.set_option status name value,[]
616 | GrafiteAst.Drop loc -> raise Drop
617 | GrafiteAst.Qed loc ->
618 let uri, metasenv, bo, ty =
619 match status.GrafiteTypes.proof_status with
620 | GrafiteTypes.Proof (Some uri, metasenv, body, ty) ->
621 uri, metasenv, body, ty
622 | GrafiteTypes.Proof (None, metasenv, body, ty) ->
623 raise (GrafiteTypes.Command_error
624 ("Someone allows to start a theorem without giving the "^
625 "name/uri. This should be fixed!"))
628 (GrafiteTypes.Command_error "You can't Qed an incomplete theorem")
630 if metasenv <> [] then
632 (GrafiteTypes.Command_error
633 "Proof not completed! metasenv is not empty!");
634 let name = UriManager.name_of_uri uri in
635 let obj = Cic.Constant (name,Some bo,ty,[],[]) in
636 let status, lemmas = add_obj uri obj status in
637 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
639 | GrafiteAst.Coercion (loc, uri, add_composites) ->
640 eval_coercion status ~add_composites uri
641 | GrafiteAst.Obj (loc,obj) ->
644 Cic.Constant (name,_,_,_,_)
645 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
646 | Cic.InductiveDefinition (types,_,_,_) ->
648 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
649 | _ -> assert false in
651 UriManager.uri_of_string (GrafiteTypes.qualify status name ^ ext) in
652 let obj = CicRefine.pack_coercion_obj obj in
653 let metasenv = GrafiteTypes.get_proof_metasenv status in
655 | Cic.CurrentProof (_,metasenv',bo,ty,_,_) ->
656 let name = UriManager.name_of_uri uri in
657 if not(CicPp.check name ty) then
658 HLog.error ("Bad name: " ^ name);
659 if opts.do_heavy_checks then
661 let dbd = LibraryDb.instance () in
662 let similar = Whelp.match_term ~dbd ty in
663 let similar_len = List.length similar in
664 if similar_len> 30 then
666 ("Duplicate check will compare your theorem with " ^
667 string_of_int similar_len ^
668 " theorems, this may take a while."));
672 let t = CicUtil.term_of_uri u in
674 CicTypeChecker.type_of_aux'
675 metasenv' [] t CicUniv.empty_ugraph
677 fst(CicReduction.are_convertible [] ty' ty g))
680 (match convertible with
684 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
685 "\nPlease use a variant."));
687 let initial_proof = (Some uri, metasenv', bo, ty) in
688 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
689 { status with GrafiteTypes.proof_status =
690 GrafiteTypes.Incomplete_proof
691 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
694 if metasenv <> [] then
695 raise (GrafiteTypes.Command_error (
696 "metasenv not empty while giving a definition with body: " ^
697 CicMetaSubst.ppmetasenv [] metasenv));
698 let status, lemmas = add_obj uri obj status in
699 let status,new_lemmas =
700 add_coercions_of_record_to_moo obj lemmas status
702 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
703 uri::new_lemmas@lemmas
705 match status.GrafiteTypes.proof_status with
706 GrafiteTypes.Intermediate _ ->
707 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
710 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
711 ~disambiguate_macro opts status (text,prefix_len,ex) ->
713 | GrafiteAst.Tactical (_, tac, None) ->
714 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac),[]
715 | GrafiteAst.Tactical (_, tac, Some punct) ->
717 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac) in
718 eval_tactical ~disambiguate_tactic status (text,prefix_len,punct),[]
719 | GrafiteAst.Command (_, cmd) ->
720 eval_command.ec_go ~disambiguate_command opts status (text,prefix_len,cmd)
721 | GrafiteAst.Macro (loc, macro) ->
722 raise (Macro (loc,disambiguate_macro status (text,prefix_len,macro)))
724 } and eval_from_moo = {efm_go = fun status fname ->
726 ("",0,GrafiteAst.Executable (HExtlib.dummy_floc,
727 GrafiteAst.Command (HExtlib.dummy_floc,
730 let moo = GrafiteMarshal.load_moo fname in
733 let ast = ast_of_cmd ast in
736 ~disambiguate_tactic:(fun status _ (_,_,tactic) -> status,tactic)
737 ~disambiguate_command:(fun status (_,_,cmd) -> status,cmd)
738 ~disambiguate_macro:(fun _ _ -> assert false)
744 } and eval_ast = {ea_go = fun ~disambiguate_tactic ~disambiguate_command
745 ~disambiguate_macro ?(do_heavy_checks=false) ?(clean_baseuri=true) status
749 do_heavy_checks = do_heavy_checks ;
750 clean_baseuri = clean_baseuri }
753 | GrafiteAst.Executable (_,ex) ->
754 eval_executable.ee_go ~disambiguate_tactic ~disambiguate_command
755 ~disambiguate_macro opts status (text,prefix_len,ex)
756 | GrafiteAst.Comment (_,c) -> eval_comment status (text,prefix_len,c),[]
759 let eval_ast = eval_ast.ea_go