On Flowchart Theories. I. The Deterministic Case

[1]  Zoltán Ésik,et al.  Independence of the Equational Axioms for Iteration Theories , 1988, J. Comput. Syst. Sci..

[2]  Virgil Emil Cazanescu.  On Context-Free Trees , 1985, Theor. Comput. Sci..

[3]  Zoltán Ésik,et al.  Axiomatizing Schemes and Their Behaviors , 1985, J. Comput. Syst. Sci..

[4]  John W. Backus.  From Function Level Semantics to Program Transformation and Optimization , 1985, TAPSOFT, Vol.1.

[5]  Zoltán Ésik,et al.  Algebras of Iteration Theories , 1983, J. Comput. Syst. Sci..

[6]  Bruno Courcelle,et al.  Fundamental Properties of Infinite Trees , 1983, Theor. Comput. Sci..

[7]  David B. Benson,et al.  Deterministic and Nondeterministic Flowchart Interpretations , 1983, J. Comput. Syst. Sci..

[8]  C. C. Elgot.  Monadic Computation And Iterative Algebraic Theories , 1982 .

[9]  C. C. Elgot,et al.  An Equational Axiomatization of the Algebra of Reducible Flowchart Schemes , 1982 .

[10]  Joseph E. Stoy,et al.  Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[11]  Stephen L. Bloom,et al.  Vector Iteration in Pointed Iterative Theories , 1980, SIAM journal on computing (Print).

[12]  Stephen L. Bloom,et al.  Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation , 1980, SIAM J. Comput..

[13]  M. Arbib,et al.  Partially additive categories and flow-diagram semantics☆ , 1980 .

[14]  Susanna Ginali,et al.  Regular Trees and the Free Iterative Theory , 1979, J. Comput. Syst. Sci..

[15]  John W. Backus,et al.  Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[16]  C. C. Elgot,et al.  On the algebraic structure of rooted trees , 1978 .

[17]  Stephen L. Bloom,et al.  On the Algebraic Atructure of Rooted Trees , 1978, J. Comput. Syst. Sci..

[18]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[19]  Joseph A. Goguen,et al.  Rational algebraic theories and fixed-point solutions , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[20]  Joseph A. Goguen,et al.  Some Fundamentals of Order-Algebraic Semantics , 1976, MFCS.

[21]  Stephen L. Bloom,et al.  The Existence and Construction of Free Iterative Theories , 1976, J. Comput. Syst. Sci..

[22]  Calvin C. Elgot,et al.  Structured Programming With and Without go to Statements , 1976, IEEE Transactions on Software Engineering.

[23]  Sheila A. Greibach,et al.  Theory of Program Structures: Schemes, Semantics, Verification , 1976, Lecture Notes in Computer Science.

[24]  S. Rao Kosaraju,et al.  Analysis of structured programs , 1973, STOC.

[25]  Robert W. Floyd,et al.  Notes on Avoiding "go to" Statements , 1971, Information Processing Letters.

[26]  Calvin C. Elgot.  Algebraic theories and program schemes , 1971, Symposium on Semantics of Algorithmic Languages.

[27]  F. W. Lawvere,et al.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

[28]  A. Cushny.  Erratum and corrigendum , 1901 .