Universal coalgebra: a theory of systems
暂无分享,去创建一个
[1] Marcelo P. Fiore. A Coinduction Principle for Recursive Data Types Based on Bisimulation , 1996, Inf. Comput..
[2] Michael Barr,et al. Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..
[3] Jan J. M. M. Rutten. Relators and Metric Bisimulations , 1998, CMCS.
[4] Glynn Winskel,et al. Bisimulation from Open Maps , 1994, Inf. Comput..
[5] Daniele Turi,et al. Categorical Modelling of Structural Operational Rules: Case Studies , 1997, Category Theory and Computer Science.
[6] Robin Milner,et al. Processes: A Mathematical Model of Computing Agents , 1975 .
[7] Furio Honsell,et al. Final Semantics for untyped lambda-calculus , 1995, TLCA.
[8] Gunther Schmidt,et al. Relations and Graphs: Discrete Mathematics for Computer Scientists , 1993 .
[9] Gordon D. Plotkin,et al. The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[10] John Power,et al. An axiomatics for categories of coalgebras , 1998, CMCS.
[11] Martin Rößiger. From modal logic to terminal coalgebras , 2001 .
[12] Bernhard Steffen,et al. Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..
[13] Desmond Fearnley-Sander,et al. Universal Algebra , 1982 .
[14] Lawrence S. Moss,et al. Coalgebraic Logic , 1999, Ann. Pure Appl. Log..
[15] Andrew M. Pitts,et al. Relational Properties of Domains , 1996, Inf. Comput..
[16] Michal Marvan. On covarieties of coalgebras , 1985 .
[17] Michael Barr,et al. Additions and Corrections to "Terminal Coalgebras in Well-founded Set Theory" , 1994, Theor. Comput. Sci..
[18] Hans-Jörg Schek,et al. Object Orientation with Parallelism and Persistence , 1996 .
[19] Gordon D. Plotkin,et al. Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[20] Yasuo Kawahara,et al. A small final coalgebra theorem , 1994, Theor. Comput. Sci..
[21] Martin Rö,et al. From modal logic to terminal coalgebras , 2001, Theor. Comput. Sci..
[22] Rob J. van Glabbeek,et al. The meaning of negative premises in transition system specifications II , 1996, J. Log. Algebraic Methods Program..
[23] Bart Jacobs,et al. Inheritance and Cofree Constructions , 1996, ECOOP.
[24] B. Jacobs,et al. A tutorial on (co)algebras and (co)induction , 1997 .
[25] Dominique Perrin,et al. Symbolic Dynamics and Finite Automata , 1997, Handbook of Formal Languages.
[26] Reinhard Pöschel,et al. A general Galois theory for cofunctions and corelations , 2000 .
[27] K. Mani Chandy,et al. Current trends in programming methodology , 1977 .
[28] Robert M. Keller,et al. Formal verification of parallel programs , 1976, CACM.
[29] Robin Milner,et al. Co-Induction in Relational Semantics , 1991, Theor. Comput. Sci..
[30] M. de Rijke,et al. Modal Logic and Process Algebra: A Bisimulation Perspective , 1996 .
[31] Michael A. Arbib,et al. Parametrized Data Types Do Not Need Highly Constrained Parameters , 1982, Inf. Control..
[32] H. Peter Gumm,et al. Covarieties and Complete Covarieties , 1998, CMCS.
[33] R. Devaney. An Introduction to Chaotic Dynamical Systems , 1990 .
[34] Peter Aczel,et al. A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.
[35] Furio Honsell,et al. Processes and Hyperuniverses , 1994, MFCS.
[36] Marcelo P. Fiore,et al. A coinduction principle for recursive data types based on bisimulation , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.
[37] S. Lane. Categories for the Working Mathematician , 1971 .
[38] Erik P. de Vink,et al. Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach , 1997, Theor. Comput. Sci..
[39] Nachum Dershowitz,et al. Abstract Effective Models , 2006, Electron. Notes Theor. Comput. Sci..
[40] Matthew Hennessy,et al. Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.
[41] Jan J. M. M. Rutten,et al. Automata and Coinduction (An Exercise in Coalgebra) , 1998, CONCUR.
[42] Bart Jacobs,et al. Reasonong about Classess in Object-Oriented Languages: Logical Models and Tools , 1998, ESOP.
[43] Bart Jacobs,et al. Mongruences and Cofree Coalgebras , 1995, AMAST.
[44] Lawrence S. Moss,et al. On the Foundations of Corecursion , 1997, Log. J. IGPL.
[45] Marina Lenisa. Final Semantics for a Higher Order Concurrent Language , 1996, CAAP.
[46] R. Goldblatt. Logics of Time and Computation , 1987 .
[47] C. Pollard,et al. Center for the Study of Language and Information , 2022 .
[48] Jan J. M. M. Rutten,et al. Initial Algebra and Final Coalgebra Semantics for Concurrency , 1993, REX School/Symposium.
[49] Jan Rutten,et al. On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces , 1998, Mathematical Structures in Computer Science.
[50] Mogens Nielsen,et al. Models for Concurrency , 1992 .
[51] Jan J. M. M. Rutten,et al. On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders , 1992, REX Workshop.
[52] Bart Jacobs. Coalgebraic Reasoning about Classes in Object-Oriented Languages , 1998, CMCS.
[53] J. Rutten. A calculus of transition systems (towards universal coalgebra) , 1995 .
[54] Lawrence S. Moss,et al. Vicious circles - on the mathematics of non-wellfounded phenomena , 1996, CSLI lecture notes series.
[55] Samson Abramsky,et al. A Domain Equation for Bisimulation , 1991, Inf. Comput..
[56] Bart Jacobs,et al. Structural Induction and Coinduction in a Fibrational Setting , 1998, Inf. Comput..
[57] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..
[58] P. J. Higgins. UNIVERSAL ALGEBRA: (Mathematics and its Applications, 6) , 1982 .
[59] Andrew M. Pitts,et al. A co-Induction Principle for Recursively Defined Domains , 1994, Theor. Comput. Sci..
[60] Michael A. Arbib,et al. Algebraic Approaches to Program Semantics , 1986, Texts and Monographs in Computer Science.
[61] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .
[62] Franck van Breugel,et al. Terminal Metric Spaces of Finitely Branching and Image Finite Linear Processes , 1998, Theor. Comput. Sci..
[63] Alexander Kurz. Specifying coalgebras with modal logic , 2001, Theor. Comput. Sci..
[64] Corina Cîrstea,et al. Coalgebra semantics for hidden algebra: Parameterised objects an inheritance , 1997, WADT.
[65] D. Turi,et al. Functional Operational Semantics and its Denotational Dual , 1996 .
[66] Andrea Corradini,et al. A complete calculus for equational deduction in coalgebraic specification , 1997 .
[67] Lawrence C. Paulson. Mechanizing Coinduction and Corecursion in Higher-Order Logic , 1997, J. Log. Comput..
[68] M. Arbib,et al. Machines in a category , 1980 .
[69] Horst Reichel,et al. An approach to object semantics based on terminal co-algebras , 1995, Mathematical Structures in Computer Science.
[70] Jan Friso Groote,et al. Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..
[71] Peter Aczel,et al. Non-well-founded sets , 1988, CSLI lecture notes series.
[72] Peter Aczel,et al. Final Universes of Processes , 1993, MFPS.
[73] Pierre America,et al. Solving Reflexive Domain Equations in a Category of Complete Metric Spaces , 1989, J. Comput. Syst. Sci..
[74] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[75] Robert E. Kent. The Metric Closure Powerspace Construction , 1987, MFPS.
[76] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[77] M. Bernhard. Introduction to Chaotic Dynamical Systems , 1992 .
[78] Jan J. M. M. Rutten. Processes as Terms: Non-Well-Founded Models for Bisimulation , 1992, Math. Struct. Comput. Sci..