pub enum TmS_ {
TopVar(TopVarName),
TopApp(TopVarName, Vec<TmS>),
Var(BwdIdx, VarName, LabelSegment),
Cons(Row<TmS>),
Proj(TmS, FieldName, LabelSegment),
Tt,
Id(TmS),
Compose(TmS, TmS),
Opaque,
}Expand description
Inner enum for TmS.
Variants§
TopVar(TopVarName)
A reference to a top-level constant def
TopApp(TopVarName, Vec<TmS>)
An application of a top-level term judgment to arguments
Var(BwdIdx, VarName, LabelSegment)
Variable syntax.
We use a backward index, as when we evaluate we store the environment in a [bwd::Bwd], and this indexes into that.
Cons(Row<TmS>)
Record introduction.
Proj(TmS, FieldName, LabelSegment)
Record elimination.
Tt
Unit introduction.
Note that eta-expansion takes care of elimination for units
Id(TmS)
Identity morphism at an object
Compose(TmS, TmS)
Composition of two morphisms
Opaque
An opaque term.
This only appears when we quote a value
Auto Trait Implementations§
impl Freeze for TmS_
impl RefUnwindSafe for TmS_
impl !Send for TmS_
impl !Sync for TmS_
impl Unpin for TmS_
impl UnwindSafe for TmS_
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
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.