Monoidal computer I: Basic computability by string diagrams

@article{Pavlovic2013MonoidalCI,
  title={Monoidal computer I: Basic computability by string diagrams},
  author={Dusko Pavlovic},
  journal={Inf. Comput.},
  year={2013},
  volume={226},
  pages={94-116}
}
We present a new model of computation, described in terms of monoidal categories. It conforms to the Church–Turing Thesis, and captures the same computable functions as the standard models. It provides a succinct categorical interface to most of them, free of their diverse implementation details, using the ideas and structures that in the meantime emerged from research in semantics of computation and programming. The salient feature of the language of monoidal categories is that it is supported… Expand
Monoidal computer II: Normal complexity by string diagrams
Monoidal computer III: A coalgebraic view of computability and complexity
Rewriting with Frobenius
Rewriting in Free Hypegraph Categories
  • F. Zanasi
  • Computer Science, Mathematics
  • GaM@ETAPS
  • 2017
Chasing Diagrams in Cryptography
  • Dusko Pavlovic
  • Computer Science, Mathematics
  • Categories and Types in Logic, Language, and Physics
  • 2014
Functorial semantics for partial theories
Local Reasoning for Robust Observational Equivalence
Foundations of brick diagrams
Full Abstraction for Signal Flow Graphs
...
1
2
3
4
...

References

SHOWING 1-10 OF 54 REFERENCES
Geometry of abstraction in quantum computation
  • Dusko Pavlovic
  • Computer Science, Mathematics
  • Classical and Quantum Information Assurance Foundations and Practice
  • 2009
Categorical logic of Names and Abstraction in Action Calculi
  • Dusko Pavlovic
  • Mathematics, Computer Science
  • Math. Struct. Comput. Sci.
  • 1997
Quantum Complexity Theory
Domain theory
Classical and quantum structuralism
Relating Toy Models of Quantum Computation: Comprehension, Complementarity and Dagger Mix Autonomous Categories
  • Dusko Pavlovic
  • Computer Science, Physics
  • Electron. Notes Theor. Comput. Sci.
  • 2011
Quantum theory, the Church–Turing principle and the universal quantum computer
  • D. Deutsch
  • Mathematics
  • Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
Quantum and Classical Structures in Nondeterminstic Computation
An Introduction to Kolmogorov Complexity and Its Applications
  • Ming Li, P. Vitányi
  • Computer Science, Psychology
  • Texts and Monographs in Computer Science
  • 1993
Interacting Quantum Observables: Categorical Algebra and Diagrammatics
...
1
2
3
4
5
...