open Printf
open MatitaTypes

exception Drop;;

let debug = false ;;
let debug_print = if debug then prerr_endline else ignore ;;

(** create a ProofEngineTypes.mk_fresh_name_type function which uses given
  * names as long as they are available, then it fallbacks to name generation
  * using FreshNamesGenerator module *)
let namer_of names =
  let len = List.length names in
  let count = ref 0 in
  fun metasenv context name ~typ ->
    if !count < len then begin
      let name = Cic.Name (List.nth names !count) in
      incr count;
      name
    end else
      FreshNamesGenerator.mk_fresh_name ~subst:[] metasenv context name ~typ

let tactic_of_ast = function
  | TacticAst.Absurd (_, term) -> Tactics.absurd term
  | TacticAst.Apply (_, term) -> Tactics.apply term
  | TacticAst.Assumption _ -> Tactics.assumption
  | TacticAst.Auto (_,depth,width) -> 
      AutoTactic.auto_tac ?depth ?width ~dbd:(MatitaDb.instance ()) ()
  | TacticAst.Change (_, pattern, with_what) ->
     Tactics.change ~pattern with_what
  | TacticAst.Clear (_,id) -> Tactics.clear id
  | TacticAst.ClearBody (_,id) -> Tactics.clearbody id
  | TacticAst.Contradiction _ -> Tactics.contradiction
  | TacticAst.Compare (_, term) -> Tactics.compare term
  | TacticAst.Constructor (_, n) -> Tactics.constructor n
  | TacticAst.Cut (_, ident, term) ->
     let names = match ident with None -> [] | Some id -> [id] in
     Tactics.cut ~mk_fresh_name_callback:(namer_of names) term
  | TacticAst.DecideEquality _ -> Tactics.decide_equality
  | TacticAst.Decompose (_,term) -> Tactics.decompose term
  | TacticAst.Discriminate (_,term) -> Tactics.discriminate term
  | TacticAst.Elim (_, what, using, depth, names) ->
      Tactics.elim_intros ?using ?depth ~mk_fresh_name_callback:(namer_of names) what
  | TacticAst.ElimType (_, what, using, depth, names) ->
      Tactics.elim_type ?using ?depth ~mk_fresh_name_callback:(namer_of names) what
  | TacticAst.Exact (_, term) -> Tactics.exact term
  | TacticAst.Exists _ -> Tactics.exists
  | TacticAst.Fail _ -> Tactics.fail
  | TacticAst.Fold (_, reduction_kind, term, pattern) ->
     let reduction =
      match reduction_kind with
       | `Normalize -> CicReduction.normalize ~delta:false ~subst:[]
       | `Reduce -> ProofEngineReduction.reduce
       | `Simpl -> ProofEngineReduction.simpl
       | `Whd -> CicReduction.whd ~delta:false ~subst:[]
     in
      Tactics.fold ~reduction ~term ~pattern
  | TacticAst.Fourier _ -> Tactics.fourier
  | TacticAst.FwdSimpl (_, hyp, names) -> 
     Tactics.fwd_simpl ~mk_fresh_name_callback:(namer_of names) ~dbd:(MatitaDb.instance ()) hyp
  | TacticAst.Generalize (_,pattern,ident) ->
     let names = match ident with None -> [] | Some id -> [id] in
     Tactics.generalize ~mk_fresh_name_callback:(namer_of names) pattern 
  | TacticAst.Goal (_, n) -> Tactics.set_goal n
  | TacticAst.IdTac _ -> Tactics.id
  | TacticAst.Injection (_,term) -> Tactics.injection term
  | TacticAst.Intros (_, None, names) ->
      PrimitiveTactics.intros_tac ~mk_fresh_name_callback:(namer_of names) ()
  | TacticAst.Intros (_, Some num, names) ->
      PrimitiveTactics.intros_tac ~howmany:num
        ~mk_fresh_name_callback:(namer_of names) ()
  | TacticAst.LApply (_, how_many, to_what, what, ident) ->
     let names = match ident with None -> [] | Some id -> [id] in
     Tactics.lapply ~mk_fresh_name_callback:(namer_of names) ?how_many ~to_what what
  | TacticAst.Left _ -> Tactics.left
  | TacticAst.LetIn (loc,term,name) ->
      Tactics.letin term ~mk_fresh_name_callback:(namer_of [name])
  | TacticAst.Reduce (_, reduction_kind, pattern) ->
      (match reduction_kind with
      | `Normalize -> Tactics.normalize ~pattern
      | `Reduce -> Tactics.reduce ~pattern  
      | `Simpl -> Tactics.simpl ~pattern 
      | `Whd -> Tactics.whd ~pattern)
  | TacticAst.Reflexivity _ -> Tactics.reflexivity
  | TacticAst.Replace (_, pattern, with_what) ->
     Tactics.replace ~pattern ~with_what
  | TacticAst.Rewrite (_, direction, t, pattern) ->
     EqualityTactics.rewrite_tac ~direction ~pattern t
  | TacticAst.Right _ -> Tactics.right
  | TacticAst.Ring _ -> Tactics.ring
  | TacticAst.Split _ -> Tactics.split
  | TacticAst.Symmetry _ -> Tactics.symmetry
  | TacticAst.Transitivity (_, term) -> Tactics.transitivity term

