Iteration theories: the equational logic of iterative processes
Iteration theories: the equational logic of iterative processes
The equational logic of fixed points
Theoretical Computer Science
Equational properties of iteration in algebraically complete categories
MFCS '96 Selected papers from the 21st symposium on Mathematical foundations of computer science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Theoretical Computer Science
View from the Fringe of the Fringe
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
A duality between proof systems for cyclic term graphs
Mathematical Structures in Computer Science
Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Equational properties of iterative monads
Information and Computation
Elgot theories: A new perspective on the equational properties of iteration
Mathematical Structures in Computer Science
Equational logic of recursive program schemes
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
A complete logical system for the equality of recursive terms for sets
Logic and Program Semantics
Hi-index | 0.00 |
This paper is concerned with the equational logic of definitions whose semantics is given in terms of final coalgebra maps. The framework for our study is iteration theories (cf. e.g. Bloom and Ésik, Iteration Theories: The Equational Logic of Iterative Processes, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1993; Theoret. Comput. Sci. 179 (1-2) (1997)), recently re-introduced as models of the FLR0 fragment of the formal language of recursion (Hurkens et al., J. Symbolic Logic 63 (2) (1998) 45; Mos Chovakis, J. Symbolic Logic 54 (1989) 1216; in: M.L. Dalla Chiara et al. (Eds.), Logic and Scientific Methods, Kluwer, Dordrecht, 1997, p. 179). We present a new class of iteration theories derived from final coalgebras. This allows us to reason with a number of types of fixed-point equations which heretofore seemed to require metric or order-theoretic ideas. All of the work can be done using finality properties and equational reasoning. Having a semantics, we obtain the following completeness result: the equations involving fixed-point terms which are valid for final coalgebra interpretations are exactly those valid in a number of contexts pertaining to recursion. For example, they coincide with the equations valid for least-fixed-point recursion on dcpo's. We also present a new version of the proof of the well-known completeness result for iteration theories (see Ésik, Comput. Linguistics Comput. Languages 4 (1982) 95; Hurkens et al., 1998). Our work brings out a connection between coalgebraic reasoning and recursion.