Abstract
The axioms of iteration 2-theories capture the equational properties of iteration in conjunction with horizontal and vertical composition in all algebraically complete categories. We give a concrete representation of the free iteration 2-theory generated by a 2-signature.
Partially supported by the US-Hungarian Joint Fund under grant number 351.
Partially supported by a grant of the National Foundation for Scientific Research of Hungary, the Alexander von Humboldt Foundation, and by the US-Hungarian Joint Fund under grant number 351.
Partially supported by the EEC-HCM project EXPRESS.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aho and J. Ullman. The theory of parsing, translation, and compiling. Vol. I: Parsing. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Inc., Englewood Cliffs, N. J., 1972.
S.L. Bloom, C.C. Elgot and J.B. Wright. Solutions of the iteration equation and extension of the scalar iteration operation. SIAM J. Computing, 9(1980), 26–45.
S.L. Bloom, C.C. Elgot and J.B. Wright. Vector iteration in pointed iterative theories. SIAM J. Computing, 9(1980), 525–540.
S.L. Bloom and Z. ésik. Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1993.
F. Borceux. Handbook of Categorical Algebra 1, Basic Category Theory. Encyclopedia of Mathematics and its Applications, Vol. 50, Cambridge University Press, 1994.
C.C. Elgot, S.L. Bloom and R. Tindell. On the algebraic structure of rooted trees. Journal of Computer and System Sciences, 16(1978), 362–399.
Z. ésik. Identities in iterative and rational algebraic theories. Computational Linguistics and Computer Languages, 14(1980), 183–207.
Z. ésik. The independence of the equational axioms of iteration theories. Journal of Computer and System Sciences, 36(1988), 66–76.
Z. ésik. Completeness of Park induction. Theoretical Computer Science, 177 (1997) 217–283.
Z. ésik. Group axioms for iteration. To appear.
Z. ésik and A. Labella. Equational properties of iteration in algebraically complete categories. in: proc. conf. Mathematical Foundations of Computer Science '96, LNCS 1113, Springer-Verlag, 1996, 336–347.
F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
P.F. Hoogendijk. Mathematics of Program Construction. 2nd International Conference, June/July 1992. LNCS 669, pages 163–190. Springer Verlag, 1993.
P. Freyd. Algebraically complete categories. in: Proc. of Category Theory, Como 1990, LNM vol. 1488, Springer-Verlag, 1991, 95–104.
P. Freyd. Remarks on algebraically compact categories. in: Applications of Categories in Computer Science, London Math. Society Lecture Notes Series, vol. 77, Cambridge University Press, 1992, 95–106.
S. Ginali. Regular trees and the free iterative theory. Journal of Computer and System Sciences, 18(1979), 228–242.
G.M. Kelly and R. Street. Review of the elements of 2-categories. in: LNM 420, Springer-Verlag, 1974, 76–103.
J. Lambek. A fixed point theorem for complete categories. Mathematische Zeitschrift, 103(1968), 151–161.
G. Lallement. Semigroups and Combinatorial Applications. Wiley-Interscience, 1979.
F.L. Lawvere. Functorial semantics of algebraic theories. Proceedings of the National Academy of Sciences USA, 50(1963), 869–873.
D. Park. Concurrency and automata on infinite sequences. in: proc. conf. Gesellschaft für Informatik, LNCS 104, Springer-Verlag, 1981, 167–183.
J.B. Wright, J. Thatcher, J. Goguen, and E.G. Wagner. Rational algebraic theories and fixedpoint solutions. In Proc. 17th IEEE Symposium on Foundations of Computing, 1976, 147–158.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bloom, S.L., Labella, A., ésik, Z., Manes, E.G. (1997). Iteration 2-theories: Extended Abstract . In: Johnson, M. (eds) Algebraic Methodology and Software Technology. AMAST 1997. Lecture Notes in Computer Science, vol 1349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000461
Download citation
DOI: https://doi.org/10.1007/BFb0000461
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63888-9
Online ISBN: 978-3-540-69661-2
eBook Packages: Springer Book Archive