let disambiguate_term status term =
  let (aliases, metasenv, cic, _) =
    match
      MatitaDisambiguator.disambiguate_term ~dbd:(MatitaDb.instance ())
        ~aliases:(status.aliases) ~context:(MatitaMisc.get_proof_context status)
        ~metasenv:(MatitaMisc.get_proof_metasenv status) term
    with
    | [x] -> x
    | _ -> assert false
  in
  let proof_status =
    match status.proof_status with
    | No_proof -> Intermediate metasenv
    | Incomplete_proof ((uri, _, proof, ty), goal) ->
        Incomplete_proof ((uri, metasenv, proof, ty), goal)
    | Intermediate _ -> Intermediate metasenv 
    | Proof _ -> assert false
  in
  let status = { status with proof_status = proof_status } in
  let status = MatitaSync.set_proof_aliases status aliases in
  status, cic
  
let disambiguate_pattern status (wanted, hyp_paths, goal_path) =
  let interp path = Disambiguate.interpretate_path [] status.aliases path in
  let goal_path = interp goal_path in
  let hyp_paths = List.map (fun (name, path) -> name, interp path) hyp_paths in
  let status,wanted =
   match wanted with
      None -> status,None
    | Some wanted ->
       let status,wanted = disambiguate_term status wanted in
        status, Some wanted
  in
   status, (wanted, hyp_paths ,goal_path)
  
