Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1978: Mathematical Foundations of Computer Science 1978 pp 452–461Cite as

On algorithmic theory of stacks

  • Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 64))

Abstract

Algorithmic Theory of Stacks ATS formalizes properties of relational systems of stacks. It turns out that apart of previously known axioms, the 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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Banachowski, L., An axiomatic approach to the theory of data structures, Bull.Acad.Pol.Ser.Math.Phys.Astr. 23 1975, 315–323

    Google Scholar 

  2. Grabowski, M., On relationship between algorithmic logic and full weak second order logic /in polish/, 1977, University of Warsaw, unpublished manuscript

    Google Scholar 

  3. Guttag, J., Abstract Data Types... CACM 20 1977, 396–404

    Google Scholar 

  4. Liskov, B.M., Zilles, S.N., Programming with abstract data types Proc. ACM SIGPLAN Symp. on Very High Level Lang. SIGPLAN Notices ACM 9, 4 1974, 50–59

    Google Scholar 

  5. Mirkowska, G., Algorithmic logic and its applications in program theory, Fundamenta Informaticae 1 1977, 1–17, 147–167

    Google Scholar 

  6. Salwicki, A., Applied algorithmic logic, Proc. MFCS'77 inLect. Notes in Comp.Sci. 53, Springer Verlag, 1977, 122–134

    Google Scholar 

  7. Spitzen, J., Wegbreit, B., The verification and synthesis of data structures, Acta Inf. 4 1975, 127–144

    Article  Google Scholar 

  8. Goguen, J.A., Thatcher, J.W., Wagner, E.G., An initial algebra approach to the specification, correctness and implementation of abstract data types, in Current Trends in Programming Methodology 4, ed by R.Yeh

    Google Scholar 

  9. Tue, Nguen, A comparison of different implementations of dictionary and priority queue theories, in polish, University of Warsaw, 1978

    Google Scholar 

  10. Salwicki, A., On Algorithmic theory of stacks, to appear in Fundamenta Informaticae

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute PAS, Sniadeckich 8, P.O.B. 137, 00-950, Warsaw

    Andrzej Salwicki

Authors
  1. Andrzej Salwicki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salwicki, A. (1978). On algorithmic theory of stacks. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_93

Download citation

  • DOI: https://doi.org/10.1007/3-540-08921-7_93

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08921-6

  • Online ISBN: 978-3-540-35757-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation