Preview
Unable to display preview. Download preview PDF.
References
M. A. ARBIB and E. G. MANES, Partially additive categories and flow-diagram semantics, J. Algebra 62(1980), 203–227.
J. W. BACKUS, Can programming be liberated from the von Neumann style? A functional style and its algebra of program, Comm. ACM 21(1978), 613–641; see also: From function level semantics to program transformation and optimization, in "Mathematical Foundations of Software Development," Lecture Notes in Computer Science 185, pp.60–91, Springer-Verlag, Berlin — Heidelberg — New York — Tokio, 1985.
S. L. BLOOM, C. C. ELGOT and R. TINDELL, On the algebraic structure of rooted trees, J. Comput. System Sci. 16(1978), 228–242.
S. L. BLOOM, C. C. ELGOT and J. B. WRIGHT, Solutions of the iteration equations and extensions of the scalar iteration operation, SIAM J. Comput. 9(1980), 25–45; Vector iteration in pointed iterative theories, SIAM J. Comput. 9(1980), 525–540.
V. E. CĂZĂNESCU, On context-free trees, to appear in Theor. Comput. Sci. (1985).
V. E. CĂZĂNESCU and C. UNGUREANU, Again on advice on structuring compilers and proving them correct, INCREST Preprint Series in Mathematics, No.75/1982.
C. C. ELGOT, Monadic computation and iterative algebraic theories, in "Logic Colloquium" (H. E. Rose and J. C. Shepherdson, Eds.), pp.175–230, North-Holland, Amsterdam, 1975.
C. C. ELGOT, Structured programming with and without GO TO statements, IEEE Trans. Soft. Eng. SE-2(1976), 41–53.
C. C. ELGOT, Matricial theories, J. Algebra 42(1976), 391–421.
Z. ESIK, Identities in iterative and rational theories, Comput. Linguistic and Comput. Language XIV (1980), 183–207.
S. GINALI, Regular trees and free iterative theory, J. Comput. System Sci. 18(1979), 228–242.
A. SALOMAA, Two complete axiom systems for the algebra of regular events, J. Assoc. Comput. Mach. 13(1966), 158–169.
Gh. ŞTEFĂNESCU, On flowchart theories I, INCREST Preprint Series in Mathematics, No.39/1984; A completion of "On flowchart theories I," idem No.7/1985; and On flowchart theories II (nondeterministic case), idem No.32/1985.
J. B. WRIGHT, J. W. THATCHER, E. G. WAGNER and J.A.GOGUEN, Rational algebraic theories and fixed-point solution, in "Proceedings 17th IEEE Symposium on Foundations of Computer Science, Houston, Texas (1976)," pp.147–158.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Ştefănescu, G. (1986). An algebraic theory of flowchart schemes. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022659
Download citation
DOI: https://doi.org/10.1007/BFb0022659
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16443-2
Online ISBN: 978-3-540-39783-0
eBook Packages: Springer Book Archive