Discrete Lawvere Theories
暂无分享,去创建一个
[1] Gordon D. Plotkin,et al. Notions of Computation Determine Monads , 2002, FoSSaCS.
[2] Michael W. Mislove. Nondeterminism and Probabilistic Choice: Obeying the Laws , 2000, CONCUR.
[3] Andrew M. Pitts,et al. Category Theory and Computer Science , 1987, Lecture Notes in Computer Science.
[4] Gordon D. Plotkin,et al. Combining Computational Effects: commutativity & sum , 2002, IFIP TCS.
[5] Matthew Hennessy,et al. Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.
[6] Michael Barr,et al. Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.
[7] Gordon D. Plotkin,et al. Combining effects: Sum and tensor , 2006, Theor. Comput. Sci..
[8] Sophie Tison. Trees in Algebra and Programming — CAAP'94 , 1994, Lecture Notes in Computer Science.
[9] J. Adámek,et al. Locally presentable and accessible categories , 1994 .
[10] John Power,et al. Why Tricategories? , 1995, Inf. Comput..
[11] John Power,et al. Combining continuations with other effects , 2004 .
[12] A. Kock. Monads on symmetric monoidal closed categories , 1970 .
[13] Eugenio Moggi,et al. Notions of Computation and Monads , 1991, Inf. Comput..
[14] G. M. Kelly,et al. Two-dimensional monad theory , 1989 .
[15] Robin Milner,et al. Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.
[16] John Power,et al. Pseudo-commutative monads and pseudo-closed 2-categories , 2002 .
[17] John Power. Canonical Models for Computational Effects , 2004, FoSSaCS.
[18] C. Jones,et al. A probabilistic powerdomain of evaluations , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[19] G. Kelly. A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on , 1980, Bulletin of the Australian Mathematical Society.
[20] Kousha Etessami,et al. Optimizing Büchi Automata , 2000, CONCUR.
[21] Christoph Lüth,et al. Monads and Modular Term Rewriting , 1997, Category Theory and Computer Science.
[22] Reinhold Heckmann,et al. Probabilistic Domains , 1994, CAAP.
[23] G. M. Kelly,et al. Structures defined by finite limits in the enriched context, I , 1982 .
[24] Stephen Lack,et al. Finite-product-preserving functors, Kan extensions, and strongly-finitary 2-monads , 1993, Appl. Categorical Struct..
[25] M. Barr,et al. Toposes, Triples and Theories , 1984 .
[26] G. M. Kelly,et al. Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads , 1993 .
[27] Eugenio Moggi,et al. Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[28] G. M. Kelly,et al. BASIC CONCEPTS OF ENRICHED CATEGORY THEORY , 2022, Elements of ∞-Category Theory.