Advertisement

Fixed-points and algebras with infinitely long expressions, I

  • J. Tiuryn
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    ADJ (Authors: J.A.Goguen, J.W.Thatcher, E.G.Wagner, J.B.Wright). Rational algebraic theories and fixed-point solutions (Extended abstract). IBM Research Report, RC 6116, 1976.Google Scholar
  2. 2.
    ADJ. Some fundamentals of order — algebraic semantics. In: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 45, pp.153–168, Springer Verlag Berlin, 1976.Google Scholar
  3. 3.
    Goguen, J.A. and Thatcher, J.W. Initial algebra semantics. IEEE Conf. Rec. SWAT 15(1974), 63–77.Google Scholar
  4. 4.
    Gratzer, G. Universal algebra. D. Van Nostrand Co. 1968.Google Scholar
  5. 5.
    Scott, D. The lattice of flow diagrams. In:Symposium on Semantics of Algorithmic Languages, Lecture Notes in Mathematics, vol. 182, pp. 311–366, Springer Verlag, 1971.Google Scholar
  6. 6.
    Tarski, A. A lattice theoretical fixpoint theorem and its applications, Pacific J. of Math. 5(1955) 285–309.Google Scholar
  7. 7.
    Tiuryn, J. Fixed — points and algebras with infinitely long. expressions. Part I — regular algebras. To appear.Google Scholar
  8. 8.
    Tiuryn, J. Fixed — points and algebras with infinitely long expressions. Part II — μ-clones of regular algebras. To appear.Google Scholar
  9. 9.
    Wand, M. A concrete approach to abstract recursive definitions. In: Automata Languages and Programming, pp.331–341, North-Holland Publishing C, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • J. Tiuryn
    • 1
  1. 1.Institute of MathematicsWarsaw UniversityWarsawPoland

Personalised recommendations