Distributive laws for the coinductive solution of recursive equations

Information and Computation

Volumn 204, Issue 4, 2006, Pages 561-587

  Jacobs, Bart ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SYSTEMS;

COINDUCTION; DISTRIBUTIVE LAWS; EXTENDED FORM; RECURSIVE EQUATIONS; SOLUTIONS OF EQUATION;

COMPUTATIONAL METHODS;

EID: 84855196944     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2005.03.006     Document Type: Article

References (26)

1. P. Aczel, Non-well-founded sets. CSLI Lecture Notes 14, Stanford, 1988.
2. P. Aczel, J. Adámek, S. Milius, J. Velebil, Infinite trees and completely iterative theories: a coalgebraic view, Theor. Comput. Sci. 300 (1-3) (2003) 1-45.
3. P. Aczel, J. Adámek, J. Velebil, A coalgebraic view of infinite trees and iteration, in: A. Corradini, M. Lenisa, U. Montanari (Eds.), Coalgebraic Methods in Computer Science, Electronic Notes in Theoretical Computer Science, vol. 44, Elsevier, Amsterdam, 2001.
4. M. Barr, Ch. Wells, Toposes, Triples and Theories, Springer, Berlin, 1985.
5. F. Bartels. On generalised coinduction and probabilistic specification formats. Distributive laws in coalgebraic modelling. PhD thesis, Free Univ. Amsterdam, 2004.
6. J. Barwise, L. S. Moss. Vicious Circles: On the Mathematics of Non-wellfounded Phenomena, CSLI Lecture Notes 60, Stanford, 1996.
7. J. Beck, Distributive laws, in: B. Eckman (Ed.), Seminar on Triples and Categorical Homolgy Theory, Lecture Notes in Mathematics, vol. 80, Springer, Berlin, 1969, pp. 119-140.
8. J. R. B. Cockett, Introduction to distributive categories, Math. Struct. Comp. Sci. 3(1993) 277-307.
9. J. H. Conway, Regular Algebra and Finite Machines, Chapman and Hall, London, 1971.
10. C. C. Elgot, Monadic computation and iterative algebraic theories, in: H. E. Rose, J. C. Shepherson (Eds.), Logic Colloquium'73, Amsterdam, North-Holland, 1975, pp. 175-230.
11. C. C. Elgot, S. L. Bloom, R. Tindell, The algebraic structure of rooted trees, J. Comput. Syst. Sci 16(1978) 361-399.
12. B. Jacobs, Relating two approaches to coinductive solution of recursive equations, in: J. Adámek, S. Milius (Eds.), Coalgebraic Methods in Computer Science, Electronic Notes in Theoretical Computer Science, vol. 106, Elsevier, Amsterdam, 2004.
13. B. Jacobs, Trace semantics for coalgebras, in: J. Adámek, S. Milius (Eds.), Coalgebraic Methodsin Computer Science, Electronic Notes in Theoretical Computer Science, vol. 106, Elsevier, Amsterdam, 2004.
14. B. Jacobs. A bialgebraic review of regular expressions, deterministic automata and languages. Techn. Rep. ICIS-R05003, Inst. for Computing and Information Sciences, Radboud Univ. Nijmegen, 2005.
15. B. Jacobs, J. Rutten, A tutorial on (co) algebras and (co) induction, EATCS Bull. 62(1997) 222-259.
16. P. T. Johnstone, Adjoint lifting theorems for categories of algebras, Bull. Lond. Math. Soc. 7(1975) 294-297.
17. M. Lenisa, From set-theoretic coinduction to coalgebraic coinduction: some results, some problems, in: B. Jacobs, J. Rutten (Eds.), Coalgebraic Methods in Computer Science, Electronic Notes in Theoretical Computer Science, vol. 19, Elsevier, Amsterdam, 1999.
18. M. Lenisa, J. Power, H. Watanabe, Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads, in: H. Reichel (Ed.), Coalgebraic Methods in Computer Science, Electronic Notes in Theoretical Computer Science, vol. 33, Elsevier, Amsterdam, 2000.
19. S. Milius, On iterable endofunctors, in: R. Blute, P. Selinger (Eds.), Category Theory and Computer Science 2002, Electronic Notes in Theoretical Computer Science, vol. 69, Elsevier, Amsterdam, 2003.
20. L. S. Moss, Parametric corecursion, Theor. Comp. Sci. 260 (1-2) (2001) 139-163. (Pubitemid 32674015)
21. D. E. Muller, P. E. Schupp, Alternating automata on infinite trees, Theor. Comput. Sci. 54 (2/3) (1997) 267-276.
22. K. I. Rosenthal, Quantales and their applications, in: Pitman Research Notes in Mathematics, vol. 234, Longman Scientific & Technical, 1990.
23. J. Rutten, Behavioural differential equations: a coinductive calculus of streams, automata, and power series, Theor. Comput. Sci. 308(2003) 1-53.
24. D. Turi, Functorial operational semantics and its denotational dual, PhD thesis, Free Univ. Amsterdam, 1996.
25. D. Turi, G. Plotkin, Towards a mathematical operational semantics, in: Logic in Computer Science, IEEE, Computer Science Press, 1997, pp. 280-291.
26. T. Uustalu, V. Vene, A. Pardo, Recursion schemes from comonads, Nordic J. Comput. 8(3) (2001) 366-390.