Module Coq.State

type t
val compare : t -> t -> int
val equal : t -> t -> bool
val hash : t -> int
val mode : st:t -> Pvernac.proof_mode option
val parsing : st:t -> Vernacstate.Parser.t
module Proof : sig ... end

Proof states

val lemmas : st:t -> Proof.t option
val program : st:t -> Declare.OblState.View.t Names.Id.Map.t
val in_state : token:Limits.Token.t -> st:t -> f:('a -> 'b) -> 'a -> ('b, Loc.t) Protect.E.t

Execute a command in state st. Unfortunately this can produce anomalies as Coq state setting is imperative, so we need to wrap it in protect.

val in_stateM : token:Limits.Token.t -> st:t -> f:('a -> ('b, Loc.t) Protect.E.t) -> 'a -> ('b, Loc.t) Protect.E.t

Execute a monadic command in state st.

val drop_proof : st:t -> t

Drop the top proof from the state

val drop_all_proofs : st:t -> t

Drop all proofs from the state

val admit : token:Limits.Token.t -> st:t -> (t, Loc.t) Protect.E.t

Fully admit an ongoing proof

val admit_goal : token:Limits.Token.t -> st:t -> (t, Loc.t) Protect.E.t

Admit the current sub-goal

val info_universes : token:Limits.Token.t -> st:t -> (int * int, Loc.t) Protect.E.t

Info about universes

val marshal_in : Stdlib.in_channel -> t

Extra / interanl

val marshal_out : Stdlib.out_channel -> t -> unit
val of_coq : Vernacstate.t -> t
val to_coq : t -> Vernacstate.t