暂无分享,去创建一个
[1] Peter Selinger,et al. Towards a quantum programming language , 2004, Mathematical Structures in Computer Science.
[2] P. Selinger. A Survey of Graphical Languages for Monoidal Categories , 2009, 0908.3347.
[3] Peter Selinger,et al. Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract) , 2007, QPL.
[4] Samson Abramsky,et al. A categorical semantics of quantum protocols , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..
[5] Brigitte Pientka,et al. Wellfounded recursion with copatterns: a unified approach to termination and productivity , 2013, ICFP.
[6] Eugenio Moggi. A Modular Approach to Denotational Semantics , 1991, Category Theory and Computer Science.
[7] Eugenio Moggi,et al. Notions of Computation and Monads , 1991, Inf. Comput..
[8] Dominic R. Verity,et al. ∞-Categories for the Working Mathematician , 2018 .
[9] Rasmus Ejlers Møgelberg. A type theory for productive coprogramming via guarded recursion , 2014, CSL-LICS.
[10] Paulo Oliva,et al. A general framework for sound and complete Floyd-Hoare logics , 2009, TOCL.
[11] Rasmus Ejlers Møgelberg,et al. First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.
[12] Sheila A. Greibach,et al. Quasi-realtime languages , 1970, Mathematical systems theory.
[13] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[14] Alan Jeffrey,et al. Premonoidal categories and flow graphs , 1997, HOOTS.
[15] Dominic R. Verity,et al. Traced monoidal categories , 1996, Mathematical Proceedings of the Cambridge Philosophical Society.
[16] Masahito Hasegawa,et al. Models of sharing graphs : a categorical semantics of let and letrec , 1999 .
[17] Sergey Goncharov,et al. A Relatively Complete Generic Hoare Logic for Order-Enriched Effects , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.
[18] Jeremy Gibbons,et al. The Coinductive Resumption Monad , 2014, MFPS.
[19] Masahito Hasegawa,et al. Models of Sharing Graphs , 1999, Distinguished Dissertations.
[20] P. Panangaden,et al. Nuclear and trace ideals in tensored-categories , 1998, math/9805102.
[21] Masahito Hasegawa,et al. Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi , 1997, TLCA.
[22] Carsten Führmann,et al. An equational notion of lifting monad , 2003, Theor. Comput. Sci..
[23] Jos C. M. Baeten,et al. Process Algebra: Equational Theories of Communicating Processes , 2009 .
[24] Nick Benton,et al. Ultrametric Semantics of Reactive Programs , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.
[25] Tadeusz Litak,et al. Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion , 2017, Fundam. Informaticae.
[26] Richard Blute,et al. Feedback for linearly distributive categories: traces and fixpoints , 2000 .
[27] R. Kadison,et al. Fundamentals of the Theory of Operator Algebras , 1983 .
[28] G. Winskel. The formal semantics of programming languages , 1993 .
[29] Jean-Yves Girard,et al. Towards a geometry of interaction , 1989 .
[30] Zoltán Ésik,et al. Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview , 2015, MFCS.
[31] Christoph Rauch,et al. Unifying Guarded and Unguarded Iteration , 2017, FoSSaCS.
[32] A. Simpson. Recursive types in Kleisli categories , 1992 .
[33] Zoltán Ésik. Axiomatizing Iteration Categories , 1999, Acta Cybern..
[34] Peter Selinger,et al. Partially traced categories , 2011, 1107.3608.
[35] Jan J. M. M. Rutten,et al. Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..
[36] Samson Abramsky,et al. Geometry of Interaction and linear combinatory algebras , 2002, Mathematical Structures in Computer Science.
[37] Roy L. Crole,et al. New foundations for fixpoint computations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.
[38] S. Lane. Categories for the Working Mathematician , 1971 .
[39] Gordon D. Plotkin,et al. Complete axioms for categorical fixed-point operators , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[40] Alan Jeffrey,et al. LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs , 2012, PLPV '12.
[41] Stefan Milius. Completely iterative algebras and completely iterative monads , 2005, Inf. Comput..
[42] Philip J. Scott,et al. Towards a typed Geometry of Interaction , 2005, Mathematical Structures in Computer Science.