On the algorithmic theory of stacks1
1980; IOS Press; Volume: 3; Issue: 3 Linguagem: Inglês
10.3233/fi-1980-3305
ISSN1875-8681
Autores Tópico(s)Advanced Algebra and Logic
ResumoThe 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.
Referência(s)