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 (_,depth,width,paramodulation,full) ->
67 AutoTactic.auto_tac ?depth ?width ?paramodulation ?full
68 ~dbd:(LibraryDb.instance ()) ()
69 | GrafiteAst.Change (_, pattern, with_what) ->
70 Tactics.change ~pattern with_what
71 | GrafiteAst.Clear (_,id) -> Tactics.clear id
72 | GrafiteAst.ClearBody (_,id) -> Tactics.clearbody id
73 | GrafiteAst.Contradiction _ -> Tactics.contradiction
74 | GrafiteAst.Constructor (_, n) -> Tactics.constructor n
75 | GrafiteAst.Cut (_, ident, term) ->
76 let names = match ident with None -> [] | Some id -> [id] in
77 Tactics.cut ~mk_fresh_name_callback:(namer_of names) term
78 | GrafiteAst.Decompose (_, types, what, names) ->
79 let to_type = function
80 | GrafiteAst.Type (uri, typeno) -> uri, typeno
81 | GrafiteAst.Ident _ -> assert false
83 let user_types = List.rev_map to_type types in
84 let dbd = LibraryDb.instance () in
85 let mk_fresh_name_callback = namer_of names in
86 Tactics.decompose ~mk_fresh_name_callback ~dbd ~user_types what
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 GrafiteTypes.command_error "demodulation can't be folded"
103 PET.const_lazy_reduction
104 (CicReduction.normalize ~delta:false ~subst:[])
105 | `Reduce -> PET.const_lazy_reduction ProofEngineReduction.reduce
106 | `Simpl -> PET.const_lazy_reduction ProofEngineReduction.simpl
108 PET.const_lazy_reduction (ProofEngineReduction.unfold ?what:None)
109 | `Unfold (Some lazy_term) ->
110 (fun context metasenv ugraph ->
111 let what, metasenv, ugraph = lazy_term context metasenv ugraph in
112 ProofEngineReduction.unfold ~what, metasenv, ugraph)
114 PET.const_lazy_reduction (CicReduction.whd ~delta:false ~subst:[])
116 Tactics.fold ~reduction ~term ~pattern
117 | GrafiteAst.Fourier _ -> Tactics.fourier
118 | GrafiteAst.FwdSimpl (_, hyp, names) ->
119 Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names)
120 ~dbd:(LibraryDb.instance ()) hyp
121 | GrafiteAst.Generalize (_,pattern,ident) ->
122 let names = match ident with None -> [] | Some id -> [id] in
123 Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern
124 | GrafiteAst.Goal (_, n) -> Tactics.set_goal n
125 | GrafiteAst.IdTac _ -> Tactics.id
126 | GrafiteAst.Injection (_,term) -> Tactics.injection term
127 | GrafiteAst.Intros (_, None, names) ->
128 PrimitiveTactics.intros_tac ~mk_fresh_name_callback:(namer_of names) ()
129 | GrafiteAst.Intros (_, Some num, names) ->
130 PrimitiveTactics.intros_tac ~howmany:num
131 ~mk_fresh_name_callback:(namer_of names) ()
132 | GrafiteAst.Inversion (_, term) ->
133 Tactics.inversion term
134 | GrafiteAst.LApply (_, how_many, to_what, what, ident) ->
135 let names = match ident with None -> [] | Some id -> [id] in
136 Tactics.lapply ~mk_fresh_name_callback:(namer_of names) ?how_many
138 | GrafiteAst.Left _ -> Tactics.left
139 | GrafiteAst.LetIn (loc,term,name) ->
140 Tactics.letin term ~mk_fresh_name_callback:(namer_of [name])
141 | GrafiteAst.Reduce (_, reduction_kind, pattern) ->
142 (match reduction_kind with
143 | `Demodulate -> Tactics.demodulate ~dbd:(LibraryDb.instance ()) ~pattern
144 | `Normalize -> Tactics.normalize ~pattern
145 | `Reduce -> Tactics.reduce ~pattern
146 | `Simpl -> Tactics.simpl ~pattern
147 | `Unfold what -> Tactics.unfold ~pattern what
148 | `Whd -> Tactics.whd ~pattern)
149 | GrafiteAst.Reflexivity _ -> Tactics.reflexivity
150 | GrafiteAst.Replace (_, pattern, with_what) ->
151 Tactics.replace ~pattern ~with_what
152 | GrafiteAst.Rewrite (_, direction, t, pattern) ->
153 EqualityTactics.rewrite_tac ~direction ~pattern t
154 | GrafiteAst.Right _ -> Tactics.right
155 | GrafiteAst.Ring _ -> Tactics.ring
156 | GrafiteAst.Split _ -> Tactics.split
157 | GrafiteAst.Symmetry _ -> Tactics.symmetry
158 | GrafiteAst.Transitivity (_, term) -> Tactics.transitivity term
160 (* maybe we only need special cases for apply and goal *)
161 let classify_tactic tactic =
163 (* tactics that can't close the goal (return a goal we want to "select") *)
164 | GrafiteAst.Rewrite _
166 | GrafiteAst.Replace _
167 | GrafiteAst.Reduce _
168 | GrafiteAst.Injection _
170 | GrafiteAst.Generalize _
173 | GrafiteAst.Decompose _ -> true, true
174 (* tactics we don't want to reorder goals. I think only Goal needs this. *)
175 | GrafiteAst.Goal _ -> false, true
176 (* tactics like apply *)
179 let reorder_metasenv start refine tactic goals current_goal always_opens_a_goal=
180 let module PEH = ProofEngineHelpers in
181 (* let print_m name metasenv =
182 prerr_endline (">>>>> " ^ name);
183 prerr_endline (CicMetaSubst.ppmetasenv [] metasenv)
185 (* phase one calculates:
186 * new_goals_from_refine: goals added by refine
187 * head_goal: the first goal opened by ythe tactic
188 * other_goals: other goals opened by the tactic
190 let new_goals_from_refine = PEH.compare_metasenvs start refine in
191 let new_goals_from_tactic = PEH.compare_metasenvs refine tactic in
192 let head_goal, other_goals, goals =
194 | [] -> None,[],goals
196 (* assert (List.mem hd new_goals_from_tactic);
197 * invalidato dalla goal_tac
199 Some hd, List.filter ((<>) hd) new_goals_from_tactic, List.filter ((<>)
204 | None -> new_goals_from_refine @ other_goals
205 | Some x -> x :: new_goals_from_refine @ other_goals
207 (* extract the metas generated by refine and tactic *)
208 let metas_for_tactic_head =
211 | Some head_goal -> List.filter (fun (n,_,_) -> n = head_goal) tactic in
212 let metas_for_tactic_goals =
214 (fun x -> List.find (fun (metano,_,_) -> metano = x) tactic)
217 let metas_for_refine_goals =
218 List.filter (fun (n,_,_) -> List.mem n new_goals_from_refine) tactic in
219 let produced_metas, goals =
221 if always_opens_a_goal then
222 metas_for_tactic_head @ metas_for_refine_goals @
223 metas_for_tactic_goals
225 (* print_m "metas_for_refine_goals" metas_for_refine_goals;
226 print_m "metas_for_tactic_head" metas_for_tactic_head;
227 print_m "metas_for_tactic_goals" metas_for_tactic_goals; *)
228 metas_for_refine_goals @ metas_for_tactic_head @
229 metas_for_tactic_goals
232 let goals = List.map (fun (metano, _, _) -> metano) produced_metas in
233 produced_metas, goals
235 (* residual metas, preserving the original order *)
240 | (metano, _, _) :: tl when metano = e ->
241 [], List.map (fun (x,_,_) -> x) tl
242 | (metano, _, _) :: tl -> let b, a = split e tl in metano :: b, a
244 let find n metasenv =
246 Some (List.find (fun (metano, _, _) -> metano = n) metasenv)
247 with Not_found -> None
252 match find n tactic with
256 let before_l, after_l = split current_goal start in
258 List.filter (fun x -> not (List.mem x produced_goals)) before_l in
260 List.filter (fun x -> not (List.mem x produced_goals)) after_l in
261 let before = extract before_l in
262 let after = extract after_l in
266 print_m "BEGIN" start;
267 prerr_endline ("goal was: " ^ string_of_int current_goal);
268 prerr_endline ("and metas from refine are:");
270 (fun t -> prerr_string (" " ^ string_of_int t))
271 new_goals_from_refine;
273 print_m "before" before;
274 print_m "metas_for_tactic_head" metas_for_tactic_head;
275 print_m "metas_for_refine_goals" metas_for_refine_goals;
276 print_m "metas_for_tactic_goals" metas_for_tactic_goals;
277 print_m "produced_metas" produced_metas;
278 print_m "after" after;
279 |+ FINE DEBUG CODE +| *)
280 before @ produced_metas @ after, goals
282 let apply_tactic ~disambiguate_tactic (text,prefix_len,tactic) (status, goal) =
283 (* prerr_endline "apply_tactic"; *)
284 (* prerr_endline (Continuationals.Stack.pp (GrafiteTypes.get_stack status)); *)
285 let starting_metasenv = GrafiteTypes.get_proof_metasenv status in
286 let before = List.map (fun g, _, _ -> g) starting_metasenv in
287 (* prerr_endline "disambiguate"; *)
288 let status, tactic = disambiguate_tactic status goal (text,prefix_len,tactic) in
289 let metasenv_after_refinement = GrafiteTypes.get_proof_metasenv status in
290 let proof = GrafiteTypes.get_current_proof status in
291 let proof_status = proof, goal in
292 let needs_reordering, always_opens_a_goal = classify_tactic tactic in
293 let tactic = tactic_of_ast tactic in
294 (* apply tactic will change the lexicon_status ... *)
295 (* prerr_endline "apply_tactic bassa"; *)
296 let (proof, opened) = ProofEngineTypes.apply_tactic tactic proof_status in
297 let after = ProofEngineTypes.goals_of_proof proof in
298 let opened_goals, closed_goals = Tacticals.goals_diff ~before ~after ~opened in
299 (* prerr_endline("before: " ^ String.concat ", " (List.map string_of_int before));
300 prerr_endline("after: " ^ String.concat ", " (List.map string_of_int after));
301 prerr_endline("opened: " ^ String.concat ", " (List.map string_of_int opened)); *)
302 (* prerr_endline("opened_goals: " ^ String.concat ", " (List.map string_of_int opened_goals));
303 prerr_endline("closed_goals: " ^ String.concat ", " (List.map string_of_int closed_goals)); *)
304 let proof, opened_goals =
305 if needs_reordering then begin
306 let uri, metasenv_after_tactic, t, ty = proof in
307 (* prerr_endline ("goal prima del riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof))); *)
308 let reordered_metasenv, opened_goals =
311 metasenv_after_refinement metasenv_after_tactic
312 opened goal always_opens_a_goal
314 let proof' = uri, reordered_metasenv, t, ty in
315 (* prerr_endline ("goal dopo il riordino: " ^ String.concat " " (List.map string_of_int (ProofEngineTypes.goals_of_proof proof'))); *)
321 let incomplete_proof =
322 match status.GrafiteTypes.proof_status with
323 | GrafiteTypes.Incomplete_proof p -> p
326 { status with GrafiteTypes.proof_status =
327 GrafiteTypes.Incomplete_proof
328 { incomplete_proof with GrafiteTypes.proof = proof } },
329 opened_goals, closed_goals
333 'term 'lazy_term 'reduction 'obj 'ident.
335 (GrafiteTypes.status ->
336 ProofEngineTypes.goal ->
337 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
338 disambiguator_input ->
339 GrafiteTypes.status *
340 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
342 disambiguate_command:
343 (GrafiteTypes.status ->
344 ('obj GrafiteAst.command) disambiguator_input ->
345 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
348 (GrafiteTypes.status ->
349 ('term GrafiteAst.macro) disambiguator_input ->
350 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
352 ?do_heavy_checks:bool ->
353 ?clean_baseuri:bool ->
354 GrafiteTypes.status ->
355 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.statement)
356 disambiguator_input ->
357 GrafiteTypes.status * UriManager.uri list
360 type 'a eval_command =
362 disambiguate_command:
363 (GrafiteTypes.status -> ('obj GrafiteAst.command) disambiguator_input ->
364 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
365 options -> GrafiteTypes.status ->
366 ('obj GrafiteAst.command) disambiguator_input ->
367 GrafiteTypes.status * UriManager.uri list
370 type 'a eval_executable =
371 {ee_go: 'term 'lazy_term 'reduction 'obj 'ident.
373 (GrafiteTypes.status ->
374 ProofEngineTypes.goal ->
375 (('term, 'lazy_term, 'reduction, 'ident) GrafiteAst.tactic)
376 disambiguator_input ->
377 GrafiteTypes.status *
378 (Cic.term, Cic.lazy_term, Cic.lazy_term GrafiteAst.reduction, string) GrafiteAst.tactic) ->
380 disambiguate_command:
381 (GrafiteTypes.status ->
382 ('obj GrafiteAst.command) disambiguator_input ->
383 GrafiteTypes.status * Cic.obj GrafiteAst.command) ->
386 (GrafiteTypes.status ->
387 ('term GrafiteAst.macro) disambiguator_input ->
388 Cic.context -> GrafiteTypes.status * Cic.term GrafiteAst.macro) ->
391 GrafiteTypes.status ->
392 (('term, 'lazy_term, 'reduction, 'obj, 'ident) GrafiteAst.code) disambiguator_input ->
393 GrafiteTypes.status * UriManager.uri list
396 type 'a eval_from_moo =
397 { efm_go: GrafiteTypes.status -> string -> GrafiteTypes.status }
399 let coercion_moo_statement_of uri =
400 GrafiteAst.Coercion (HExtlib.dummy_floc, uri, false)
402 let refinement_toolkit = {
403 RefinementTool.type_of_aux' =
404 (fun ?localization_tbl e c t u ->
405 let saved = !CicRefine.insert_coercions in
406 CicRefine.insert_coercions:= false;
409 let t, ty, metasenv, ugraph =
410 CicRefine.type_of_aux' ?localization_tbl e c t u in
411 RefinementTool.Success (t, ty, metasenv, ugraph)
413 | CicRefine.RefineFailure s
414 | CicRefine.Uncertain s
415 | CicRefine.AssertFailure s -> RefinementTool.Exception s
417 CicRefine.insert_coercions := saved;
419 RefinementTool.ppsubst = CicMetaSubst.ppsubst;
420 RefinementTool.apply_subst = CicMetaSubst.apply_subst;
421 RefinementTool.ppmetasenv = CicMetaSubst.ppmetasenv;
422 RefinementTool.pack_coercion_obj = CicRefine.pack_coercion_obj;
425 let eval_coercion status ~add_composites uri =
426 let status,compounds =
427 GrafiteSync.add_coercion ~add_composites refinement_toolkit status uri in
428 let moo_content = coercion_moo_statement_of uri in
429 let status = GrafiteTypes.add_moo_content [moo_content] status in
430 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
433 let eval_tactical ~disambiguate_tactic status tac =
434 let apply_tactic = apply_tactic ~disambiguate_tactic in
435 let module MatitaStatus =
437 type input_status = GrafiteTypes.status * ProofEngineTypes.goal
440 GrafiteTypes.status * ProofEngineTypes.goal list * ProofEngineTypes.goal list
442 type tactic = input_status -> output_status
444 let id_tactic = apply_tactic ("",0,(GrafiteAst.IdTac HExtlib.dummy_floc))
445 let mk_tactic tac = tac
446 let apply_tactic tac = tac
447 let goals (_, opened, closed) = opened, closed
448 let set_goals (opened, closed) (status, _, _) = (status, opened, closed)
449 let get_stack (status, _) = GrafiteTypes.get_stack status
451 let set_stack stack (status, opened, closed) =
452 GrafiteTypes.set_stack stack status, opened, closed
454 let inject (status, _) = (status, [], [])
455 let focus goal (status, _, _) = (status, goal)
458 let module MatitaTacticals = Tacticals.Make (MatitaStatus) in
459 let rec tactical_of_ast l (text,prefix_len,tac) =
460 let apply_tactic t = apply_tactic (text, prefix_len, t) in
461 let tactical_of_ast l t = tactical_of_ast l (text,prefix_len,t) in
463 | GrafiteAst.Tactic (loc, tactic) ->
464 MatitaTacticals.tactic (MatitaStatus.mk_tactic (apply_tactic tactic))
465 | GrafiteAst.Seq (loc, tacticals) -> (* tac1; tac2; ... *)
467 MatitaTacticals.seq ~tactics:(List.map (tactical_of_ast (l+1)) tacticals)
468 | GrafiteAst.Do (loc, n, tactical) ->
469 MatitaTacticals.do_tactic ~n ~tactic:(tactical_of_ast (l+1) tactical)
470 | GrafiteAst.Repeat (loc, tactical) ->
471 MatitaTacticals.repeat_tactic ~tactic:(tactical_of_ast (l+1) tactical)
472 | GrafiteAst.Then (loc, tactical, tacticals) -> (* tac; [ tac1 | ... ] *)
474 MatitaTacticals.thens ~start:(tactical_of_ast (l+1) tactical)
475 ~continuations:(List.map (tactical_of_ast (l+1)) tacticals)
476 | GrafiteAst.First (loc, tacticals) ->
477 MatitaTacticals.first
478 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
479 | GrafiteAst.Try (loc, tactical) ->
480 MatitaTacticals.try_tactic ~tactic:(tactical_of_ast (l+1) tactical)
481 | GrafiteAst.Solve (loc, tacticals) ->
482 MatitaTacticals.solve_tactics
483 ~tactics:(List.map (fun t -> "", tactical_of_ast (l+1) t) tacticals)
485 | GrafiteAst.Skip _loc -> MatitaTacticals.skip
486 | GrafiteAst.Dot _loc -> MatitaTacticals.dot
487 | GrafiteAst.Semicolon _loc -> MatitaTacticals.semicolon
488 | GrafiteAst.Branch _loc -> MatitaTacticals.branch
489 | GrafiteAst.Shift _loc -> MatitaTacticals.shift
490 | GrafiteAst.Pos (_loc, i) -> MatitaTacticals.pos i
491 | GrafiteAst.Merge _loc -> MatitaTacticals.merge
492 | GrafiteAst.Focus (_loc, goals) -> MatitaTacticals.focus goals
493 | GrafiteAst.Unfocus _loc -> MatitaTacticals.unfocus
494 | GrafiteAst.Wildcard _loc -> MatitaTacticals.wildcard
496 let status, _, _ = tactical_of_ast 0 tac (status, ~-1) in
497 let status = (* is proof completed? *)
498 match status.GrafiteTypes.proof_status with
499 | GrafiteTypes.Incomplete_proof
500 { GrafiteTypes.stack = stack; proof = proof }
501 when Continuationals.Stack.is_empty stack ->
502 { status with GrafiteTypes.proof_status = GrafiteTypes.Proof proof }
507 let eval_comment status c = status
509 (* since the record syntax allows to declare coercions, we have to put this
510 * information inside the moo *)
511 let add_coercions_of_record_to_moo obj lemmas status =
512 let attributes = CicUtil.attributes_of_obj obj in
513 let is_record = function `Class (`Record att) -> Some att | _-> None in
514 match HExtlib.list_findopt is_record attributes with
517 let is_a_coercion uri =
520 CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri in
521 let attrs = CicUtil.attributes_of_obj obj in
522 List.mem (`Class `Projection) attrs
523 with Not_found -> assert false
525 (* looking at the fields we can know the 'wanted' coercions, but not the
526 * actually generated ones. So, only the intersection between the wanted
527 * and the actual should be in the moo as coercion, while everithing in
528 * lemmas should go as aliases *)
529 let wanted_coercions =
534 (UriManager.uri_of_string
535 (GrafiteTypes.qualify status name ^ ".con"))
540 prerr_endline "wanted coercions:";
542 (fun u -> prerr_endline (UriManager.string_of_uri u))
544 let coercions, moo_content =
548 let is_a_wanted_coercion =
549 List.exists (UriManager.eq uri) wanted_coercions in
550 if is_a_coercion uri && is_a_wanted_coercion then
551 Some (uri, coercion_moo_statement_of uri)
556 (* prerr_endline "actual coercions:";
558 (fun u -> prerr_endline (UriManager.string_of_uri u))
560 let status = GrafiteTypes.add_moo_content moo_content status in
562 GrafiteTypes.coercions = coercions @ status.GrafiteTypes.coercions},
565 let add_obj uri obj status =
566 let status,lemmas = GrafiteSync.add_obj refinement_toolkit uri obj status in
569 let rec eval_command = {ec_go = fun ~disambiguate_command opts status
570 (text,prefix_len,cmd) ->
571 let status,cmd = disambiguate_command status (text,prefix_len,cmd) in
574 | GrafiteAst.Default (loc, what, uris) as cmd ->
575 LibraryObjects.set_default what uris;
576 GrafiteTypes.add_moo_content [cmd] status,[]
577 | GrafiteAst.Include (loc, baseuri) ->
578 let moopath_rw, moopath_r =
579 LibraryMisc.obj_file_of_baseuri
580 ~must_exist:false ~baseuri ~writable:true,
581 LibraryMisc.obj_file_of_baseuri
582 ~must_exist:false ~baseuri ~writable:false
585 if Sys.file_exists moopath_r then moopath_r else
586 if Sys.file_exists moopath_rw then moopath_rw else
587 raise (IncludedFileNotCompiled moopath_rw)
589 let status = eval_from_moo.efm_go status moopath in
591 | GrafiteAst.Set (loc, name, value) ->
592 if name = "baseuri" then begin
594 let v = Http_getter_misc.strip_trailing_slash value in
596 ignore (String.index v ' ');
597 GrafiteTypes.command_error "baseuri can't contain spaces"
600 if Http_getter_storage.is_read_only value then begin
601 HLog.error (sprintf "uri %s belongs to a read-only repository" value);
602 raise (ReadOnlyUri value)
604 if not (Http_getter_storage.is_empty value) &&
607 HLog.message ("baseuri " ^ value ^ " is not empty");
608 HLog.message ("cleaning baseuri " ^ value);
609 LibraryClean.clean_baseuris [value];
610 assert (Http_getter_storage.is_empty value);
613 (Filename.dirname (Http_getter.filename ~writable:true (value ^
616 GrafiteTypes.set_option status name value,[]
617 | GrafiteAst.Drop loc -> raise Drop
618 | GrafiteAst.Qed loc ->
619 let uri, metasenv, bo, ty =
620 match status.GrafiteTypes.proof_status with
621 | GrafiteTypes.Proof (Some uri, metasenv, body, ty) ->
622 uri, metasenv, body, ty
623 | GrafiteTypes.Proof (None, metasenv, body, ty) ->
624 raise (GrafiteTypes.Command_error
625 ("Someone allows to start a theorem without giving the "^
626 "name/uri. This should be fixed!"))
629 (GrafiteTypes.Command_error "You can't Qed an incomplete theorem")
631 if metasenv <> [] then
633 (GrafiteTypes.Command_error
634 "Proof not completed! metasenv is not empty!");
635 let name = UriManager.name_of_uri uri in
636 let obj = Cic.Constant (name,Some bo,ty,[],[]) in
637 let status, lemmas = add_obj uri obj status in
638 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
640 | GrafiteAst.Coercion (loc, uri, add_composites) ->
641 eval_coercion status ~add_composites uri
642 | GrafiteAst.Obj (loc,obj) ->
645 Cic.Constant (name,_,_,_,_)
646 | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
647 | Cic.InductiveDefinition (types,_,_,_) ->
649 (match types with (name,_,_,_)::_ -> name | _ -> assert false)
650 | _ -> assert false in
652 UriManager.uri_of_string (GrafiteTypes.qualify status name ^ ext) in
653 let obj = CicRefine.pack_coercion_obj obj in
654 let metasenv = GrafiteTypes.get_proof_metasenv status in
656 | Cic.CurrentProof (_,metasenv',bo,ty,_,_) ->
657 let name = UriManager.name_of_uri uri in
658 if not(CicPp.check name ty) then
659 HLog.error ("Bad name: " ^ name);
660 if opts.do_heavy_checks then
662 let dbd = LibraryDb.instance () in
663 let similar = Whelp.match_term ~dbd ty in
664 let similar_len = List.length similar in
665 if similar_len> 30 then
667 ("Duplicate check will compare your theorem with " ^
668 string_of_int similar_len ^
669 " theorems, this may take a while."));
673 let t = CicUtil.term_of_uri u in
675 CicTypeChecker.type_of_aux'
676 metasenv' [] t CicUniv.empty_ugraph
678 fst(CicReduction.are_convertible [] ty' ty g))
681 (match convertible with
685 ("Theorem already proved: " ^ UriManager.string_of_uri x ^
686 "\nPlease use a variant."));
688 let initial_proof = (Some uri, metasenv', bo, ty) in
689 let initial_stack = Continuationals.Stack.of_metasenv metasenv' in
690 { status with GrafiteTypes.proof_status =
691 GrafiteTypes.Incomplete_proof
692 { GrafiteTypes.proof = initial_proof; stack = initial_stack } },
695 if metasenv <> [] then
696 raise (GrafiteTypes.Command_error (
697 "metasenv not empty while giving a definition with body: " ^
698 CicMetaSubst.ppmetasenv [] metasenv));
699 let status, lemmas = add_obj uri obj status in
700 let status,new_lemmas =
701 add_coercions_of_record_to_moo obj lemmas status
703 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},
704 uri::new_lemmas@lemmas
706 match status.GrafiteTypes.proof_status with
707 GrafiteTypes.Intermediate _ ->
708 {status with GrafiteTypes.proof_status = GrafiteTypes.No_proof},uris
711 } and eval_executable = {ee_go = fun ~disambiguate_tactic ~disambiguate_command
712 ~disambiguate_macro opts status (text,prefix_len,ex) ->
714 | GrafiteAst.Tactical (_, tac, None) ->
715 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac),[]
716 | GrafiteAst.Tactical (_, tac, Some punct) ->
718 eval_tactical ~disambiguate_tactic status (text,prefix_len,tac) in
719 eval_tactical ~disambiguate_tactic status (text,prefix_len,punct),[]
720 | GrafiteAst.Command (_, cmd) ->
721 eval_command.ec_go ~disambiguate_command opts status (text,prefix_len,cmd)
722 | GrafiteAst.Macro (loc, macro) ->
723 raise (Macro (loc,disambiguate_macro status (text,prefix_len,macro)))
725 } and eval_from_moo = {efm_go = fun status fname ->
727 ("",0,GrafiteAst.Executable (HExtlib.dummy_floc,
728 GrafiteAst.Command (HExtlib.dummy_floc,
731 let moo = GrafiteMarshal.load_moo fname in
734 let ast = ast_of_cmd ast in
737 ~disambiguate_tactic:(fun status _ (_,_,tactic) -> status,tactic)
738 ~disambiguate_command:(fun status (_,_,cmd) -> status,cmd)
739 ~disambiguate_macro:(fun _ _ -> assert false)
745 } and eval_ast = {ea_go = fun ~disambiguate_tactic ~disambiguate_command
746 ~disambiguate_macro ?(do_heavy_checks=false) ?(clean_baseuri=true) status
750 do_heavy_checks = do_heavy_checks ;
751 clean_baseuri = clean_baseuri }
754 | GrafiteAst.Executable (_,ex) ->
755 eval_executable.ee_go ~disambiguate_tactic ~disambiguate_command
756 ~disambiguate_macro opts status (text,prefix_len,ex)
757 | GrafiteAst.Comment (_,c) -> eval_comment status (text,prefix_len,c),[]
760 let eval_ast = eval_ast.ea_go