Sage Journals: Discover world-class research

Abstract

The algorithmic theory of stacks, ATS, formalizes properties of relational systems of stacks. It turns out that apart from previously known axioms a new axiom 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. The connections between ATS and a type STACKS declaration (written in LOGLAN programming language) are shown.

Keywords

abstract data types algorithmic theory - of stacks - of dictionaires of stacks and links interpretability relation between theories model representation theorem type declaration

Get full access to this article

View all access options for this article.

On the algorithmic theory of stacks 1

Abstract

Keywords

Get full access to this article