Distributive laws for the coinductive solution of recursive equations

Authors:
Bart Jacobs
Affiliations:
Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands
Venue:
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Year:
2006

Citing 9
Cited 1

Alternating automata on infinite trees

Theoretical Computer Science
Vicious circles: on the mathematics of non-wellfounded phenomena

Vicious circles: on the mathematics of non-wellfounded phenomena
Parametric corecursion

Theoretical Computer Science
Recursion schemes from comonads

Nordic Journal of Computing
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
Relating Two Approaches to Coinductive Solution of Recursive Equations

Electronic Notes in Theoretical Computer Science (ENTCS)
Trace Semantics for Coalgebras

Electronic Notes in Theoretical Computer Science (ENTCS)

CIA structures and the semantics of recursion

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper illustrates the relevance of distributive laws for the solution of recursive equations, and shows that one approach for obtaining coinductive solutions of equations via infinite terms is in fact a special case of a more general approach using an extended form of coinduction via distributive laws.