摘要
栈的算法理论是栈的关系系统的特定性质。本文证明了不同于已知的有关理论的关于栈的算法特征的新公理，即ｗｈｉｌｅ型公理。这一公理说明每个栈的关系与有限元素序列系统是同构的。
An algorithmic theory of stack formalizes properties of relational systems of stack. It turns out that apart of perviously known axioms,the new axiow of algorithmic nature while empty (s) do s:=pop (s) true is in place. The representation theorem stating that every relational system of stacks is isomorphic to a system of finite sequences of elements is proved.
