Monoidal computer I: Basic computability by string diagrams

@article{Pavlovic2013MonoidalCI,
  title={Monoidal computer I: Basic computability by string diagrams},
  author={Dusko Pavlovic},
  journal={ArXiv},
  year={2013},
  volume={abs/1208.5205}
}
  • Dusko Pavlovic
  • Published 2013
  • Computer Science, Mathematics
  • ArXiv
  • 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… CONTINUE READING
    28 Citations
    Monoidal computer II: Normal complexity by string diagrams
    • 5
    • PDF
    Monoidal computer III: A coalgebraic view of computability and complexity
    • 1
    • PDF
    Rewriting with Frobenius
    • 5
    • PDF
    Rewriting in Free Hypegraph Categories
    • F. Zanasi
    • Mathematics, Computer Science
    • GaM@ETAPS
    • 2017
    • 4
    • PDF
    Functorial Semantics for Partial Theories
    Chasing Diagrams in Cryptography
    • Dusko Pavlovic
    • Computer Science, Mathematics
    • Categories and Types in Logic, Language, and Physics
    • 2014
    • 5
    • PDF
    Local Reasoning for Robust Observational Equivalence
    • 1
    • PDF
    Foundations of brick diagrams
    Full Abstraction for Signal Flow Graphs
    • 59
    • PDF

    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
    • 20
    • PDF
    Categorical logic of Names and Abstraction in Action Calculi
    • Dusko Pavlovic
    • Computer Science, Mathematics
    • Math. Struct. Comput. Sci.
    • 1997
    • 26
    Quantum Complexity Theory
    • 844
    Domain theory
    • 1,168
    • PDF
    Classical and quantum structuralism
    • 88
    • PDF
    Relating Toy Models of Quantum Computation: Comprehension, Complementarity and Dagger Mix Autonomous Categories
    • Dusko Pavlovic
    • Computer Science, Physics
    • Electron. Notes Theor. Comput. Sci.
    • 2011
    • 7
    • PDF
    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
    • 3,480
    • PDF
    Quantum and Classical Structures in Nondeterminstic Computation
    • 40
    • PDF
    Interacting Quantum Observables: Categorical Algebra and Diagrammatics
    • 272
    • PDF
    Computer-Aided Security Proofs for the Working Cryptographer
    • 224
    • PDF