Skip to main content

Unique fixed points vs. least fixed points

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1979)

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

Included in the following conference series:

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. ADJ (Authors: Goguen, J.A. / Thatcher, J.W. / Wagner, E.G. /Wright, J.B.) Some fundamentals of order-algebraic semantics Proceedings MFCS '76, Lecture Notes in Computer Science, No. 45, ed. Mazurkiewicz, A., Springer Verlag, 1976

    Google Scholar 

  2. ADJ Initial algebra semantics and continuous algebras J.A.C.M. 24, (68–95), 1977

    Google Scholar 

  3. Bloom, S.L. / Elgot, C.C. / Tindell, R. The algebraic structure of rooted trees J.C.S.S. 16, (362–399), 1978

    Google Scholar 

  4. Elgot, C.C. Monadic computation and iterative algebraic theories Logic Colloquium '73 eds. Rose, H.E. / Shepherdson, J.C.,North-Holland Publishing Company, 1975

    Google Scholar 

  5. Ginali, S. Ph. D. Dissertation, University of Chicago, 1976

    Google Scholar 

  6. Lawvere, F.W. Functional semantics of algebraic theories Proc. Nat. Acad. Sci. 50, (869–872), 1963

    Google Scholar 

  7. MacLane, S. Categories for the working mathematician Springer Verlag, 1971

    Google Scholar 

  8. Nivat, M. Languages algebraic sur le magma libre et semantique des schemas de programme Automata Languages and Programming (293–308), ed. Nivat, M. North-Holland Publishing Company, 1973

    Google Scholar 

  9. Scott, D. The lattice of flow diagroms Lecture Notes in Mathematics, No. 188, Springer Verlag, 1971

    Google Scholar 

  10. Tiuryn, J. Fixed points and algebras with infinitely long expressions Part I. Regular algebras Proceedings MFCS '77, Lecture Notes in Computer Science No. 53, ed. Gruska, J., Springer Verlag, 1977 The full version will appear in Fundamente Informaticae

    Google Scholar 

  11. Tiuryn, J. Fixed points and algebras with infinitely long expressions Part II. μ-clones of regular algebras Proceedings FCT '77, Lecture Notes in Computer Science No. 56, ed. Karpiński, M., Springer Verlag, 1977 The full version will appear in Fundamenta Informaticae

    Google Scholar 

  12. Tiuryn, J. On a connection between regular algebras and rational algebraic theories Proceedings of the second Workshop on Categorical and Algebraic Methods in Computer Science and System Theory, Dortmund, 1978

    Google Scholar 

  13. Tiuryn, J. Continuity problems in the power-set algebra of infinite trees To be presented at the Forth Workshop on Trees in Algebra and Programming, Lille, February 1979

    Google Scholar 

  14. Tiuryn, J. Unique fixed points vs. least fixed points Schriften zur Informatik und Angewandten Mathematik, RWTH Aachen, Bericht Nr. 49, November 1978

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hermann A. Maurer

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tiuryn, J. (1979). Unique fixed points vs. least fixed points. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-09510-1_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09510-1

  • Online ISBN: 978-3-540-35168-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics