Languages for coalgebras on datafunctors

Electronic Notes in Theoretical Computer Science

Volumn 19, Issue , 1999, Pages 39-60

  Rößiger, Martin ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DATA STRUCTURES; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; SYNTACTICS; THEOREM PROVING;

COALGEBRAS; DATAFUNCTORS; FUNCTIONAL CONSTRUCTIONS; INFINITARY MODAL LOGIC;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0004566136     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80268-3     Document Type: Conference Paper

References (21)

1. Aczel P., Mendler N. A final coalgebra theorem., In: Category Theory and Computer Science. Pitt D.-H., Poigné A., Rydeheard D.E. number 389 in Lecture Notes in Computer Science. 1989;357-365 Springer
2. Barr M. Terminal coalgebras in well-founded set theory. Theoretical Computer Science, 114(2). 1993;299-315
3. Barwise J., Moss L. Vicious Circles: On the Mathematics of Nonwellfounded Phenomena. number 60 of CSLI Lecture Notes, CSLI. 1996
4. Corradini A. A complete calculus for equational deduction in coalgebraic specification. Report SEN-R9723, National Research Institute for Mathematics and Computer Science, Amsterdam. 1997
5. Goldblatt R. Logics of time and computation. number 7 in CSLI Lecture Notes, CSLI. 1987
6. Goldblatt R. Mathematics of modality. number 43 in CSLI Lecture Notes, CSLI. 1993
7. HENSEL, U. and JACOBS, B., Proof principles for datatypes with iterated recursion. In: Proceedings of Category Theory and Computer Science, LNCS. To appear.
8. Hensel R., Reichel H. Defining equations in terminal coalgebras. Astesiano Egidio, Reggio Gianna, Tarlecki Andrzej. Recent Trends in Data Type Specification, number 906 in Lecture Notes in Computer Science. 1995;307-318 Springer
9. Jacobs B. Mongruences and cofree coalgebras. Alagar V.S., Nivat M. Algebraic Methods and Software Technology, number 936 in Lecture Notes in Computer Science. 1995;245-260 Springer
10. Jacobs B. Objects and classes, co-algebraically., In: Object-Orientation with Parallelism and Persistence. Freitag B., Jones C.B., Lengauer C., Schek H.-J. 1996;83-103 Kluwer Acad. Publ
11. Jacobs B., Rutten J. A tutorial on (co)algebras and (co)induction. to appear in the EATCS Bulletin. 1997
12. JAY, C.B., Data categories. In: M. Houle and P. Eades (eds.), Computing: The Australasian Theory Symposium Proceedings, Melbourne, Australia, 29-30 January, 1996, vol. 18, pp. 21-28, Australian Computer Science Communications. ISSN 0157-3055.
13. Kurz A. Specifying coalgebras with modal logic. ENTCS. 11:1998;57-71
14. Moss L. Coalgebraic logic. submitted. 1997
15. Paulson L. A fixedpoint approach to (co)inductive and (co)datatype definitions. Plotkin G., Stirling C., Tofte M. Essays in Honour of RobinMilner. 1997;. in Press
16. Popkorn S. First steps in modal logic. 1994;Cambridge University Press
17. Reichel H. An approach to object semantics based on terminal coalgebras. Math. Struct. in Comp. Science. 5:1995;129-152
18. Rössiger M. From Modal Logic to Terminal Coalgebras. Preprint MATH-AL-3-1998, Technische Universität Dresden. 1998
19. RUTTEN, J., Universal coalgebra: a theory of systems, Technical Report CS-R9652, CWI Report, 1996.
20. Rutten J., Turi D. On the foundations of final semantics: non-well-founded sets, partial orders, metric spaces. Math. Struct. in Comp. Science. 8:1998;481-540
21. Rutten J., Turi D. Initial algebra and final coalgebra semantics for concurrency. de Bakker J.W., de Roever W.-P., Rozenberg G. A Decade of Concurrency, number 803 in Lecture Notes in Computer Science. 1994;530-582 Springer