Stack -is:module

This is a simple process type that knows how to push back input.
Memory-managed wrapper type.
A stack is a cursor onto a window list. The data structure tracks focus by construction, and the master window is by convention the top-most item. Focus operations will not reorder the list that results from flattening the cursor. The structure can be envisaged as:
+-- master:  < '7' >
up |            [ '2' ]
+---------   [ '3' ]
focus:          < '4' >
dn +----------- [ '8' ]
A Stack can be viewed as a list with a hole punched in it to make the focused position. Under the zipper/calculus view of such structures, it is the differentiation of a [a], and integrating it back has a natural implementation used in index.
Monadic stack for the resolution algorithm
Immutable circular stack; useful, for example, to save, or restore a mutable circular stack.
unordered buffer, limiter drops the newest (top) message
Full data type definition for Stack. See stack for a more convenient constructor.
Not on Stackage, so not searched. Stack data structure