Coalgebraic Walks, in Quantum and Turing Computation
暂无分享,去创建一个
[1] Prakash Panangaden,et al. Dagger Categories and Formal Distributions , 2010 .
[2] Simon Perdrix. Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition , 2011, Electron. Notes Theor. Comput. Sci..
[3] A. Kock. Bilinearity and Cartesian Closed Monads. , 1971 .
[4] Anders Kock,et al. Closed categories generated by commutative monads , 1971, Journal of the Australian Mathematical Society.
[5] Bart Jacobs,et al. Dagger Categories of Tame Relations , 2011, Logica Universalis.
[6] Julia Kempe,et al. Quantum random walks: An introductory overview , 2003, quant-ph/0303081.
[7] Bart Jacobs,et al. Semantics of Weakening and Contraction , 1994, Ann. Pure Appl. Log..
[8] Bart Jacobs,et al. Scalars, Monads, and Categories , 2010, Quantum Physics and Linguistics.
[9] Erik P. de Vink,et al. A hierarchy of probabilistic system types , 2003, CMCS.
[10] Gilles Dowek,et al. Principles of programming languages , 1981, Prentice Hall International Series in Computer Science.
[11] Salvador Elías Venegas-Andraca,et al. Quantum Walks for Computer Scientists , 2008, Quantum Walks for Computer Scientists.
[12] James Worrell,et al. Testing Semantics: Connecting Processes and Process Logics , 2006, AMAST.
[13] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[14] Jan J. M. M. Rutten,et al. Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..
[15] Paul Hudak,et al. Monad transformers and modular interpreters , 1995, POPL '95.
[16] Bart Jacobs,et al. Involutive Categories and Monoids, with a GNS-Correspondence , 2010, ArXiv.