let disambiguate_tactic status = function
  | TacticAst.Apply (loc, term) ->
      let status, cic = disambiguate_term status term in
      status, TacticAst.Apply (loc, cic)
  | TacticAst.Absurd (loc, term) -> 
      let status, cic = disambiguate_term status term in
      status, TacticAst.Absurd (loc, cic)
  | TacticAst.Assumption loc -> status, TacticAst.Assumption loc
  | TacticAst.Auto (loc,depth,width) -> status, TacticAst.Auto (loc,depth,width)
  | TacticAst.Change (loc, pattern, with_what) -> 
      let status, with_what = disambiguate_term status with_what in
      let status, pattern = disambiguate_pattern status pattern in
      status, TacticAst.Change (loc, pattern, with_what)
  | TacticAst.Clear (loc,id) -> status,TacticAst.Clear (loc,id)
  | TacticAst.ClearBody (loc,id) -> status,TacticAst.ClearBody (loc,id)
  | TacticAst.Compare (loc,term) ->
      let status, term = disambiguate_term status term in
      status, TacticAst.Compare (loc,term)
  | TacticAst.Constructor (loc,n) ->
      status, TacticAst.Constructor (loc,n)
  | TacticAst.Contradiction loc ->
      status, TacticAst.Contradiction loc
  | TacticAst.Cut (loc, ident, term) -> 
      let status, cic = disambiguate_term status term in
      status, TacticAst.Cut (loc, ident, cic)
  | TacticAst.DecideEquality loc ->
      status, TacticAst.DecideEquality loc
  | TacticAst.Decompose (loc,term) ->
      let status,term = disambiguate_term status term in
      status, TacticAst.Decompose(loc,term)
  | TacticAst.Discriminate (loc,term) ->
      let status,term = disambiguate_term status term in
      status, TacticAst.Discriminate(loc,term)
  | TacticAst.Exact (loc, term) -> 
      let status, cic = disambiguate_term status term in
      status, TacticAst.Exact (loc, cic)
  | TacticAst.Elim (loc, what, Some using, depth, idents) ->
      let status, what = disambiguate_term status what in
      let status, using = disambiguate_term status using in
      status, TacticAst.Elim (loc, what, Some using, depth, idents)
  | TacticAst.Elim (loc, what, None, depth, idents) ->
      let status, what = disambiguate_term status what in
      status, TacticAst.Elim (loc, what, None, depth, idents)
  | TacticAst.ElimType (loc, what, Some using, depth, idents) ->
      let status, what = disambiguate_term status what in
      let status, using = disambiguate_term status using in
      status, TacticAst.ElimType (loc, what, Some using, depth, idents)
  | TacticAst.ElimType (loc, what, None, depth, idents) ->
      let status, what = disambiguate_term status what in
      status, TacticAst.ElimType (loc, what, None, depth, idents)
  | TacticAst.Exists loc -> status, TacticAst.Exists loc 
  | TacticAst.Fail loc -> status,TacticAst.Fail loc
  | TacticAst.Fold (loc,reduction_kind, term, pattern) ->
     let status, pattern = disambiguate_pattern status pattern in
     let status, term = disambiguate_term status term in
     status, TacticAst.Fold (loc,reduction_kind, term, pattern)
  | TacticAst.FwdSimpl (loc, hyp, names) ->
     status, TacticAst.FwdSimpl (loc, hyp, names)  
  | TacticAst.Fourier loc -> status, TacticAst.Fourier loc
  | TacticAst.Generalize (loc,pattern,ident) ->
      let status, pattern = disambiguate_pattern status pattern in
      status, TacticAst.Generalize(loc,pattern,ident)
  | TacticAst.Goal (loc, g) -> status, TacticAst.Goal (loc, g)
  | TacticAst.IdTac loc -> status,TacticAst.IdTac loc
  | TacticAst.Injection (loc,term) ->
      let status, term = disambiguate_term status term in
      status, TacticAst.Injection (loc,term)
  | TacticAst.Intros (loc, num, names) ->
      status, TacticAst.Intros (loc, num, names)
  | TacticAst.LApply (loc, depth, to_what, what, ident) ->
     let f term (status, to_what) =
        let status, term = disambiguate_term status term in
        status, term :: to_what
     in
     let status, to_what = List.fold_right f to_what (status, []) in 
     let status, what = disambiguate_term status what in
     status, TacticAst.LApply (loc, depth, to_what, what, ident)
  | TacticAst.Left loc -> status, TacticAst.Left loc
  | TacticAst.LetIn (loc, term, name) ->
      let status, term = disambiguate_term status term in
      status, TacticAst.LetIn (loc,term,name)
  | TacticAst.Reduce (loc, reduction_kind, pattern) ->
      let status, pattern = disambiguate_pattern status pattern in
      status, TacticAst.Reduce(loc, reduction_kind, pattern)
  | TacticAst.Reflexivity loc -> status, TacticAst.Reflexivity loc
  | TacticAst.Replace (loc, pattern, with_what) -> 
      let status, pattern = disambiguate_pattern status pattern in
      let status, with_what = disambiguate_term status with_what in
      status, TacticAst.Replace (loc, pattern, with_what)
  | TacticAst.Rewrite (loc, dir, t, pattern) ->
      let status, term = disambiguate_term status t in
      let status, pattern = disambiguate_pattern status pattern in
      status, TacticAst.Rewrite (loc, dir, term, pattern)
  | TacticAst.Right loc -> status, TacticAst.Right loc
  | TacticAst.Ring loc -> status, TacticAst.Ring loc
  | TacticAst.Split loc -> status, TacticAst.Split loc
  | TacticAst.Symmetry loc -> status, TacticAst.Symmetry loc
  | TacticAst.Transitivity (loc, term) -> 
      let status, cic = disambiguate_term status term in
      status, TacticAst.Transitivity (loc, cic)

let apply_tactic tactic status =
 let status,tactic = disambiguate_tactic status tactic in
 let tactic = tactic_of_ast tactic in
 let (proof, goals) =
  ProofEngineTypes.apply_tactic tactic (MatitaMisc.get_proof_status status) in
 let dummy = -1 in
  { status with
     proof_status = MatitaTypes.Incomplete_proof (proof,dummy) }, goals

