The equational logic of fixed points

Theoretical Computer Science

Volumn 179, Issue 1-2, 1997, Pages 1-60

  Bloom, Stephen L ^a   Ésik, Zoltán ^b  

^a Stevens Institute of Technology   (United States)

^b UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; ITERATIVE METHODS; MATHEMATICAL MODELS; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

AXIOMATIZATION; FIXED POINTS;

FORMAL LOGIC;

EID: 0031165726     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00248-4     Document Type: Review

References (175)

1. C. Aarts, R. Backhouse, E. Boiten, H. Doornbos, N. van Gasteren, R. van Geldrop, P. Hoogendijk, E. Voermans and J. van der Woude, Fixed-point calculus, Inform. Process. Lett. 53 (1995) 131-136.
2. S. Abian and A.B. Brown, A theorem on partially ordered sets with applications to fixed-point theorems, Canad. J. Math. 13 (1961) 78-83.
3. L. Aceto, W. Fokkink and A. Ingolfsdottir, A menagerie of non-finitely based process semantics over BPA*, draft paper, 1996.
4. J. Adámek, Free algebras and automata realizations in the language of category theory, Comm. Math. Unive. Carolinae 15 (1974) 589-602.
5. J. Adámek and V. Koubek, Least fixed-point of a functor, J. Comput. System Sci. 19 (1979) 163-178.
6. J. Adámek and V. Trnkova, Automata and Algebras in Categories (Kluwer Academic Publishers, Dordrecht, 1990).
7. F. Alessi, P. Baldan, G. Belle and J.J.M.M. Rutten, Solutions of functorial and non-functorial metric domain equations, Electronic Notes Theoret. Comput. Sci. 1 (1995).
8. P. America and J.J.M.M. Rutten, Solving reflexive domain equations in a category of complete metric spaces, J. Comput. System Sci. 35 (1989) 343-375.
9. H. Andréka, On the representation of distributive semilattice-ordered semigroups, Tech. Report, Math. Inst., Hungarian Academy of Science, September 1988.
10. H. Andréka, Representations of distributive semilattice-ordered semigroups with binary relations, Algebra Universalis 28 (1991) 12-25.
11. M.A. Arbib, Free dynamics and algebraic semantics, in: Mathematical Foundations of Computer Science'76, Lecture Notes in Computer Science, Vol. 56 (Springer, Berlin, 1977) 212-227.
12. M.A. Arbib and E. Manes, Partially additive categories and flow-diagram semantics, J. Algebra 62 (1980) 203-227.
13. K.V. Archangelsky, A new finite complete solvable quasi-equational calculus for the algebra of regular events, Thesis, University of Kiev, 1990.
14. K.V. Archangelsky and P.V. Gorshkov, Implicational axioms for the algebra of regular languages, Dokl. Akad. Nauk USSR Ser. A 10 (1987) 67-69 (in Russian).
15. A. Arnold and M. Nivat, The metric space of infinite trees, Fundam. Inform. 4 (1980) 445-476.
16. A. Arnold and M. Nivat, Metric interpretations of infinite trees and semantics of non deterministic recursive programs, Theoret. Comput. Sci. 11 (1980) 181-205.
17. R. Backhouse, M. Birjsterveld, R. van Geldrop and J. van der Woude, Categorical fixed-point calculus, in: Category Theory and Computer Science'95, Lecture Notes in Computer Science, Vol. 953 (Springer, Berlin, 1995) 159-179.
18. R.C. Backhouse and B.A. Carre, Regular algebra applied to path-finding problems, J. Inst. Math. Appl. 15 (1975) 161-186.
19. J.C.M. Baeten and W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, Vol. 18 (Cambridge Univ. Press, Cambridge, 1990).
20. E.E. Bainbridge, P.J. Freyd, A. Scedrov and P.J. Scott, Functorial polymorphism, in: Proc. Inst. on the Logical Foundations of Functional Programming, Austin, TX, 1987.
21. J.W. de Bakker and J.-J. Ch. Meyer, Order and metric in the stream semantics of elemental concurrency, Acta Inform. 24 (1987) 87-112.
22. J.W. de Bakker and J.I. Zucker, Processes and the denotational semantics of concurrency, Inform. and Controls 54 (1982) 70-120.
23. S. Banach, Sur les operations dans les ensembles abstraits et leur applications aux équations intégrales, Fundam. Math. 22 (1922) 133-181.
24. M. Barr, Fixed points in cartesian closed categories, Theoret. Comput. Sci. 70 (1990) 65-72.
25. H. Bekič, Definable operations in general algebras, and the theory of automata and flowcharts, Tech. Report, IBM Laboratory, Vienna, 1969.
26. D. Benson and J.Tiuryn, Fixed points in free process algebras, Theoret. Comput. Sci. 63 (1989) 275-294.
27. J.A. Bergstra and Gh. Stefanescu, Processes with multiple entries and exits modulo isomorphism and modulo bisimulation, preprint, 1994.
28. L. Bernátsky, S.L. Bloom, Z. Ésik and Gh. Stefanescu, Equational theories of relations and regular sets, in: Words, Combinatorics and Semigroups, Kyoto, 1992 (World Scientific, Singapore, 1994) 40-48.
29. L. Bernátsky and Z. Ésik, Semantics of flowchart programs and the free Conway theories, submitted.
30. J.A. Berstra and J.W. Klop, A complete inference system for regular processes with silent moves, in: F.R. Drake and J.K. Truss, eds., Logic Colloquium'86 (Elsevier, Amsterdam, 1988) 21-88.
31. S.L. Bloom, Iterative and metric algebraic theories, Banach Center Publications 9 (1982) 209-224.
32. S.L. Bloom, C.C. Elgot and J.B. Wright, Solutions of the iteration equation and extension of the scalar iteration operation, SIAM J. Comput. 9 (1980) 26-45.
33. S.L. Bloom, C.C. Elgot and J.B. Wright, Vector iteration of pointed iterative theories, SIAM J. Comput. 9 (1980) 525-540.
34. S.L. Bloom and Z. Ésik, Axiomatizing schemes and their behaviors, J. Comput. System Sci. 31 (1985) 375-393.
35. S.L. Bloom and Z. Ésik, Varieties of iteration theories, SIAM J. Comput. 17 (1988) 939-966.
36. S.L. Bloom and Z. Ésik, Equational logic of circular data type specification, Theoret. Comput. Sci. 63 (1989) 303-331.
37. S.L. Bloom and Z. Ésik, Equational axioms for regular sets, Math. Struct. Comput. Sci. 3 (1993) 1-24.
38. S.L. Bloom and Z. Ésik, Iteration Theories: The Equational Logic of Iterative Processes, EATCS Monographs on Theoretical Computer Science (Springer, Berlin, 1993).
39. S.L. Bloom and Z. Ésik, Matrix and matricial iteration theories, Part I, J. Comput. System Sci. 46 (1993) 381-408.
40. S.L. Bloom and Z. Ésik, Matrix and matricial iteration theories, Part II, J. Comput. System Sci. 46 (1993) 409-439.
41. S.L. Bloom and Z. Ésik, Some quasi-varieties of iteration theories, in: A. Melton, M. Mislove, D. Schmidt, S. Brookes and M. Main, eds., Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, Vol. 802 (Springer, Berlin, 1993) 378-409.
42. S.L. Bloom and Z. Ésik, Iteration algebras of finite state process behaviors, unpublished manuscript, January 1994. Available by anonymous ftp to menger.eecs.stevens-tech.edu in the directory /pub/bloom/papers/processes.
43. S.L. Bloom and Z. Ésik, Solving polynomial fixed-point equations, in: Mathematical Foundations of Computer Science'94, Lecture Notes in Computer Science, Vol. 841 (Springer, Berlin, 1994) 52-67.
44. S.L. Bloom and Z. Ésik, Some equational laws of initiality in 2CCC's, Internat. J. Found. Comput. Sci. 6 (1995) 95-118.
45. S.L. Bloom and Z. Ésik, Equational properties of fixed-points in ccc's, Part 1, Theoret. Comput. Sci. 155 (1996) 1-38.
46. S.L. Bloom, Z. Ésik and Gh. Stefanescu, Notes on equational theories of relations, Algebra Universalis 33 (1995) 98-106.
47. S.L. Bloom, Z. Ésik and D. Taubner, Iteration theories of synchronization trees, Inform. Comput. 102 (1993) 1-55.
48. S.L. Bloom, S. Ginali and J. Rutledge, Scalar and vector iteration, J. Comput. System Sci. 14 (1977) 251-256.
49. S.L. Bloom, J.W. Thatcher, E.G. Wagner and J.B. Wright, Recursion and iteration in continuous theories, the M-construction, J. Comput. System Sci. 27 (1983) 148-164.
50. M. Boffa, Une remarque sur les systemes complets d'identites rationelles, Theoret. Inform. Appl. 24 (1990) 419-423.
51. M. Boffa, Une condition impliquant toutes les identites rationelles, Theoret. Inform. Appl. 29 (1995) 515-518.
52. A. Bounier-Rigny and D. Krob, A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring, Theoret. Comput. Sci. 134 (1994) 27-50.
53. V.E. Cazanescu and Gh. Stefanescu, Feedback, iteration and repetition, Report No. 42, Mathematical Institute, Romanian Academy of Science, 1988.
54. V.E. Cazanescu and Gh. Stefanescu, Towards a new algebraic foundation of flowchart scheme theory, Fundam. Inform. 13 (1990) 171-210.
55. V.E. Cazanescu and Gh. Stefanescu, A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization, Theoret. Comput. Sci. 99 (1992) 1-63.
56. P. Cohn, Universal Algebra (Harper and Row, New York, 1965).
57. J.C. Conway, Regular Algebra and Finite Machines (Chapman & Hall, London, 1971).
58. F. Corradini, R. De Nicola and A. Labella, Models of nondeterministic regular expressions, Draft Paper, 1996.
59. B. Courcelle, Fundamental properties of infinite trees, Theoret. Comput. Sci. 25 (1983) 95-169.
60. B. Courcelle and I. Guessarian, On some classes of interpretations, J. Comput. Systems Sci. 17 (1978) 388-413.
61. B. Courcelle, G. Kahn and J. Vuillemin, Algorithmes d'equivalence at de reduction a des expressions minimales dans une classe d'equations recursives simples, in: Proc. Automata, Languages and Programming'74 Lecture Notes in Computer Science, Vol. 14 (Springer, Berlin, 1974) 200-213.
62. B. Courcelle and M. Nivat, Algebraic families of interpretations, in: Proc. IEEE Symp. on Foundations of Computer Science (1976) 137-146.
63. S. Crvenkovič and R.Sz. Madarász, On Kleene algebras, Theoret. Comput. Sci. 108 (1993) 17-24.
64. P. Dorondeau and L. Kott, A formal proof system for infinitary rational expressions, in: Automata and Infinite Words, Lecture Notes in Computer Science, Vol. 192 (Springer, Berlin, 1984) 68-80.
65. S. Eilenberg, Automata, Languages and Machines, Vols. A and B (Academic Press, New York, 1974, 1976).
66. S. Eilenberg, The category script c sign, unpublished handwritten manuscript.
67. C.C. Elgot, Monadic computation and iterative algebraic theories, in: J.C. Shepherdson, ed., Logic Coll. 1973, Studies in Logic, Vol. 80 (North-Holland, Amsterdam, 1975) 175-230.
68. C.C. Elgot, Matricial theories, J. Algebra 42 (1976) 391-421.
69. C.C. Elgot, Structured programming with and without goto statements, IEEE Trans Software Eng. SE-2 (1976) 41-53 (Corrigendum, p. 232).
70. C.C. Elgot, Some geometrical categories associated with flowchart schemes, in: Fundamentals of Computation Theory, Lecture Notes in Computer Science, Vol. 56 (Springer, Berlin, 1977) 256-259.
71. C.C. Elgot, S.L. Bloom and R. Tindell, On the algebraic structure of rooted trees, J. Comput. System Sci. 16 (1978) 362-399.
72. Z. Ésik, Identities in iterative algebraic theories, Comput. Linguistics Comput. Languages 14 (1980) 183-207.
73. Z. Ésik, On generalized iterative algebraic theories, Comput. Linguistics Comput. Languages 15 (1982) 95-110.
74. Z. Ésik, Algebras of iteration theories, J. Comput. System Sci. 27 (1983) 291-303.
75. Z. Ésik, On the weak equivalence of Elgot's flowchart schemes, Acta Cybernet. 7 (1985) 147-154.
76. Z. Ésik, Independence of the equational axioms of iteration theories, J. Comput. System Sci. 36 (1988) 66-76.
77. Z. Ésik, A note on the axiomatization of iteration theories, Acta Cybernet. 9 (1990) 375-384.
78. Z. Ésik, Completeness of Park induction, Theoret. Comput. Sci. to appear.
79. Z. Ésik, Group axioms for iteration, submitted.
80. Z. Ésik, A proof of the Krohn-Rhodes decomposition theorem, submitted.
81. Z. Ésik and L. Bernátsky, Equational properties of Kleene algebras of relations with conversion, Theoret. Comput. Sci. 137 (1995) 237-251.
82. Z. Ésik and L. Bernátsky, Scott induction and equational proofs, in: Mathematical Foundations of Programming Semantics'95, ENTCS, Vol. 1, 1995.
83. Z. Ésik and L. Bernátsky, Independence of the group axioms for iteration, Talk Presented at MFPS '12, Boulder, Colorado, 1996.
84. Z. Ésik and A. Labella, Equational properties of iteration in algebraically complete categories, in: Mathematical Foundations of Computer Science'96, Lecture Notes in Computer Science, Vol. 1113 (Springer, Berlin, 1996) 336-347.
85. W. Fokkink and H. Zantema, Basic process algebra with iteration: completeness of its equational axioms, Comput. J. 37 (1994) 259-267.
86. P. Freyd, Algebraically complete categories, in: Category Theory, Como, 1990, Lecture Notes in Math., Vol. 1488 (Springer, Berlin, 1991) 95-104.
87. P. Freyd, Remarks on algebraically compact categories, in: Applications of Categories in Computer Science, London Math. Society Lecture Notes Series, Vol. 77 (Cambridge Univ. Press, Cambridge, 1992) 95-106.
88. J. Gallier, Recursion-closed algebraic theories, J. Comput. System Sci. 23 (1981) 69-105.
89. J. Gallier, The semantics of recursive programs with function parameters of finite types: n-rational algebras and logic of inequalities, in: Algebraic Methods in Semantics (Cambridge University Press, Cambridge, 1985) 313-362.
90. S. Ginali, Regular trees and the free iterative theory, J. Comput. System Sci. 18 (1979) 228-242.
91. S. Ginsburg and H.G. Rice, Two families of languages related to ALGOL, J. ACM 9 (1962) 350-371.
92. J. Goguen, J. Thatcher, E. Wagner and J. Wright, Initial algebra semantics and continuous algebras, J. ACM 24 (1977) 68-95.
93. J.S. Golan, The Theory of Semirings with Applications in Computer Science (Longman, New York, 1993).
94. I. Guessarian, Algebraic Semantics, Lecture Notes in Computer Science, Vol. 99 (Springer, Berlin, 1981).
95. U. Hebisch, The Kleene theorem in countably complete semirings, Bayruether Math. Schriften 31 (1990) 55-66.
96. C.A.R. Hoare, Communicating Sequential Processes (Prentice-Hall, Englewood Cliffs, NJ, 1985).
97. H.J. Hoogeboom and G. Rozenberg, Infinitary languages: basic theory and applications to concurrent systems, in: J.W. de Bakker, W.-P. de Roever and G. Gozenberg, eds., Current Trends in Concurrency, Lecture Notes in Computer Science, Vol. 224 (Springer, Berlin, 1986).
98. A.J.C. Hurkens, M. McArthur, Y.N. Moschovakis, L.S. Moss and G. Whitney, The logic of recursive equations, Draft Paper, April 1996.
99. Y.I. Ianov, The logical schemes of algorithms, in: Problems of Cybernetics, Vol. 1 (Pergamon Press, New York, 1960) 82-140.
100. H. Izumi, Y. Inagaki and N. Honda, A complete axiom system for algebra of closed-regular expressions, in: Proc. ICALP'84, Lecture Notes in Computer Science, Vol. 172 (Springer, Berlin, 1984) 260-269.
101. D. Kozen, Results on the propositional μ-calculus, Theoret. Comput. Sci. 27 (1983) 333-354.
102. D. Kozen, On Kleene algebras and closed semirings, in: Proc. MFCS '90, Lecture Notes in Computer Science, Vol. 452 (Springer, Berlin, 1990) 26-47.
103. D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, Inform. Comput. 110 (1994) 366-390.
104. D. Krob, Monoides et semi-anneaux complets, Semigroup Forum 36 (1987) 323-339.
105. D. Krob, On aperiodic semigroups, LITP Report Series, 89-76, 1989.
106. D. Krob, Matrix versions of aperiodic K-rational identities, Theoret. Inform. Appl. 25 (1991) 423-444.
107. D. Krob, Complete systems of B-rational identities, Theoret. Comput. Sci. 89 (1991) 207-343.
108. D. Krob, Models of a K-rational identity system, J. Comput. System Sci. 45 (1992) 396-434.
109. W. Kuich, The Kleene and Parikh theorem in complete semirings, in: Proc. ICALP'87, Lecture Notes in Computer Science (Springer, Berlin, 1987) 212-225.
110. W. Kuich, ω-continuous semirings, algebraic systems and pushdown automata, in: Proc. ICALP '90, Lecture Notes in Computer Science, Vol. 443 (Springer, Berlin, 1990) 103-110.
111. W. Kuich, Automata and languages generalized to ω-continuous semirings, Theoret. Comput. Sci. 79 (1991) 137-150.
112. W. Kuich and A. Salomaa, Semirings, Automata and Languages, EATCS Monographs on Theoretical Computer Science (Springer, Berlin, 1986).
113. G. Lallement, Semigroups and Combinatorial Applications (Wiley-Interscience, New York, 1979).
114. J. Lambek, A fixpoint theorem for complete categories, Math. Z. 103 (1968) 151-161.
115. F.W. Lawvere, Functorial semantics of algebraic theories, in: Proc. Natl. Academy Sci. USA 50 (1963) 869-873.
116. F.W. Lawvere, Diagonal arguments and cartesian closed categories, in: Lecture Notes in Math., Vol. 92 (Springer, Berlin, 1969) 134-145.
117. D.J. Lehmann, Algebraic structures for transitive closure, Theoret. Comput. Sci. 4 (1977) 59-76.
118. D. Lehmann and M.B. Smyth, Algebraic specification of data types: a synthetic approach, Math. Systems Theory 14 (1981) 97-139.
119. M.E. Majster-Cederbaum and F. Zetzsche, Towards a foundation for semantics in complete metric spaces, Inform. Comput. 90 (1991) 97-139.
120. E.G. Manes, Predicate Transformer Semantics (Cambridge Univ. Press, Cambridge, 1992).
121. E.G. Manes and M. Arbib, Algebraic Approaches to Program Semantics, Texts and Monographs in Computer Science (Springer, Berlin, 1986).
122. Z. Manna, Mathematical Theory of Computation (McGraw-Hill, New York, 1974).
123. G. Markowsky, Chain-complete posets and directed sets with applications, Algebra Universalis 6 (1976) 53-68.
124. R. Milner, A Calculus for Communicating Systems, Lecture Notes in Computer Science, Vol. 92 (Springer, Berlin, 1980).
125. R. Milner, A complete inference system for a class of regular behaviours, J. Comput. System Sci. 28 (1984) 439-466.
126. R. Milner, A complete axiomatization for observational congruence of finite state behaviours, Inform. Comput. 81 (1989) 227-247.
127. Y.N. Moschovakis, Abstract recursion as a foundation for the theory of algorithms, in: Proc. Logic Coll., Aachen, 1983, Lecture Notes in Math., Vol. 1104 (Springer, Berlin, 1983) 289-364.
128. Y.N. Moschovakis, The logic of functional recursion, in: Proc. Internat. Congr. for Logic; Methodology and Philosophy of Science, 1995, to appear.
129. P.S. Mulry, Categorical fixed-point semantics, Theoret. Comput. Sci. 70 (1990) 85-97.
130. K.C. Ng and A. Tarski, Relation algebras with transitive closure, Abstract 742-02-09, Notices Amer. Math. Soc. 24 (1977) A29-A30.
131. R. De Nicola and A. Labella, A completeness theorem for nondeterministic Kleene algebras, in: Proc. Conf. MFCS'94, Lecture Notes in Computer Science, Vol. 841 (Springer, Berlin, 1994) 536-545.
132. M. Nivat, On the interpretation of recursive polyadic program schemes, Istituto Nazionale di Alta Matematica Symposia Mathematica, XV (1975) 255-261.
133. D. Niwinski, On fixed-point clones, in: Proc. ICALP'86, Lecture Notes in Computer Science, Vol. 226 (Springer, Berlin, 1986) 464-473.
134. D.M.R. Park, Fixpoint induction and proofs of program properties, in: D. Michie and B. Meltzer, eds., Machine Intelligence, Vol. 5 (Edinburgh Univ. Press, Edinburgh, 1970) 59-78.
135. D.M.R. Park, Concurrency and automata on infinite sequences, in: P. Deussen, ed., Proc. GI Conf., Lecture Notes in Computer Science, Vol. 104 (Springer, Berlin, 1981) 167-183.
136. A. Pasztor and R. Statman, Scott induction and closure under ω-sups, Theoret. Comput. Sci. 45 (1986) 251-263.
137. G.D. Plotkin, Domains, Lecture Notes, Department of Computer Science, University of Edinburgh, 1983.
138. V.R. Pratt, Action logic and pure induction, in: Logics in AI: European Workshop JELIA'90, Lecture Notes in Computer Science, Vol. 478 (Springer, Berlin, 1991) 97-120.
139. A. Rabinovitch, A complete axiomatization for trace congruence of finite state behaviors, in: Proc. Mathematical Foundations of Programming Semantics'93, Lecture Notes in Computer Science, Vol. 802 (Springer, Berlin, 1994) 530-543.
140. V.N. Redko, On the determining totality of relations of an algebra of regular events, Ukrain. Mat. Z. 16 (1964) 120-126 (in Russian).
141. V.N. Redko, On the algebra of commutative events, Ukrain. Mat. Z. 16 (1964) 185-195 (in Russian).
142. I.G. Rosenberg, Maltsev algebras for universal algebra terms, in: Algebraic Logic and Universal Algebra in Computer Science, Lecture Notes in Computer Science, Vol. 425 (Springer, Berlin, 1990) 195-208.
143. J. Sakarovitch, Kleene's theorem revisited, in: Trends, Techniques and Problems in Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 281 (Springer, Berlin, 1987) 39-50.
144. A. Salomaa, Two complete axioms systems for the algebra of regular events, J. ACM 13 (1966) 158-169.
145. A. Salomaa, On regular expressions and regular canonical systems, Math. Systems Theory 2 (1968) 341-355.
146. A. Salomaa and M. Soittola, Automata Theoretic Aspects of Formal Power Series (Springer, Berlin, 1978).
147. D. Scott, The lattice of flow diagrams, in: E. Engeler, ed., Semantics of Algorithmic Languages, Lecture Notes in Math., Vol. 182 (Springer, Berlin, 1971) 311-366.
148. D. Scott, Data types as lattices, SIAM J. Comput. 5 (1976) 522-587.
149. D. Scott and J.W. De Bakker, A theory of programs, unpublished manuscript, IBM Vienna, 1969.
150. M.P. Schützenberger, On a theorem of R. Jungen, Proc. Amer. Math. Soc. 13 (1962) 885-890.
151. P. Sewell, Bisimulation is not finitely (first order) equationally axiomatisable, in: Proc. LICS'94 (1994) 62-70.
152. P. Sewell, Nonaxiomatisability of equivalences over finite state processes, Draft Paper, 1996.
153. A.K. Simpson, A characterisation of the least fixed-point operator by dinaturality, Theoret. Comput. Sci. 118 (1993) 301-314.
154. M.B. Smyth and G.D. Plotkin, The category theoretic solution of recursive domain equations, SIAM J. Comput. 11 (1982) 761-783.
155. Gh. Stefanescu, On flowchart theories: Part I. The deterministic case, J. Comput. System Sci. 35 (1987) 163-191.
156. Gh. Stefanescu, On flowchart theories. Part II, Theoret. Comput. Sci. 52 (1987) 307-340.
157. Gh. Stefanescu, Feedback theories, Rev. Roumaine Math. Pures Appl 35 (1990) 73-79.
158. A. Szendrei, Clones in Universal Algebra (Les Presses de l'Université Montreal, 1986).
159. A. Tarski, A lattice theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285-309.
160. J. Tiuryn, Fixed-points and algebras with infinitely long expressions. Part I: regular algebras, Fundam. Inform. 2 (1978) 103-128.
161. J. Tiuryn, Fixed-points and algebras with infinitely long expressions. Part II: μ-clones of regular algebras, Fundam. Inform. 2 (1979) 317-335.
162. J. Tiuryn, Unique fixed-points vs. least fixed-points, Theoret. Comput. Sci. 12 (1980) 229-254.
163. D.R. Troeger, Metric iteration theories, Fundam. Inform. 2 (1982) 187-216.
164. D.R. Troeger, Step bisimulation is pomset equivalence on a parallel language without explicit internal choice, Math. Struct. Comput. Sci. 3 (1993) 25-62.
165. M. Wand, A concrete approach to abstract recursive definitions, in: Proc. Automata, Languages and Programming'72 (North-Holland, Amsterdam, 1973) 331-334.
166. M. Wand, Fixed-point constructions in order enriched categories, Theoret. Comput. Sci. 8 (1979) 13-30.
167. H.-J. Weinert, Generalized semialgebras over semirings, Lecture Notes in Math., Vol. 1320 (Springer, Berlin, 1988) 380-416.
168. G. Winskel, Synchronization trees, Theoret. Comput. Sci. 34 (1984) 33-82.
169. G. Winskel, The Formal Semantics of Programming Languages, The MIT Press Foundations of Computing Series (MIT Press, Cambridge, MA, 1993).
170. E.G. Wagner, Algebraic semantics, in: D.M. Gabbay, T.S.E. Maibaum and S. Abramsky, eds., The Handbook of Logic in Computer Science, Vol. 1 (Oxford Univ. Press, Oxford, 1994).
171. K. Wagner, Solving recursive domain equations with enriched categories, Ph.D. Thesis, Carnegie Mellon University, 1994.
172. J.B. Wright, J.W. Thatcher, E.G. Wagner and J. Goguen, Rational algebraic theories and fixed-point solutions, in: 17th IEEE Symp. Foundations of Computing, Houston, TX (1976) 147-158.
173. J.B. Wright, J.W. Thatcher, E.G. Wagner and J. Goguen, Some fundamentals of order-algebraic semantics, in: Proc. Symp. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 45 (Springer, Berlin, 1976) 153-168.
174. Y. Xie, ω-complete semirings and matrix iteration theories, Ph.D. Thesis, Department of EECS, Stevens Institute of Technology, 1991.
175. G.Q. Zhang, Logic of Domains (Birkhäuser, Bagal, 1991).