Relating Two Approaches to Coinductive Solution of Recursive Equations

Authors:
Bart Jacobs
Affiliations:
Department of Computer Science, University of Nijmegen P.O. Box 9010, 6500 GL Nijmegen, The Netherlands
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2004

Citing 4
Cited 3

Parametric corecursion

Theoretical Computer Science
Towards a Mathematical Operational Semantics

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Infinite trees and completely iterative theories: a coalgebraic view

Theoretical Computer Science
Behavioural differential equations: a coinductive calculus of streams, automata, and power series

Theoretical Computer Science

Recursive coalgebras from comonads

Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Distributive laws for the coinductive solution of recursive equations

Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Context-free languages via coalgebraic trace semantics

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows that the approach of [P. Aczel, J. Adamek, S. Milius, and J. Velebil, Infinite trees and completely iterative theories: a coalgebraic view, Theor. Comp. Sci., 300 (1-3):1-45, 2003; L.S. Moss, Parametric corecursion, Theor. Comp. Sci., 260(1-2):139-163, 2001] for obtaining coinductive solutions of equations on infinite terms is a special case of a more general recent approach of [F. Bartels. On generalised coinduction and probabilistic specification formats. Distributive laws in coalgebraic modelling. PhD thesis, Free Univ. Amsterdam, 2004. http://homepages.cwi.nl/~bartels/] using distributive laws.