Recursive coalgebras from comonads

Information and Computation

Volumn 204, Issue 4, 2006, Pages 437-468

  Capretta, Venanzio ^a   Uustalu, Tarmo ^b   Vene, Varmo ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

^c UNIVERSITY OF TARTU   (Estonia)

Author keywords

Comonads; Distributive laws; Recursive coalgebras; Structured recursion; Wellfounded coalgebras

Indexed keywords

SEMANTICS;

COMONADS; DISTRIBUTIVE LAWS; RECURSIVE COALGEBRAS; STRUCTURED RECURSION; WELLFOUNDED COALGEBRAS;

ALGEBRA;

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

References (39)

1. J. Adámek, D. Lücke, S. Milius, Recursive coalgebras of finitary functors, in: P. Mosses, J. Power, M. Seisenberger (Eds.), Selected Papers from the CALCO 2005 Young Researchers Workshop, CALCO-jnr 2005 (Swansea, September 2005), Tech. Report CSR 18-2005, Department of Computer Science, University of Wales Swansea, 2005, pp. 1-14.
2. P. Aczel, J. Adámek, S. Milius, J. Velebil, Infinite trees and completely iterative theories: a coalgebraic view, Theoret. Comput. Sci. 300 (1-3) (2003) 1-45.
3. J. Adámek, S. Milius, J. Velebil, Free iterative theories: A coalgebraic view, Math. Struct. Comput. Sci. 13(2) (2003) 259-320. (Pubitemid 36434770)
4. J. Adámek, S. Milius, J. Velebil, From iterative algebras to iterative theories (extended abstract), in: J. Adámek, S. Milius (Eds.), Proceedings of the 7th Workshop on Coalgebraic Methods in Computer Science, CMCS'04 (Barcelona, March 2004), Electron. Notes in Theoret. Comput. Sci., vol. 106, Elsevier, Amsterdam, 2004, pp. 3-24. (Pubitemid 40536116)
5. F. Bartels, Generalised coinduction, Math. Struct. Comput. Sci. 13(2) (2003) 321-348. (Pubitemid 36434771)
6. A. Bove, V. Capretta, Nested general recursion and partiality in type theory, in: R. J. Boulton, P. B. Jackson (Eds.), Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2001 (Edinburgh, September 2001), Lecture Notes in Comput. Sci., vol. 2152, Springer-Verlag, Berlin, 2001, pp. 121-135. (Pubitemid 33328996)
7. A. Bove, V. Capretta, Modelling general recursion in type theory, Math. Struct. Comput. Sci. 15(4) (2005) 671-708.
8. D. Cancila, F. Honsell, M. Lenisa, Generalized coiteration schemata, in: H. P. Gumm (Ed.), Proceedings of the 6th Workshop on Coalgebraic Methods in Computer Science, CMCS'03 (Warsaw, Apr. 2003), vol. 82, No. 1, Electron. Notes in Theoret. Comput. Sci., Elsevier, Amsterdam, 2003.
9. R. Cockett, T. Fukushima, About Charity, Yellow Series Report 92/480/18, Department of Computer Science, University of Calgary, 1992.
10. H. Doornbos, R. Backhouse, Mathematics of recursive program construction, draft manuscript (July 2001).
11. A. Eppendahl, Coalgebra-to-algebra morphisms, in: M. Hofmann, G. Rosolini, D. Pavlović (Eds.), Proceedings of the 8th International Conference on Category Theory and Computer Science, CTCS'99 (Edinburgh, September 1999), Electron. Notes in Theoret. Comput. Sci., vol. 29, Elsevier, Amsterdam, 1999.
12. A. Eppendahl, Fixed point objects corresponding to Freyd algebras, manuscript (May 2000).
13. M. Escardó, A. K. Simpson, A universal characterization of the closed euclidean interval, in: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, LICS'01 (Boston, June 2001), IEEE Computer Society Press, Los Alamitos, CA, 2001, pp. 115-128.
14. P. J Freyd, Algebraically complete categories, in: A. Carboni, M. C. Pedicchio, G. Rosolini (Eds.), Proceedings of the International Conference on Category Theory'90, CT'90 (Como, July 1990), Lecture Notes in Mathematics, vol. 1488, Springer-Verlag, Berlin, 1991, pp. 95-104.
15. M. M. Fokkinga, Law and Order in Algorithmics, PhD thesis, Department of Informatics, University of Twente, 1992.
16. P. J. Freyd, Recursive types reduced to inductive types, in: Proceedings of the 5th IEEE Annual Symposium on Logic in Computer Science, LICS'90 (Philadelphia, PA, June 1990), IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 498-507.
17. P. J. Freyd, Remarks on algebraically compact categories, in: M. P. Fourman, P. T. Johnstone, A. M. Pitts (Eds.), Applications of Categories in Computer Science, LMS Lecture Note Series, vol. 177, Cambridge University Press, Cambridge, 1992, pp. 95-106.
18. E. Giménez, Codifying guarded definitions with recursion schemes, in: P. Dybjer, B. Nördstrom (Eds.), Selected Papers from 2nd International Workshop on Types for Proofs and Programs, TYPES'94 (Båstad, June 1994), Lecture Notes in Computer Science, vol. 996, Springer-Verlag, Berlin, 1995, pp. 39-59.
19. E. Giménez, Structural recursive definitions in type theory, in: K. G. Larsen, S. Skyum, G. Winskel (Eds.), Proceedings of the 25th International Colloquium on Automata, Languages and Programming, ICALP'98 (Aalborg, July 1998), Lecture Notes in Computer Science, vol. 1443, Springer-Verlag, Berlin, 1998, pp. 397-408. (Pubitemid 128111132)
20. T. Hagino, A typed lambda calculus with categorical type constructors, in: D. H. Pitt, A. Poigné, D. E. Rydeheard (Eds.), Proceedings of the 2nd International Conference on Category Theory and Computer Science, CTCS'87 (Edinburgh, September 1987), Lecture Notes in Computer Science, vol. 283, Springer-Velrag, Berlin, 1987, pp. 140-157.
21. B. Jacobs, Relating two approaches to coinductive solution of recursive equations, in: J. Adámek, S. Milius (Eds.), Proceedings of the 7th Workshop on Coalgebraic Methods in Computer Science, CMCS'04 (Barcelona, March 2004), Electron. Notes in Theoret. Comput. Sci., vol. 106, Elsevier, Amsterdam, 2004, pp. 145-166. (Pubitemid 40536123)
22. J. Lambek, A fixpoint theorem for complete categories, Math. Z. 103(1968) 151-161.
23. G. Malcolm, Data structures and program transformation, Sci. Comput. Program. 14 (2-3) (1990) 255-279.
24. C. McBride, J. McKinna, The view from the left, J. Funct. Prog. 14(1) (2004) 69-111. (Pubitemid 38172187)
25. C. McBride, Epigram: practical programming with dependent types, in: V. Vene, T. Uustalu (Eds.), Revised Lectures from the 5th International School on Advanced Functional Programming, AFP 2004 (Tartu, Aug. 2004), Lecture Notes in Computer Science, vol. 3622, Springer-Verlag, Berlin, 2005, pp. 130-170.
26. E. Meijer, M. Fokkinga, R. Paterson, Functional programming with bananas, lenses, envelopes and barbed wire, in: J. Hughes (Ed.), Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, FPCA'91 (Cambridge, MA, Aug. 1991), Lecture Notes in Computer Science, vol. 523, Springer-Verlag, Berlin, 1991, pp. 124-144.
27. S. Milius, Completely iterative algebras and completely iterative monads, Inform. Comput. 196(1) (2005) 1-41.
28. L. S. Moss, Parametric corecursion, Theoret. Comput. Sci. 260 (1-2) (2001) 139-163. (Pubitemid 32674015)
29. E. Nelson, Iterative algebras, Theoret. Comput. Sci. 25(1983) 67-94.
30. G. Osius, Categorical set theory: A characterisation of the category of sets, J. Pure Appl. Algebra 4(1974) 79-119.
31. P. Taylor, Intuitionistic sets and ordinals, J. Symb. Logic 61(3) (1996) 705-744.
32. P. Taylor, Towards a unified treatment of induction, I: the general recursion theorem, unfinished draft manuscript (Aug. 1996).
33. P. Taylor, Practical Foundations of Mathematics, Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, 1999.
34. D. Turi, G. D. Plotkin, Towards a mathematical operational semantics, in: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, LICS'97 (Warsaw, June/July 1997), IEEE Computer Science Press, Los Alamitos, CA, 1997, pp. 280-291.
35. D. A. Turner, Elementary strong functional programming, in: P. H. Hartel, R. Plasmeijer (Eds.), Proceedings of the 1st International Symposium on Functional Programming Language in Education, FPLE'95 (Nijmegen, December 1995), Lecture Notes in Computer Science, vol. 1022, Springer-Verlag, Berlin, 1995, pp. 1-13.
36. T. Uustalu, V. Vene, Primitive (co) recursion and course-of-value (co) iteration, categorically, Informatica 10(1) (1999) 5-26.
37. T. Uustalu, V. Vene, Coding recursion à la Mendler (extended abstract), in: J. Jeuring (Ed.), Proceedings of the 2nd Workshop on Generic Programming, WGP'2000 (Ponte de Lima, July 2000), Tech. Report UU-CS-2000-19, Department of Computer Science, Utrecht University, 2000, pp. 69-85.
38. T. Uustalu, V. Vene, The dual of substitution is redecoration, in: K. Hammond, S. Curtis (Eds.), Trends in Functional Programming, vol. 3, Intellect, Bristol/Portland, OR 2002, pp. 99-110.
39. T. Uustalu, V. Vene, A. Pardo, Recursion schemes from comonads, Nordic J. Comput. 8(3) (2001) 366-390.