(** Interpreter for textual phrases coming from matita's console (textual entry
* window at the bottom of the main window).
*
-* Interpreter is either in `Command state or in `Proof state (see state_tag type
-* below). In `Command state commands for starting proofs are accepted, but
-* tactic and tactical applications are not. In `Proof state both
+* Interpreter is either in Command state or in Proof state (see state type
+* below). In Command state commands for starting proofs are accepted, but
+* tactic and tactical applications are not. In Proof state both
* tactic/tacticals and commands are accepted.
*)
open Printf
- (** None means: "same state as before" *)
-type state_tag = [ `Command | `Proof ] option
+open MatitaTypes
+
+type state = Command | Proof
+type outcome = New_state of state | Quiet | Echo of string
exception Command_error of string
+(*
+let uri name =
+ UriManager.uri_of_string (sprintf "%s/%s" BuildTimeConf.base_uri name)
+*)
+
+let baseuri = lazy (ref ("cic:/matita/" ^ Helm_registry.get "matita.owner"))
+let basedir = ref ((Unix.getpwuid (Unix.getuid ())).Unix.pw_dir) ;;
+
+let qualify name =
+ let baseuri = !(Lazy.force baseuri) in
+ if baseuri.[String.length baseuri - 1] = '/' then
+ baseuri ^ name
+ else
+ String.concat "/" [baseuri; name]
+let split_obj = function
+ | Cic.Constant (name, body, ty, _, attrs)
+ | Cic.Variable (name, body, ty, _, attrs) -> (name, body, ty, attrs)
+ | _ -> assert false
+
let canonical_context metano metasenv =
try
let (_, context, _) = List.find (fun (m, _, _) -> m = metano) metasenv in
with Not_found ->
failwith (sprintf "Can't find canonical context for %d" metano)
-let get_context_and_metasenv (proof_handler:MatitaTypes.proof_handler) =
- if proof_handler.MatitaTypes.has_proof () then
- let proof = proof_handler.MatitaTypes.get_proof () in
+let get_context_and_metasenv (currentProof:MatitaTypes.currentProof) =
+ if currentProof#onGoing () then
+ let proof = currentProof#proof in
let metasenv = proof#metasenv in
let goal = proof#goal in
(canonical_context goal metasenv, metasenv)
(** term AST -> Cic.term. Uses disambiguator and change imperatively the
* metasenv as needed *)
-let disambiguate ~(disambiguator:MatitaTypes.disambiguator) ~proof_handler ast =
- if proof_handler.MatitaTypes.has_proof () then begin
- let proof = proof_handler.MatitaTypes.get_proof () in
+let disambiguate ~(disambiguator:MatitaTypes.disambiguator) ~currentProof ast =
+ if currentProof#onGoing () then begin
+ let proof = currentProof#proof in
let metasenv = proof#metasenv in
let goal = proof#goal in
let context = canonical_context goal metasenv in
- let (_, metasenv, term) as retval =
+ let (_, metasenv, term,ugraph) as retval =
disambiguator#disambiguateTermAst ~context ~metasenv ast
in
proof#set_metasenv metasenv;
end else
disambiguator#disambiguateTermAst ast
-class virtual interpreterState ~(console: MatitaConsole.console) =
+class virtual interpreterState =
+ (* static values, shared by all states inheriting this class *)
+ let loc = ref None in
+ let history = ref [] in
+ fun ~(console: MatitaTypes.console) ->
object (self)
+
(** eval a toplevel phrase in the current state and return the new state
*)
- method parsePhrase s = CicTextualParser2.parse_tactical (Stream.of_string s)
+ method parsePhrase s =
+ match CicTextualParser2.parse_tactical s with
+ | (TacticAst.LocatedTactical (loc', tac)) as tactical ->
+ loc := Some loc';
+ (match tac with (* update interpreter history *)
+ | TacticAst.Command (TacticAst.Qed None) ->
+ history := `Qed :: !history
+ | TacticAst.Command (TacticAst.Theorem (_, Some name, _, None)) ->
+ history := `Theorem name :: !history
+ | TacticAst.Command (TacticAst.Qed _)
+ | TacticAst.Command (TacticAst.Theorem _) -> assert false
+ | _ -> history := `Tactic :: !history);
+ tactical
+ | _ -> assert false
method virtual evalTactical:
- (CicAst.term, string) TacticAst.tactical -> state_tag
+ (CicAst.term, string) TacticAst.tactical -> outcome
- method evalPhrase s = self#evalTactical (self#parsePhrase s)
- end
+ method evalPhrase s =
+ debug_print (sprintf "evaluating '%s'" s);
+ self#evalTactical (self#parsePhrase (Stream.of_string s))
+
+ method evalAst ast = self#evalTactical ast
-let check_widget: MatitaTypes.sequents_viewer lazy_t = lazy (
- let gui = MatitaGui.instance () in
- let notebook = GPack.notebook ~show:true ~packing:gui#check#checkWin#add () in
- let sequent_viewer = MatitaMathView.sequent_viewer ~show:true () in
- MatitaMathView.sequents_viewer ~notebook ~sequent_viewer ())
+ method endOffset =
+ match !loc with
+ | Some (start_pos, end_pos) -> end_pos.Lexing.pos_cnum
+ | None -> failwith "MatitaInterpreter: no offset recorded"
+
+ end
(** Implements phrases that should be accepted in all states *)
class sharedState
~(disambiguator: MatitaTypes.disambiguator)
- ~(proof_handler: MatitaTypes.proof_handler)
- ~(console: MatitaConsole.console)
+ ~(currentProof: MatitaTypes.currentProof)
+ ~(console: MatitaTypes.console)
+ ?(mathViewer: MatitaTypes.mathViewer option)
+ ~(dbd: Mysql.dbd)
()
=
object (self)
inherit interpreterState ~console
method evalTactical = function
| TacticAst.Command TacticAst.Quit ->
- proof_handler.MatitaTypes.quit ();
- Some `Command (* dummy answer, useless *)
+ currentProof#quit ();
+ assert false (* dummy answer, useless *)
| TacticAst.Command TacticAst.Proof ->
(* do nothing, just for compatibility with coq syntax *)
- Some `Command
+ New_state Command
+ | TacticAst.Command (TacticAst.Baseuri (Some uri)) ->
+ Lazy.force baseuri := uri;
+ console#echo_message (sprintf "base uri set to \"%s\"" uri);
+ Quiet
+ | TacticAst.Command (TacticAst.Baseuri None) ->
+ console#echo_message (sprintf "base uri is \"%s\""
+ !(Lazy.force baseuri));
+ Quiet
+ | TacticAst.Command (TacticAst.Basedir (Some path)) ->
+ basedir := path;
+ console#echo_message (sprintf "base dir set to \"%s\"" path);
+ Quiet
+ | TacticAst.Command (TacticAst.Basedir None) ->
+ console#echo_message (sprintf "base dir is \"%s\"" !basedir);
+ Quiet
| TacticAst.Command (TacticAst.Check term) ->
- let dummyno = 1023 in
- let (_, _, term) = disambiguate ~disambiguator ~proof_handler term in
- let (context, metasenv) = get_context_and_metasenv proof_handler in
- let sequent = (dummyno, context, term) in
- let metadata = Cic2acic.asequent_of_sequent metasenv sequent in
- let widget = Lazy.force check_widget in
- let gui = MatitaGui.instance () in
- gui#check#checkWin#show ();
- gui#main#showCheckMenuItem#set_active true;
- widget#reset;
- widget#load_sequents [dummyno, metadata];
- widget#goto_sequent dummyno;
- None
+ let (_, _, term,ugraph) =
+ disambiguate ~disambiguator ~currentProof term
+ in
+ let (context, metasenv) = get_context_and_metasenv currentProof in
+(* this is the Eval Compute
+ let term = CicReduction.whd context term in
+*)
+ let dummyno = CicMkImplicit.new_meta metasenv [] in
+ let ty,ugraph1 =
+ CicTypeChecker.type_of_aux' metasenv context term ugraph
+ in
+ (* TASSI: here ugraph1 is unused.... FIXME *)
+ let expr = Cic.Cast (term, ty) in
+ let sequent = (dummyno, context, expr) in
+ (match mathViewer with
+ | None -> ()
+ | Some v -> v#checkTerm sequent metasenv);
+ Quiet
+ | TacticAst.Command (TacticAst.Search_pat (search_kind, pat)) ->
+ let uris =
+ match search_kind with
+ | `Locate -> MetadataQuery.locate ~dbd pat
+ | `Elim -> MetadataQuery.elim ~dbd pat
+ | _ -> assert false
+ in
+ (* TODO ZACK: show URIs to the user *)
+ Quiet
+ | TacticAst.Command (TacticAst.Print `Env) ->
+ let uris = CicEnvironment.list_uri () in
+ List.iter (fun u ->
+ console#echo_message (UriManager.string_of_uri u);
+ prerr_endline "x"
+ ) uris;
+ Quiet
| tactical ->
raise (Command_error (TacticAstPp.pp_tactical tactical))
end
- (** Implements phrases that should be accepted only in `Command state *)
+open Printf
+
+let pp_indtypes indTypes =
+ List.iter
+ (fun (name, _, typ, constructors) ->
+ printf "%s: %s\n" name (CicPp.ppterm typ);
+ List.iter
+ (fun (name, term) -> printf "\t%s: %s\n" name (CicPp.ppterm term))
+ constructors)
+ indTypes;
+ flush stdout
+
+let inddef_of_ast params indTypes (disambiguator:MatitaTypes.disambiguator) =
+ let add_pi binders t =
+ List.fold_right
+ (fun (name, ast) acc ->
+ CicAst.Binder (`Forall, (Cic.Name name, Some ast), acc))
+ binders t
+ in
+ let ind_binders =
+ List.map (fun (name, _, typ, _) -> (name, add_pi params typ)) indTypes
+ in
+ let binders = ind_binders @ params in
+ let asts = ref [] in
+ let add_ast ast = asts := ast :: !asts in
+ let paramsno = List.length params in
+ let indbindersno = List.length ind_binders in
+ List.iter
+ (fun (name, _, typ, constructors) ->
+ add_ast (add_pi params typ);
+ List.iter (fun (_, ast) -> add_ast (add_pi binders ast)) constructors)
+ indTypes;
+ let (_, metasenv, terms, ugraph) =
+ disambiguator#disambiguateTermAsts ~metasenv:[] !asts
+ in
+ let terms = ref (List.rev terms) in
+ let get_term () =
+ match !terms with [] -> assert false | hd :: tl -> terms := tl; hd
+ in
+ let uri =
+ match indTypes with
+ | (name, _, _, _) :: _ -> qualify name ^ ".ind"
+ | _ -> assert false
+ in
+ let mutinds =
+ let counter = ref 0 in
+ List.map
+ (fun _ ->
+ incr counter;
+ CicUtil.term_of_uri (sprintf "%s#xpointer(1/%d)" uri !counter))
+ indTypes
+ in
+ let subst_mutinds = List.fold_right CicSubstitution.subst mutinds in
+ let cicIndTypes =
+ List.fold_left
+ (fun acc (name, inductive, typ, constructors) ->
+ let cicTyp = get_term () in
+ let cicConstructors =
+ List.fold_left
+ (fun acc (name, _) ->
+ let typ =
+ subst_mutinds (CicUtil.strip_prods indbindersno (get_term ()))
+ in
+ (name, typ) :: acc)
+ [] constructors
+ in
+ (name, inductive, cicTyp, List.rev cicConstructors) :: acc)
+ [] indTypes
+ in
+ let cicIndTypes = List.rev cicIndTypes in
+ (UriManager.uri_of_string uri, (cicIndTypes, [], paramsno))
+
+ (*
+ *
+ *
+ * FIXME this should be in another module, shared with gTopLevel
+ *
+ *
+ * *)
+let
+ save_object_to_disk uri annobj ids_to_inner_sorts ids_to_inner_types pathname
+=
+ let name =
+ let struri = UriManager.string_of_uri uri in
+ let idx = (String.rindex struri '/') + 1 in
+ String.sub struri idx (String.length struri - idx)
+ in
+ let path = pathname ^ "/" ^ name in
+ let xml, bodyxml =
+ Cic2Xml.print_object uri ~ids_to_inner_sorts ~ask_dtd_to_the_getter:false
+ annobj
+ in
+ let xmlinnertypes =
+ Cic2Xml.print_inner_types uri ~ids_to_inner_sorts ~ids_to_inner_types
+ ~ask_dtd_to_the_getter:false
+ in
+ (* innertypes *)
+ let innertypesuri = UriManager.innertypesuri_of_uri uri in
+ Xml.pp ~quiet:true xmlinnertypes (Some (path ^ ".types.xml")) ;
+ Http_getter.register' innertypesuri
+ (Helm_registry.get "local_library.url" ^
+ Str.replace_first (Str.regexp "^cic:") ""
+ (UriManager.string_of_uri innertypesuri) ^ ".xml"
+ ) ;
+ (* constant type / variable / mutual inductive types definition *)
+ Xml.pp ~quiet:true xml (Some (path ^ ".xml")) ;
+ Http_getter.register' uri
+ (Helm_registry.get "local_library.url" ^
+ Str.replace_first (Str.regexp "^cic:") ""
+ (UriManager.string_of_uri uri) ^ ".xml"
+ ) ;
+ match bodyxml with
+ None -> ()
+ | Some bodyxml' ->
+ (* constant body *)
+ let bodyuri =
+ match UriManager.bodyuri_of_uri uri with
+ None -> assert false
+ | Some bodyuri -> bodyuri
+ in
+ Xml.pp ~quiet:true bodyxml' (Some (path ^ ".body.xml")) ;
+ Http_getter.register' bodyuri
+ (Helm_registry.get "local_library.url" ^
+ Str.replace_first (Str.regexp "^cic:") ""
+ (UriManager.string_of_uri bodyuri) ^ ".xml"
+ )
+;;
+
+ (* TODO Zack a lot more to be done here:
+ * - save object to disk in xml format
+ * - register uri to the getter
+ * - save universe file *)
+let add_constant_to_world ~(console:MatitaTypes.console)
+ ~dbd ~uri ?body ~ty ?(params = []) ?(attrs = []) ~ugraph ()
+=
+ let suri = UriManager.string_of_uri uri in
+ if CicEnvironment.in_library uri then
+ error (sprintf "%s constant already defined" suri)
+ else begin
+ let name = UriManager.name_of_uri uri in
+ let obj = Cic.Constant (name, body, ty, params, attrs) in
+ let ugraph = CicUnivUtils.clean_and_fill uri obj ugraph in
+ CicEnvironment.add_type_checked_term uri (obj, ugraph);
+ MetadataDb.index_constant ~dbd
+ ~owner:(Helm_registry.get "matita.owner") ~uri ~body ~ty;
+ console#echo_message (sprintf "%s constant defined" suri)
+ end
+
+let add_inductive_def_to_world ~(console:MatitaTypes.console)
+ ~dbd ~uri ~indTypes ?(params = []) ?(leftno = 0) ?(attrs = []) ~ugraph ()
+=
+ let suri = UriManager.string_of_uri uri in
+ if CicEnvironment.in_library uri then
+ error (sprintf "%s inductive type already defined" suri)
+ else begin
+ let name = UriManager.name_of_uri uri in
+ let obj = Cic.InductiveDefinition (indTypes, params, leftno, attrs) in
+ let ugraph = CicUnivUtils.clean_and_fill uri obj ugraph in
+ CicEnvironment.put_inductive_definition uri (obj, ugraph);
+ MetadataDb.index_inductive_def ~dbd
+ ~owner:(Helm_registry.get "matita.owner") ~uri ~types:indTypes;
+ console#echo_message (sprintf "%s inductive type defined" suri);
+ let elim sort =
+ try
+ let obj = CicElim.elim_of ~sort uri 0 in
+ let (name, body, ty, attrs) = split_obj obj in
+ let suri = qualify name ^ ".con" in
+ let uri = UriManager.uri_of_string suri in
+ (* TODO Zack: make CicElim returns a universe *)
+ let ugraph = CicUniv.empty_ugraph in
+ add_constant_to_world ~console ~dbd ~uri ?body ~ty ~attrs ~ugraph ();
+(*
+ console#echo_message
+ (sprintf "%s eliminator (automatically) defined" suri)
+*)
+ with CicElim.Can_t_eliminate -> ()
+ in
+ List.iter elim [ Cic.Prop; Cic.Set; (Cic.Type (CicUniv.fresh ())) ];
+ end
+
+ (** Implements phrases that should be accepted only in Command state *)
class commandState
~(disambiguator: MatitaTypes.disambiguator)
- ~(proof_handler: MatitaTypes.proof_handler)
- ~(console: MatitaConsole.console)
+ ~(currentProof: MatitaTypes.currentProof)
+ ~(console: MatitaTypes.console)
+ ?mathViewer
+ ~(dbd: Mysql.dbd)
()
=
- let shared = new sharedState ~disambiguator ~proof_handler ~console () in
+ let shared =
+ new sharedState ~disambiguator ~currentProof ~console ?mathViewer ~dbd ()
+ in
object (self)
inherit interpreterState ~console
method evalTactical = function
| TacticAst.LocatedTactical (_, tactical) -> self#evalTactical tactical
| TacticAst.Command (TacticAst.Theorem (_, Some name, ast, None)) ->
- let (_, metasenv, expr) = disambiguator#disambiguateTermAst ast in
- let proof = MatitaProof.proof ~typ:expr ~metasenv () in
- proof_handler.MatitaTypes.new_proof proof;
- Some `Proof
+ let (_, metasenv, expr,ugraph) =
+ disambiguator#disambiguateTermAst ast
+ in
+ let uri = UriManager.uri_of_string (qualify name ^ ".con") in
+ let proof = MatitaProof.proof ~typ:expr ~uri ~metasenv () in
+ currentProof#start proof;
+ New_state Proof
+ | TacticAst.Command
+ (TacticAst.Theorem (_, Some name, type_ast, Some body_ast)) ->
+ let (_, metasenv, type_cic, ugraph) =
+ disambiguator#disambiguateTermAst type_ast
+ in
+ let (_, metasenv, body_cic, ugraph) =
+ disambiguator#disambiguateTermAst ~metasenv body_ast
+ in
+ let (body_type, ugraph) =
+ CicTypeChecker.type_of_aux' metasenv [] body_cic ugraph
+ in
+ let uri = UriManager.uri_of_string (qualify name ^ ".con") in
+ let (subst, metasenv, ugraph) =
+ CicUnification.fo_unif metasenv [] body_type type_cic ugraph
+ in
+ let body = CicMetaSubst.apply_subst subst body_cic in
+ let ty = CicMetaSubst.apply_subst subst type_cic in
+ add_constant_to_world ~console ~dbd ~uri ~body ~ty ~ugraph ();
+ Quiet
+ | TacticAst.Command (TacticAst.Inductive (params, indTypes)) ->
+
+ let (uri, (indTypes, params, leftno)) =
+ inddef_of_ast params indTypes disambiguator
+ in
+ let obj = Cic.InductiveDefinition (indTypes, params, leftno, []) in
+ let ugraph =
+ CicTypeChecker.typecheck_mutual_inductive_defs uri
+ (indTypes, params, leftno) CicUniv.empty_ugraph
+ in
+ add_inductive_def_to_world ~console
+ ~dbd ~uri ~indTypes ~params ~leftno ~ugraph ();
+ Quiet
| TacticAst.Command TacticAst.Quit ->
- proof_handler.MatitaTypes.quit ();
- Some `Command (* dummy answer, useless *)
+ currentProof#quit ();
+ New_state Command (* dummy answer, useless *)
| TacticAst.Command TacticAst.Proof ->
(* do nothing, just for compatibility with coq syntax *)
- Some `Command
+ New_state Command
+ | TacticAst.Command (TacticAst.Coercion c_ast) ->
+ prerr_endline ("beccata la coercion " ^ (CicAstPp.pp_term c_ast));
+
+ let env, metasenv, coercion, ugraph =
+ disambiguator#disambiguateTermAst c_ast
+ in
+ let coer_uri,coer_ty =
+ match coercion with
+ | Cic.Const (uri,_)
+ | Cic.Var (uri,_) ->
+ let o,_ =
+ CicEnvironment.get_obj CicUniv.empty_ugraph uri
+ in
+ (match o with
+ | Cic.Constant (_,_,ty,_,_)
+ | Cic.Variable (_,_,ty,_,_) ->
+ uri,ty
+ | _ -> assert false)
+ | Cic.MutConstruct (uri,t,c,_) ->
+ let o,_ =
+ CicEnvironment.get_obj CicUniv.empty_ugraph uri
+ in
+ (match o with
+ | Cic.InductiveDefinition (l,_,_,_) ->
+ let (_,_,_,cl) = List.nth l t in
+ let (_,cty) = List.nth cl c in
+ uri,cty
+ | _ -> assert false)
+ | _ -> assert false
+ in
+ (* we have to get the source and the tgt type uri
+ * in Coq syntax we have already their names, but
+ * since we don't support Funclass and similar I think
+ * all the coercion should be of the form
+ * (A:?)(B:?)T1->T2
+ * So we should be able to extract them from the coercion type
+ *)
+ let extract_last_two_p ty =
+ let rec aux = function
+ | Cic.Prod( _, src, Cic.Prod (n,t1,t2)) -> aux (Cic.Prod(n,t1,t2))
+ | Cic.Prod( _, src, tgt) -> src, tgt
+ | _ -> assert false
+ in
+ aux ty
+ in
+ let uri_of_term = function
+ | Cic.Const(u,_) -> u
+ | Cic.MutInd (u, i , _) ->
+ (* we have to build by hand the #xpointer *)
+ let base = UriManager.string_of_uri u in
+ let xp = "#xpointer(1/" ^ (string_of_int (i+1)) ^ ")" in
+ UriManager.uri_of_string (base ^ xp)
+ | _ -> assert false
+ in
+ let ty_src,ty_tgt = extract_last_two_p coer_ty in
+ let src_uri = uri_of_term ty_src in
+ let tgt_uri = uri_of_term ty_tgt in
+ let coercions_to_add =
+ CoercGraph.close_coercion_graph src_uri tgt_uri coer_uri
+ in
+ (* FIXME: we should chek it this object can be a coercion
+ * maybe add the check to extract_last_two_p
+ *)
+ List.iter (fun (uri,obj,ugraph) ->
+ (*
+ prerr_endline (Printf.sprintf
+ "Aggiungo la coercion %s\n%s\n\n"
+ (UriManager.string_of_uri uri) (CicPp.ppobj obj));
+ *)
+ let (name, body, ty, attrs) = split_obj obj in
+ add_constant_to_world ~console
+ ~dbd ~uri ?body ~ty ~attrs ~ugraph ();
+ ) coercions_to_add;
+ Quiet
| tactical -> shared#evalTactical tactical
end
incr count;
name
end else
- FreshNamesGenerator.mk_fresh_name metasenv context name ~typ
+ FreshNamesGenerator.mk_fresh_name ~subst:[] metasenv context name ~typ
- (** Implements phrases that should be accepted only in `Proof state, basically
+ (** Implements phrases that should be accepted only in Proof state, basically
* tacticals *)
class proofState
~(disambiguator: MatitaTypes.disambiguator)
- ~(proof_handler: MatitaTypes.proof_handler)
- ~(console: MatitaConsole.console)
+ ~(currentProof: MatitaTypes.currentProof)
+ ~(console: MatitaTypes.console)
+ ?mathViewer
+ ~(dbd: Mysql.dbd)
()
=
let disambiguate ast =
- let (_, _, term) = disambiguate ~disambiguator ~proof_handler ast in
+ let (_, _, term, _) = disambiguate ~disambiguator ~currentProof ast in
term
in
(** tactic AST -> ProofEngineTypes.tactic *)
| TacticAst.LocatedTactic (_, tactic) -> lookup_tactic tactic
| TacticAst.Intros (_, names) -> (* TODO Zack implement intros length *)
PrimitiveTactics.intros_tac ~mk_fresh_name_callback:(namer_of names) ()
- | TacticAst.Reflexivity -> EqualityTactics.reflexivity_tac
- | TacticAst.Assumption -> VariousTactics.assumption_tac
- | TacticAst.Contradiction -> NegationTactics.contradiction_tac
- | TacticAst.Exists -> IntroductionTactics.exists_tac
- | TacticAst.Fourier -> FourierR.fourier_tac
- | TacticAst.Left -> IntroductionTactics.left_tac
- | TacticAst.Right -> IntroductionTactics.right_tac
- | TacticAst.Ring -> Ring.ring_tac
- | TacticAst.Split -> IntroductionTactics.split_tac
- | TacticAst.Symmetry -> EqualityTactics.symmetry_tac
- | TacticAst.Transitivity term ->
- EqualityTactics.transitivity_tac (disambiguate term)
- | TacticAst.Apply term -> PrimitiveTactics.apply_tac (disambiguate term)
- | TacticAst.Exact term -> PrimitiveTactics.exact_tac (disambiguate term)
- | TacticAst.Cut term -> PrimitiveTactics.cut_tac (disambiguate term)
- | TacticAst.ElimType term ->
- EliminationTactics.elim_type_tac (disambiguate term)
+ | TacticAst.Reflexivity -> Tactics.reflexivity
+ | TacticAst.Assumption -> Tactics.assumption
+ | TacticAst.Contradiction -> Tactics.contradiction
+ | TacticAst.Exists -> Tactics.exists
+ | TacticAst.Fourier -> Tactics.fourier
+ | TacticAst.Left -> Tactics.left
+ | TacticAst.Right -> Tactics.right
+ | TacticAst.Ring -> Tactics.ring
+ | TacticAst.Split -> Tactics.split
+ | TacticAst.Symmetry -> Tactics.symmetry
+ | TacticAst.Transitivity term -> Tactics.transitivity (disambiguate term)
+ | TacticAst.Apply term -> Tactics.apply (disambiguate term)
+ | TacticAst.Absurd term -> Tactics.absurd (disambiguate term)
+ | TacticAst.Exact term -> Tactics.exact (disambiguate term)
+ | TacticAst.Cut term -> Tactics.cut (disambiguate term)
+ | TacticAst.Elim (term, _) -> (* TODO Zack implement "using" argument *)
+ Tactics.elim_intros_simpl (disambiguate term)
+ | TacticAst.ElimType term -> Tactics.elim_type (disambiguate term)
| TacticAst.Replace (what, with_what) ->
- EqualityTactics.replace_tac ~what:(disambiguate what)
+ Tactics.replace ~what:(disambiguate what)
~with_what:(disambiguate with_what)
+ | TacticAst.Auto -> Tactics.auto_new ~dbd
(*
(* TODO Zack a lot more of tactics to be implemented here ... *)
- | TacticAst.Absurd
| TacticAst.Change of 'term * 'term * 'ident option
| TacticAst.Change_pattern of 'term pattern * 'term * 'ident option
| TacticAst.Decompose of 'ident * 'ident list
| TacticAst.Discriminate of 'ident
- | TacticAst.Elim of 'term * 'term option
| TacticAst.Fold of reduction_kind * 'term
| TacticAst.Injection of 'ident
| TacticAst.LetIn of 'term * 'ident
| _ ->
MatitaTypes.not_implemented "some tactic"
in
- let shared = new sharedState ~disambiguator ~proof_handler ~console () in
+ let shared =
+ new sharedState ~disambiguator ~currentProof ~console ?mathViewer ~dbd ()
+ in
object (self)
inherit interpreterState ~console
method evalTactical = function
| TacticAst.LocatedTactical (_, tactical) -> self#evalTactical tactical
| TacticAst.Command TacticAst.Abort ->
- proof_handler.MatitaTypes.abort_proof ();
- Some `Command
+ currentProof#abort ();
+ New_state Command
| TacticAst.Command (TacticAst.Undo steps) ->
- (proof_handler.MatitaTypes.get_proof ())#undo ?steps ();
- Some `Proof
+ currentProof#proof#undo ?steps ();
+ New_state Proof
| TacticAst.Command (TacticAst.Redo steps) ->
- (proof_handler.MatitaTypes.get_proof ())#redo ?steps ();
- Some `Proof
+ currentProof#proof#redo ?steps ();
+ New_state Proof
+ | TacticAst.Command (TacticAst.Qed None) ->
+ if not (currentProof#onGoing ()) then assert false;
+ let proof = currentProof#proof in
+ let (uri, metasenv, bo, ty) = proof#proof in
+ let uri = MatitaTypes.unopt_uri uri in
+ let suri = UriManager.string_of_uri uri in
+ (* TODO Zack this function probably should not simply fail with
+ * Failure, but rather raise some more meaningful exception *)
+ if metasenv <> [] then failwith "Proof not completed";
+ let proved_ty,ugraph =
+ CicTypeChecker.type_of_aux' [] [] bo CicUniv.empty_ugraph
+ in
+ let b,ugraph =
+ CicReduction.are_convertible [] proved_ty ty ugraph
+ in
+ if not b then failwith "Wrong proof";
+ add_constant_to_world ~console ~dbd ~uri ~body:bo ~ty ~ugraph ();
+ currentProof#abort ();
+ (match mathViewer with None -> () | Some v -> v#unload ());
+ console#echo_message (sprintf "%s defined" suri);
+ New_state Command
| TacticAst.Seq tacticals ->
(* TODO Zack check for proof completed at each step? *)
List.iter (fun t -> ignore (self#evalTactical t)) tacticals;
- Some `Proof
+ New_state Proof
| TacticAst.Tactic tactic_phrase ->
let tactic = lookup_tactic tactic_phrase in
- (proof_handler.MatitaTypes.get_proof ())#apply_tactic tactic;
- Some `Proof
+ currentProof#proof#apply_tactic tactic;
+ New_state Proof
| tactical -> shared#evalTactical tactical
end
class interpreter
~(disambiguator: MatitaTypes.disambiguator)
- ~(proof_handler: MatitaTypes.proof_handler)
- ~(console: MatitaConsole.console)
+ ~(currentProof: MatitaTypes.currentProof)
+ ~(console: MatitaTypes.console)
+ ?mathViewer
+ ~(dbd: Mysql.dbd)
()
=
let commandState =
- new commandState ~disambiguator ~proof_handler ~console ()
+ new commandState ~disambiguator ~currentProof ~console ?mathViewer ~dbd ()
+ in
+ let proofState =
+ new proofState ~disambiguator ~currentProof ~console ?mathViewer ~dbd ()
in
- let proofState = new proofState ~disambiguator ~proof_handler ~console () in
- object
+ object (self)
val mutable state = commandState
method reset = state <- commandState
- method evalPhrase s =
- try
- (match state#evalPhrase s with
- | Some `Command -> state <- commandState
- | Some `Proof -> state <- proofState
- | None -> ())
- with exn ->
- console#echo_error (sprintf "Uncaught exception: %s"
- (Printexc.to_string exn))
+ method endOffset = state#endOffset
+
+ method private updateState = function
+ | New_state Command -> (state <- commandState)
+ | New_state Proof -> (state <- proofState)
+ | _ -> ()
+
+ method private eval f =
+ let ok () = (* console#clear (); *) (true, true) in
+ match console#wrap_exn f with
+ | Some (New_state Command) -> (state <- commandState); ok ()
+ | Some (New_state Proof) -> (state <- proofState); ok ()
+ | Some (Echo msg) -> console#echo_message msg; (true, false)
+ | Some Quiet -> ok ()
+ | None -> (false, false)
+
+ method evalPhrase s = self#eval (fun () -> state#evalPhrase s)
+ method evalAst ast = self#eval (fun () -> state#evalAst ast)
end