Algebraic Characterization of Reducible Flowcharts

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Jeffrey D. Ullman,et al.  Flow Graph Reducibility , 1972, SIAM J. Comput..

[3]  Jeffrey D. Ullman,et al.  Characterizations of Reducible Flow Graphs , 1974, JACM.

[4]  Rod M. Burstall,et al.  The algebraic theory of recursive program schemes , 1974, Category Theory Applied to Computation and Control.

[5]  C. C. Elgot.  Structured Programming With and Without GO TO Statements , 1976, IEEE Trans. Software Eng..

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

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

[8]  Jean H. Gallier.  Semantics and correctness of classes of deterministic and nondeterministic recursive programs , 1978 .

[9]  James W. Thatcher,et al.  More on Advice on Structuring Compilers and Proving them Correct , 1979, Theor. Comput. Sci..

[10]  C. C. Elgot,et al.  A semantically meaningful characterization of reducible flowchart schemes , 1979 .

[11]  Jean H. Gallier.  Recursion Schemes and Generalized Interpretations (Extended Abstract) , 1979, ICALP.

[12]  Jean H. Gallier,et al.  Recursion-Closed Algebraic Theories , 1981, J. Comput. Syst. Sci..

[13]  Jean H. Gallier,et al.  Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II , 1981, Theor. Comput. Sci..

[14]  Hartmut Schmeck.  Zur algebraischen Charakterisierung reduzierbarer Flussdiagramme , 1981 .

[15]  Hartmut Schmeck,et al.  Algebraic Semantics of Recursive Flowchart Schemes , 1982, Inf. Control..

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

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

[18]  Hartmut Schmeck.  Algebraic Semantics of Recursive Flowchart Schemes , 1983, Inf. Control..