module MatitaStatus =
 struct
  type input_status = MatitaTypes.status
  type output_status = MatitaTypes.status * ProofEngineTypes.goal list
  type tactic = input_status -> output_status

  let focus (status,_) goal =
   let proof,_ = MatitaMisc.get_proof_status status in
    {status with proof_status = MatitaTypes.Incomplete_proof (proof,goal)}

  let goals (_,goals) = goals

  let set_goals (status,_) goals = status,goals

  let id_tac status = apply_tactic (TacticAst.IdTac CicAst.dummy_floc) status

  let mk_tactic tac = tac

  let apply_tactic tac = tac

 end

module MatitaTacticals = Tacticals.Make(MatitaStatus)

let eval_tactical status tac =
 let rec tactical_of_ast tac =
  match tac with
    | TacticAst.Tactic (loc, tactic) -> apply_tactic tactic
    | TacticAst.Seq (loc, tacticals) ->  (* tac1; tac2; ... *)
       MatitaTacticals.seq ~tactics:(List.map tactical_of_ast tacticals)
    | TacticAst.Do (loc, num, tactical) ->
        MatitaTacticals.do_tactic ~n:num ~tactic:(tactical_of_ast tactical)
    | TacticAst.Repeat (loc, tactical) ->
        MatitaTacticals.repeat_tactic ~tactic:(tactical_of_ast tactical)
    | TacticAst.Then (loc, tactical, tacticals) ->  (* tac; [ tac1 | ... ] *)
        MatitaTacticals.thens ~start:(tactical_of_ast tactical)
          ~continuations:(List.map tactical_of_ast tacticals)
    | TacticAst.First (loc, tacticals) ->
        MatitaTacticals.first
          ~tactics:(List.map (fun t -> "", tactical_of_ast t) tacticals)
    | TacticAst.Try (loc, tactical) ->
        MatitaTacticals.try_tactic ~tactic:(tactical_of_ast tactical)
    | TacticAst.Solve (loc, tacticals) ->
        MatitaTacticals.solve_tactics
         ~tactics:(List.map (fun t -> "",tactical_of_ast t) tacticals)
 in
  let status,goals = tactical_of_ast tac status in
  let proof,_ = MatitaMisc.get_proof_status status in
  let new_status =
   match goals with
   | [] -> 
       let (_,metasenv,_,_) = proof in
       (match metasenv with
       | [] -> Proof proof
       | (ng,_,_)::_ -> Incomplete_proof (proof,ng))
   | ng::_ -> Incomplete_proof (proof, ng)
  in
   { status with proof_status = new_status }

let eval_coercion status coercion = 
  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 ty_src,ty_tgt = extract_last_two_p coer_ty in
  let context = [] in 
  let src_uri = 
    let ty_src = CicReduction.whd context ty_src in
     CicUtil.uri_of_term ty_src
  in
  let tgt_uri = 
    let ty_tgt = CicReduction.whd context ty_tgt in
     CicUtil.uri_of_term ty_tgt
  in
  let new_coercions =
    (* also adds them to the Db *)
    CoercGraph.close_coercion_graph src_uri tgt_uri coer_uri in
  let status =
   List.fold_left (fun s (uri,o,ugraph) -> MatitaSync.add_obj uri o status)
    status new_coercions in
  let statement_of name =
    TacticAstPp.pp_statement 
      (TacticAst.Executable (CicAst.dummy_floc,
        (TacticAst.Command (CicAst.dummy_floc,
          (TacticAst.Coercion (CicAst.dummy_floc, 
            (CicAst.Ident (name, None)))))))) ^ "\n"
  in
  let moo_content_rev =
    [statement_of (UriManager.name_of_uri coer_uri)] @ 
    (List.map 
      (fun (uri, _, _) -> 
        statement_of (UriManager.name_of_uri uri))
    new_coercions) @ status.moo_content_rev 
  in
  let status =  {status with moo_content_rev = moo_content_rev} in
  {status with proof_status = No_proof}

let generate_elimination_principles uri status =
 let elim sort status =
   try
    let uri,obj = CicElim.elim_of ~sort uri 0 in
     MatitaSync.add_obj uri obj status
   with CicElim.Can_t_eliminate -> status
 in
 List.fold_left (fun status sort -> elim sort status) status
  [ Cic.Prop; Cic.Set; (Cic.Type (CicUniv.fresh ())) ]

