Monoidal computer I: Basic computability by string diagrams
- 1 May 2013
- journal article
- Published by Elsevier in Information and Computation
- Vol. 226, 94-116
Abstract
No abstract availableAll Related Versions
This publication has 20 references indexed in Scilit:
- Teleportation in general probabilistic theories2012
- 𝐻*-algebras and nonunital Frobenius algebras: First steps in infinite-dimensional categorical quantum mechanics2012
- Interacting quantum observables: categorical algebra and diagrammaticsNew Journal of Physics, 2011
- Quantum picturalismContemporary Physics, 2009
- A personal view of average-case complexity2002
- The geometry of tensor calculus, IAdvances in Mathematics, 1991
- Cartesian bicategories IJournal of Pure and Applied Algebra, 1987
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1985
- Coherence for compact closed categoriesJournal of Pure and Applied Algebra, 1980
- Coalgebras and cartesian categoriesCommunications in Algebra, 1976