Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1994: Mathematical Foundations of Computer Science 1994 pp 52–67Cite as

Solving polynomial fixed point equations

  • Invited Papers
  • Conference paper
  • First Online:

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

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. K. B. Arkhangelskii and P. V. Gorshkov. Implicational axioms for the algebra of regular languages (in Russian). Doklady Akad. Nauk, USSR, ser A., 10:67–69, 1987.

    Google Scholar 

  2. S. L. Bloom and Z. Ésik. Fixed point operations on ccc's, Part I. To appear.

    Google Scholar 

  3. S. L. Bloom and Z. Ésik. Some equational laws of initiality in 2ccc's. To appear.

    Google Scholar 

  4. S. L. Bloom and Z. Ésik. Iteration algebras. International Journal of Foundations of Computer Science, 3:245–302, 1992.

    Google Scholar 

  5. S. L. Bloom and Z. Ésik. Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1993.

    Google Scholar 

  6. S. L. Bloom and Z. Ésik. Some quasi-varieties of iteration theories. In: Proceedings of Mathematical Foundations of Programming Semantics '93, LNCS, to appear.

    Google Scholar 

  7. J. C. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971.

    Google Scholar 

  8. Z. Ésik. Algebras of iteration theories. Journal of Computer and System Sciences, 27:291–303, 1983.

    Google Scholar 

  9. Z. Ésik. Independence of the equational axioms of iteration theories. Journal of Computer and System Sciences, 36:66–76, 1988.

    Google Scholar 

  10. Z. Ésik and L. Bernátsky. Scott induction and equational proofs. To appear.

    Google Scholar 

  11. J. Gallier. N-rational algebras: Parts I and II. SIAM Journal of Computing, 13:750–775, 776–794, 1984.

    Google Scholar 

  12. J. Goguen, J. Thatcher, E. Wagner, and J. Wright. Initial algebra semantics and continuous algebras. Journal of the Association for Computing Machinery, 24:68–95, 1977.

    Google Scholar 

  13. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. In Proc. IEEE Symposium on Logic in Computer Science, pages 214–225, 1991.

    Google Scholar 

  14. D. Krob. Complete systems of B-rational identities. Theoretical Computer Science, 89:207–343, 1991.

    Google Scholar 

  15. E. G. Manes. Predicate Transformer Semantics. Cambridge Tracts in Theoretical Computer Science 31. Cambridge University Press, 1992.

    Google Scholar 

  16. E. Nelson. Iterative algebras. Theoretical Computer Science, 25:67–94, 1983.

    Google Scholar 

  17. G. Plotkin. Domains. Department of Computer Science, University of Edinburgh, 1983.

    Google Scholar 

  18. J. Tiuryn. Fixed points and algebras with infinitely long expressions, Parts I and II, Fundamenta Informaticae 2:103–127, 1978, 317–335, 1979.

    Google Scholar 

  19. J. Tiuryn. Unique fixed points vs. least fixed points. Theoretical Computer Science, 12:229–254, 1980.

    Google Scholar 

  20. G. Winskel. The Formal Semantics of Programming Languages. MIT Press, 1993.

    Google Scholar 

  21. J. B. Wright, J. W. Thatcher, J. Goguen, and E. G. Wagner. Rational algebraic theories and fixed-point solutions. In 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

  2. Department of Computer Science, A. József University, Szeged, Hungary

    Zoltán Ésik

Authors
  1. Stephen L. Bloom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Branislav Rovan Peter Ruzička

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bloom, S.L., Ésik, Z. (1994). Solving polynomial fixed point equations. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-58338-6_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58338-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation