A comonadic account of behavioural covarieties of coalgebras
暂无分享,去创建一个
[1] Matthew Hennessy,et al. A modal logic for message passing processes , 1995 .
[2] H. Peter Gumm,et al. Covarieties and Complete Covarieties , 1998, CMCS.
[3] Michael Barr,et al. Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..
[4] B. Jacobs,et al. A tutorial on (co)algebras and (co)induction , 1997 .
[5] Heinz-Peter Gumm. Birkho s variety theorem for coalgebras , 2001 .
[6] Alexander Kurz,et al. Specifying Coalgebras with Modal Logic , 1998, CMCS.
[7] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[8] Grigore Rosu. Equational axiomatizability for coalgebra , 2001, Theor. Comput. Sci..
[9] M. de Rijke,et al. Modal Logic and Process Algebra: A Bisimulation Perspective , 1996 .
[10] Robin Milner,et al. Modal Logics for Mobile Processes , 1991, CONCUR.
[11] Jiří Adámek,et al. From Varieties of Algebras to Covarieties of Coalgebras , 2001, CMCS.
[12] Peter Aczel,et al. A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.
[13] Jan J. M. M. Rutten,et al. Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..
[14] Bart Jacobs,et al. Mongruences and Cofree Coalgebras , 1995, AMAST.
[15] Robert Goldblatt. A Calculus of Terms for Coalgebras of Polynomial Functors , 2001, CMCS.
[16] H. Peter Gumm,et al. Coalgebraic structure from weak limit preserving functors , 2000, CMCS.
[17] Bart Jacobs,et al. Objects and Classes, Co-Algebraically , 1995, Object Orientation with Parallelism and Persistence.
[18] Jirí Adámek,et al. On varieties and covarieties in a category , 2003, Mathematical Structures in Computer Science.
[19] H. Herrlich,et al. Identities in Categories , 1972, Canadian Mathematical Bulletin.
[20] Robert Goldblatt,et al. ENLARGEMENTS OF POLYNOMIAL COALGEBRAS , 2003 .
[21] E. Manes. Algebraic Theories in a Category , 1976 .
[22] Jesse Hughes,et al. The Coalgebraic Dual Of Birkhoff's Variety Theorem , 2000 .
[23] Robert Goldblatt,et al. What is the coalgebraic analogue of Birkhoff's variety theorem? , 2001, Theor. Comput. Sci..
[24] Jesse Hughes,et al. Modal Operators and the Formal Dual of Birkhoff's Completeness Theorem , 2003, Math. Struct. Comput. Sci..
[25] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .
[26] Robin Milner,et al. Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..
[27] Jesse Hughes. Modal Operators for Coequations , 2001, CMCS.
[28] Horst Reichel,et al. An approach to object semantics based on terminal co-algebras , 1995, Mathematical Structures in Computer Science.
[29] H. Gumm. Elements Of The General Theory Of Coalgebras , 1999 .
[30] Grigore Rosu. A Birkhoff-like Axiomatizability Result for Hidden Algebra and Coalgebra , 1998, CMCS.
[31] G. Birkhoff,et al. On the Structure of Abstract Algebras , 1935 .
[32] Jesse Hughes,et al. A study of categories of algebras and coalgebras , 2001 .
[33] Alexander Kurz. A Co-Variety-Theorem for Modal Logic , 1998, Advances in Modal Logic.
[34] Stanley Burris,et al. A course in universal algebra , 1981, Graduate texts in mathematics.
[35] J. Bergstra,et al. Handbook of Process Algebra , 2001 .
[36] Michael Makkai,et al. Accessible categories: The foundations of categorical model theory, , 2007 .
[37] Robert Goldblatt,et al. Equational Logic of Polynomial Coalgebras , 2002, Advances in Modal Logic.
[38] Robert Goldblatt,et al. Observational ultraproducts of polynomial coalgebras , 2003, Ann. Pure Appl. Log..
[39] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[40] Martin Rößiger. From modal logic to terminal coalgebras , 2001 .
[41] Lawrence S. Moss,et al. Coalgebraic Logic , 1999, Ann. Pure Appl. Log..
[42] S. Lane. Categories for the Working Mathematician , 1971 .
[43] S. Eilenberg,et al. Adjoint functors and triples , 1965 .
[44] M. Barr,et al. Toposes, Triples and Theories , 1984 .
[45] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[46] J. Rutten. A calculus of transition systems (towards universal coalgebra) , 1995 .
[47] Kim G. Larsen,et al. Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion , 1990, Theor. Comput. Sci..
[48] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.