let generate_projections uri fields status =
 let projections = CicRecord.projections_of uri fields in
  List.fold_left
   (fun status (uri, name, bo) -> 
     try 
      let ty, ugraph = 
        CicTypeChecker.type_of_aux' [] [] bo CicUniv.empty_ugraph in
      let bo = Unshare.unshare bo in
      let ty = Unshare.unshare ty in
      let attrs = [`Class `Projection; `Generated] in
      let obj = Cic.Constant (name,Some bo,ty,[],attrs) in
       MatitaSync.add_obj uri obj status
     with
        CicTypeChecker.TypeCheckerFailure s ->
         MatitaLog.message 
          ("Unable to create projection " ^ name ^ " cause: " ^ s);
         status
      | CicEnvironment.Object_not_found uri ->
         let depend = UriManager.name_of_uri uri in
          MatitaLog.message 
           ("Unable to create projection " ^ name ^ " because it requires " ^ depend);
         status
  ) status projections

(* to avoid a long list of recursive functions *)
let eval_from_stream_ref = ref (fun _ _ _ -> assert false);;
 
let disambiguate_obj status obj =
  let uri =
   match obj with
      TacticAst.Inductive (_,(name,_,_,_)::_)
    | TacticAst.Record (_,name,_,_) ->
       Some (UriManager.uri_of_string (MatitaMisc.qualify status name ^ ".ind"))
    | TacticAst.Inductive _ -> assert false
    | _ -> None in
  let (aliases, metasenv, cic, _) =
    match
      MatitaDisambiguator.disambiguate_obj ~dbd:(MatitaDb.instance ())
        ~aliases:(status.aliases) ~uri obj
    with
    | [x] -> x
    | _ -> assert false
  in
  let proof_status =
    match status.proof_status with
    | No_proof -> Intermediate metasenv
    | Incomplete_proof _
    | Intermediate _
    | Proof _ -> assert false
  in
  let status = { status with proof_status = proof_status } in
  let status = MatitaSync.set_proof_aliases status aliases in
  status, cic
  
let disambiguate_command status = function
  | TacticAst.Default _
  | TacticAst.Alias _
  | TacticAst.Include _ as cmd  -> status,cmd
  | TacticAst.Coercion (loc, term) ->
      let status, term = disambiguate_term status term in
      status, TacticAst.Coercion (loc,term)
  | (TacticAst.Set _ | TacticAst.Qed _ | TacticAst.Drop _ ) as cmd ->
      status, cmd
  | TacticAst.Obj (loc,obj) ->
      let status,obj = disambiguate_obj status obj in
       status, TacticAst.Obj (loc,obj)

let eval_command status cmd =
 let status,cmd = disambiguate_command status cmd in
  match cmd with
  | TacticAst.Default (loc, what, uris) as cmd ->
     LibraryObjects.set_default what uris;
     {status with moo_content_rev =
        (TacticAstPp.pp_command cmd ^ "\n") :: status.moo_content_rev}
  | TacticAst.Include (loc, path) ->
     let path = MatitaMisc.obj_file_of_script path in
     let stream = Stream.of_channel (open_in path) in
     let status = ref status in
      !eval_from_stream_ref status stream (fun _ _ -> ());
      !status
  | TacticAst.Set (loc, name, value) -> 
      let value = 
        if name = "baseuri" then
          let v = MatitaMisc.strip_trailing_slash value in
          try
            ignore (String.index v ' ');
            command_error "baseuri can't contain spaces"
          with Not_found -> v
        else
          value
      in
      set_option status name value
  | TacticAst.Drop loc -> raise Drop
  | TacticAst.Qed loc ->
      let uri, metasenv, bo, ty = 
        match status.proof_status with
        | Proof (Some uri, metasenv, body, ty) ->
            uri, metasenv, body, ty
        | Proof (None, metasenv, body, ty) -> 
            command_error 
              ("Someone allows to start a thm without giving the "^
               "name/uri. This should be fixed!")
        | _-> command_error "You can't qed an uncomplete theorem"
      in
      let suri = UriManager.string_of_uri uri in
      if metasenv <> [] then 
        command_error "Proof not completed! metasenv is not empty!";
      let name = UriManager.name_of_uri uri in
      let obj = Cic.Constant (name,Some bo,ty,[],[]) in
      MatitaSync.add_obj uri obj status
  | TacticAst.Coercion (loc, coercion) -> 
      eval_coercion status coercion
  | TacticAst.Alias (loc, spec) -> 
     let aliases =
      match spec with
      | TacticAst.Ident_alias (id,uri) -> 
         DisambiguateTypes.Environment.add 
          (DisambiguateTypes.Id id) 
          (uri,(fun _ _ _-> CicUtil.term_of_uri (UriManager.uri_of_string uri)))
          status.aliases 
      | TacticAst.Symbol_alias (symb, instance, desc) ->
         DisambiguateTypes.Environment.add 
          (DisambiguateTypes.Symbol (symb,instance))
          (DisambiguateChoices.lookup_symbol_by_dsc symb desc) 
          status.aliases
      | TacticAst.Number_alias (instance,desc) ->
         DisambiguateTypes.Environment.add 
          (DisambiguateTypes.Num instance) 
          (DisambiguateChoices.lookup_num_by_dsc desc) status.aliases
     in
      MatitaSync.set_proof_aliases status aliases
  | TacticAst.Obj (loc,obj) ->
     let ext,name =
      match obj with
         Cic.Constant (name,_,_,_,_)
       | Cic.CurrentProof (name,_,_,_,_,_) -> ".con",name
       | Cic.InductiveDefinition (types,_,_,_) ->
          ".ind",
          (match types with (name,_,_,_)::_ -> name | _ -> assert false)
       | _ -> assert false in
     let uri = 
       UriManager.uri_of_string (MatitaMisc.qualify status name ^ ext) 
     in
     let metasenv = MatitaMisc.get_proof_metasenv status in
     match obj with
        Cic.CurrentProof (_,metasenv',bo,ty,_,_) ->
         let name = UriManager.name_of_uri uri in
	 if not(CicPp.check name ty) then
           MatitaLog.warn ("Bad name: " ^ name);
         assert (metasenv = metasenv');
         let goalno =
          match metasenv' with (goalno,_,_)::_ -> goalno | _ -> assert false in
         let initial_proof = (Some uri, metasenv, bo, ty) in
          { status with proof_status = Incomplete_proof (initial_proof,goalno)}
      | _ ->
        if metasenv <> [] then
         command_error (
           "metasenv not empty while giving a definition with body: " ^
           CicMetaSubst.ppmetasenv metasenv []);
        let status = MatitaSync.add_obj uri obj status in
         match obj with
            Cic.Constant _ -> status
          | Cic.InductiveDefinition (_,_,_,attrs) ->
             let status = generate_elimination_principles uri status in
             let rec get_record_attrs =
              function
                 [] -> None
               | (`Class (`Record fields))::_ -> Some fields
               | _::tl -> get_record_attrs tl
             in
              (match get_record_attrs attrs with
                  None -> status (* not a record *)
                | Some fields -> generate_projections uri fields status)
          | Cic.CurrentProof _
          | Cic.Variable _ -> assert false

let eval_executable status ex =
  match ex with
  | TacticAst.Tactical (_, tac) -> eval_tactical status tac
  | TacticAst.Command (_, cmd) -> eval_command status cmd
  | TacticAst.Macro (_, mac) -> 
      command_error (sprintf "The macro %s can't be in a script" 
        (TacticAstPp.pp_macro_ast mac))

let eval_comment status c = status
            
let eval_ast status st =
  match st with
  | TacticAst.Executable (_,ex) -> eval_executable status ex
  | TacticAst.Comment (_,c) -> eval_comment status c

let eval_from_stream status str cb =
  let stl = CicTextualParser2.parse_statements str in
  List.iter
   (fun ast -> cb !status ast;status := eval_ast !status ast) stl
;;

(* to avoid a long list of recursive functions *)
eval_from_stream_ref := eval_from_stream;;
  
let eval_from_stream_greedy status str cb =
  while true do
    print_string "matita> ";
    flush stdout;
    let ast = CicTextualParser2.parse_statement str in
    cb !status ast;
    status := eval_ast !status ast 
  done
;;

let eval_string status str =
  eval_from_stream status (Stream.of_string str) (fun _ _ -> ())

let default_options () =
(*
  let options =
    StringMap.add "baseuri"
      (String
        (Helm_registry.get "matita.baseuri" ^ Helm_registry.get "matita.owner"))
      no_options
  in
*)
  let options =
    StringMap.add "basedir"
      (String (Helm_registry.get "matita.basedir" ))
      no_options
  in
  options

let initial_status =
  lazy {
    aliases = DisambiguateTypes.empty_environment;
    moo_content_rev = [];
    proof_status = No_proof;
    options = default_options ();
    objects = [];
  }