Generalized coiteration schemata

Electronic Notes in Theoretical Computer Science

Volumn 82, Issue 1, 2003, Pages 76-93

  Cancila, Daniela ^a   Honsell, Furio ^a   Lenisa, Marina ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Bialgebra; Categorical semantics; Coalgebra; Coinductive datatype; Coiteration schema; Guarded specification

Indexed keywords

DATA MINING; FUNCTIONS; LINEAR ALGEBRA; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS;

BIALGEBRA; CATEGORICAL SEMANTICS; COALGEBRA; COINDUCTIVE DATATYPE; COITERATION SCHEMA; GUARDED SPECIFICATION;

ITERATIVE METHODS;

EID: 0942291420     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80633-9     Document Type: Conference Paper

References (22)

1. P. Aczel. Non-well-founded sets, CSLI Lecture Notes 14, Stanford 1988.
2. Aczel P. Final Universes of Processes. Brookes, et al. MFPS'93. LNCS 802 :1993
3. Barbier B. Solving stream equation systems. JFLA. 2002
4. Bartels F. Generalised coinduction. Corradini A., Lenisa M., Montanari U. CMCS'01. ENTCS 44 :2001
5. Barwise J., Moss L. Vicious circles: On the mathematics of non-wellfounded phenomena. 1996;CSLI Publications, Stanford
6. Cockett R., Spencer D. Strong categorical datatypes II: A term logic for categorical programming. TCS. 139:1995;69-113
7. T. Coquand. Infinite Objects in Type Theory, TYPES-93, LNCS 806.
8. A. Corradini, R. Heckel, U. Montanari. Compositional SOS and beyond: A coalgebraic view of open systems, to appear in TCS.
9. Escardo M., Pavlovic D. Calculus in Coinductive Form. LICS'98 :1998;IEEE, Computer Science Press
10. Giménez E. Codifying guarded definitions with recursive schemata. Dybjer P., et al. TYPES. LNCS 996 :1994;39-59
11. Honsell F., Lenisa M., Montanari U., Pistore M. Final Semantics for the π-calculus. Gries D., et al. PROCOMET'98. 1998;Chapman & Hall
12. Jacobs B., Rutten J. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS. 62:1996;222-259
13. Lenisa M. Final Semantics for a Higher Order Concurrent Language. Kirchner H., et al. CAAP'96. LNCS 1059 :1996;102-118
14. Lenisa M. From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems. Jacobs B., Rutten J. CMCS'99. ENTCS 19 :1999
15. Lenisa M., Power J., Watanabe H. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. Jacobs B., Rutten J. CMCS'00. ENTCS 33 :2000
16. Pavlovic D. Guarded induction on final coalgebras. Jacobs B., et al. CMCS'98. ENTCS 11 :1998
17. J.J.M.M. Rutten. Behavioural differential equations: a coinductive calculus of streams, automata, and power series, TR SEN-R0023, CWI.
18. J.J.M.M. Rutten, D. Turi. REX Conference Proceedings, J.de Bakker et al. eds., LNCS 803, 1994, 530-582.
19. Sangiorgi D. On the bisimulation proof method. Math. Struct. In Comp. Science. 98:(8):1998;447-478
20. Turi D., Plotkin G. Towards a mathematical operational semantics. 12th LICS :1997;280-291 IEEE, Computer Science Press
21. Uustalu T., Vene V. Primitive (co)recursion and course-of-value (co)iteration, categorically. Informatica (IMI, Lithuania). 10:(1):1999
22. Uustalu T., Vene V., Pardo A. Recursion Schemes from Comonads. Nordic Journal of Computing. 8:2001;366-390