Skip to main content
SpringerLink
Log in

The equational logic of iterative processes

  • Conference paper
  • First Online:
Book cover Fundamentals of Computation Theory (FCT 1989)

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

Included in the following conference series:

Abstract

We describe a formalization of the equational logic of flowchart algorithms which has been shown to apply to a large class of other iterative processes connected with the theory of computation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Adamek. Free algebras and automata realizations in the language of category theory. Comm. Math. Univer. Carolinae, pages 589–602, 1974.

    Google Scholar 

  2. M.A. Arbib and E. Manes. Partially additive categories and flow-diagram semantics. J. Algebra, (1):203–227, 1980.

    Article  Google Scholar 

  3. S.L. Bloom and Z. Ésik. Floyd-Hoare logic in iteration theories. Submitted for publication.

    Google Scholar 

  4. S.L. Bloom and Z. Ésik. Varieties of iteration theories. SIAM Journal of Computing, 17(5):939–966, 1988.

    Article  Google Scholar 

  5. S.L. Bloom and Z. Ésik. Equational logic of circular data type specification. Theoretical Computer Science, 63(3):303–331, 1989.

    Article  Google Scholar 

  6. S.L. Bloom and Zoltán Ésik. Matrix and matricial iteration theories. Submitted for publication.

    Google Scholar 

  7. Stephen L. Bloom. A note on guarded theories. Lecture Notes in Computer Science. Springer-Verlag. To appear.

    Google Scholar 

  8. John Conway. Regular Algebras and Finite Machines. Chapman and Hall, London, 1971.

    Google Scholar 

  9. Calvin C. Elgot. Monadic computation and iterative algebraic theories. In J. C. Shepherson, editor, Logic Colloquium 1973, Studies in Logic, Volume 80. North Holland, Amsterdam, 1975.

    Google Scholar 

  10. Calvin C. Elgot. Structured programming with and without goto statements. IEEE Transactions on Software Engineering SE-2, (1):41–54, 1976.

    Google Scholar 

  11. Z. Ésik. Identities in iterative and rational theories. Computational Linguistics and Computer Languages, 14:183–207, 1980.

    Google Scholar 

  12. Gh. Ştefanescu. On flowchart theories: Part I. The deterministic case. Journal of Computers and System Science, (35):163–191, 1987.

    Article  Google Scholar 

  13. D. Lehmann and M.B. Smyth. Algebraic specification of data types: a synthetic approach. Mathematical Systems Theory, 14:97–139, 1981.

    Article  Google Scholar 

  14. E. G. Manes. Assertional categories. Volume 298 of Lecture Notes in Computer Science, pages 85–120. Springer-Verlag, 1987.

    Google Scholar 

  15. M.B. Smyth and G.D. Plotkin. The category theoretic solution of recursive domain equations. SIAM Journal of Computing, 11(4):761–783, 1982.

    Article  Google Scholar 

  16. E.G. Wagner, J.W. Thatcher, and J.B. Wright. Programming languages as mathematical objects. Volume 64 of Lecture Notes in Computer Science, pages 84–101. Springer-Verlag, 1978.

    Google Scholar 

  17. Klaus Weihrauch. Computability. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1987.

    Google Scholar 

  18. J.B. Wright, J.W. Thatcher, J. Goguen, and E.G. Wagner. Rational algebraic theories and fixed-point solutions. Proceedings 17th IEEE Symposium on Foundations of Computing, pages 147–158, Houston, Texas, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Stevens Institute of Technology, 07030, Hoboken, NJ

    Stephen L. Bloom

Authors
  1. Stephen L. Bloom
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bloom, S.L. (1989). The equational logic of iterative processes. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation