pub enum Unit {
Constants(Vec<Decl>),
Variables(Vec<String>),
Recursive(Vec<Decl>),
Def(Def),
Instance {
name: Option<String>,
module: String,
subs: Vec<(String, Expr)>,
},
Assume(Expr),
Theorem(Expr),
Inner(Box<Module>),
Opaque,
}Variants§
Constants(Vec<Decl>)
Variables(Vec<String>)
Recursive(Vec<Decl>)
Def(Def)
Instance
S == INSTANCE M WITH x <- e — named when it introduces a prefix,
anonymous when the module’s definitions are pulled in directly.
Assume(Expr)
Theorem(Expr)
Inner(Box<Module>)
A module declared inside another one.
Opaque
A unit the evaluator has no use for and the parser did not keep: a
TLAPS proof, or a theorem stated in the ASSUME ... PROVE form.
Trait Implementations§
impl Eq for Unit
impl StructuralPartialEq for Unit
Auto Trait Implementations§
impl Freeze for Unit
impl RefUnwindSafe for Unit
impl Send for Unit
impl Sync for Unit
impl Unpin for Unit
impl UnsafeUnpin for Unit
impl UnwindSafe for Unit
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more