Enum fungi_lang::ast::IdxTm

pub enum IdxTm {
    Var(Var),
    Sing(NameTm),
    Empty,
    Apart(IdxTmRec, IdxTmRec),
    Union(IdxTmRec, IdxTmRec),
    Unit,
    Bin(IdxTmRec, IdxTmRec),
    Pair(IdxTmRec, IdxTmRec),
    Proj1(IdxTmRec),
    Proj2(IdxTmRec),
    Lam(Var, Sort, IdxTmRec),
    App(IdxTmRec, IdxTmRec),
    Map(NameTmRec, IdxTmRec),
    FlatMap(IdxTmRec, IdxTmRec),
    Star(IdxTmRec, IdxTmRec),
    NoParse(String),
}

Index terms

Variants

Var(Var)Sing(NameTm)EmptyApart(IdxTmRec, IdxTmRec)Union(IdxTmRec, IdxTmRec)UnitBin(IdxTmRec, IdxTmRec)

All binary combinations of two name sets.

This is a common special case of curried nameset mapping:

( i ,, j ) := (#a:Nm. ((#b:Nm. a,,b) j)) i

Since this double-mapping pattern is very common, we introduce a special AST node for it.

Bin Sorting rule:

Gamma |- i : NmSet
Gamma |- j : NmSet
---------------------------- :: Bin
Gamma |- ( i ,, j ) : NmSet

Pair(IdxTmRec, IdxTmRec)

Pair Sorting rule:

Gamma |- i : g1
Gamma |- j : g2
----------------------------- :: Pair
Gamma |- ( i , j ) : g1 x g2

Proj1(IdxTmRec)Proj2(IdxTmRec)Lam(Var, Sort, IdxTmRec)App(IdxTmRec, IdxTmRec)Map(NameTmRec, IdxTmRec)FlatMap(IdxTmRec, IdxTmRec)Star(IdxTmRec, IdxTmRec)NoParse(String)

Trait Implementations

impl Clone for IdxTm

fn clone(&self) -> IdxTm

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for IdxTm

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Eq for IdxTm

impl PartialEq for IdxTm

fn eq(&self, __arg_0: &IdxTm) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &IdxTm) -> bool

This method tests for !=.

impl Hash for IdxTm

fn hash<__H: Hasher>(&self, __arg_0: &mut __H)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].