/Я language (β)/Behaviour/Stack/

> Stack : forall t i . i `AR__` I `L` t `T` i

Demonstration: initialise various datastructure in reverse order defined by representing object (FIFO):

> A `ho'nt'yo` Stack @ List
> A `ho'nt'yo` Stack @ ( Vector 1 )
> A `ho'nt'yo` Stack @ ( Nonempty List )
> B `has` A `ho'nt'yo` Stack @ List
> B `has` A `ho'nt'yo` Stack @ ( Vector 2 )
> B `has` A `ho'nt'yo` Stack @ ( Nonempty List )
> C `has` B `has` A `ho'nt'yo` Stack @ List
> C `has` B `has` A `ho'nt'yo` Stack @ ( Vector 3 )
> C `has` B `has` A `ho'nt'yo` Stack @ ( Nonempty List )

Counterpart: label that does initialise data structure in normal order is Plain.