Partially supported by an Alexander von Humboldt Fellowship.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S.L. Bloom and Zoltán Ésik. Matrix and matricial iteration theories, part I. To appear.
S.L. Bloom and Zoltán Ésik. Matrix and matricial iteration theories, part II. To appear.
S.L. Bloom and Z. Ésik. Varieties of iteration theories. SIAM Journal of Computing, 17(5):939–966, 1988.
S.L. Bloom and Z. Ésik. Equational logic of circular data type specification. Theoretical Computer Science, 63(3):303–331, 1989.
S.L. Bloom, Z. Ésik, and D. Taubner. Iteration theories of synchronization trees. Information and Computation, to appear.
S.L. Bloom, C.C. Elgot, and J.B. Wright. Solutions of the iteration equation and extensions of the scalar iteration operation. SIAM Journal of Computing, 9(1):26–45, 1980.
S.L. Bloom, C.C. Elgot, and J.B. Wright. Vector iteration in pointed iterative theories. SIAM Journal of Computing, 9(3):525–540, 1980.
S.L. Bloom and E.G. Wagner. Many sorted theories and their algebras. In Algebraic Methods in Semantics. Cambridge University Press.
V.E. Cazanescu and Gh. ŞtefĂnescu. Towards a new algebraic foundation of flowchart system theory. Research Report 43, Institute of Mathematics, Institute for Scientific and Technical Creation, Bucharest, Romania, 1987.
B. Courcelle and M. Nivat. Algebraic families of interpretations. In 17th IEEE Symp. on Foundations of Computing, 1976.
Z. Ésik. Identitites in iterative and rational theories. Computational Linguistics and Computer Languages, 14:183–207, 1980.
Z. Ésik. Algebras of iteration theories. Journal of Computer and System Science, 27(2):291–303, 1983.
Z. Ésik. A note on the axiomatization of iteration theories. Acta Cybernetica, 1990. To appear.
J. Goguen, J. Thatcher, E. Wagner, and J. Wright. Initial algebra semantics and continuous algebras. Journal of the Association of Computing Machinery, (24):68–95, 1977.
I. Guessarian Algebraic Semantics. Lecture Notes in Computer Science, 99, 1981.
H. Herrlich and G.E. Strecker. Category Theory. Allyn and Bacon, 1973.
F.W. Lawvere. Functorial semantics of algebraic theories. Proceedings of the National Academy of Sciences USA, 50:869–873, 1963.
Evelyn Nelson. Iterative algebras. Technical report, McMaster University, 1981.
M. Nivat. On the interpretation of recursive polyadic program schemes. Symposia Mathematica, 15:255–281, 1975.
G. StefĂnescu. On flowchart theories: Part I. The deterministic case. Journal of Computer and System Science, (35):163–191, 1987.
G. StefĂnescu. On flowchart theories: Part II. The nondeterministic case. Theoretical Computer Science, (52):307–340, 1987.
Jerzy Tiuryn. Fixed points and algebras with infinitely long expressions, I. regular algebras. Fundamenta Informatica, 2(1):103–127, 1978.
Jerzy Tiuryn. Unique fixed points vs. least fixed points. Theoretical Computer Science, 12(3):229–254, 1980.
E.G. Wagner. Algebras, polynomials and programs. Theoretical Computer Science, 70:3–34, 1990.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bloom, S.L., Ésik, Z. (1991). Iteration algebras extended abstract. In: Abramsky, S., Maibaum, T.S.E. (eds) TAPSOFT '91. CAAP 1991. Lecture Notes in Computer Science, vol 493. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53982-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-53982-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53982-7
Online ISBN: 978-3-540-46563-8
eBook Packages: Springer Book Archive