Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Salwicki, Andrzej
Affiliations: Institute of Mathematics, Polish Academy of Sciences
Note: [1] This research was partially supported by Polish Academy of Sciences under contract MR. I. 3/04. 7. 1.
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
DOI: 10.3233/FI-1980-3305
Journal: Fundamenta Informaticae, vol. 3, no. 3, pp. 311-331, 1980
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]