Skip to main content

Structured programmability of iterative algorithms

  • Theory Of Programs
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science (MFCS 1974)

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

  • 2010 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. MAZURKIEWICZ, A. Theory of Programs and Algorithms. Lecture Notes. MFCS Semester. Stefan Banach Mathematical Center, Warsaw 1974.

    Google Scholar 

  2. ASHCROFT, E.; MANNA, Z. The Translation of "goto" Programs into "while" Programs. Proc. IFIP Conf. 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Blikle

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Irlik, J. (1975). Structured programmability of iterative algorithms. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_697

Download citation

  • DOI: https://doi.org/10.1007/3-540-07162-8_697

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07162-4

  • Online ISBN: 978-3-540-37492-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics