Reversible monadic computing
From MaRDI portal
Publication:5971401
DOI10.1016/j.entcs.2015.12.014zbMath1351.68100arXiv1505.04330OpenAlexW1592668793WikidataQ113317727 ScholiaQ113317727MaRDI QIDQ5971401
Publication date: 16 December 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.04330
Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Categorical semantics of formal languages (18C50) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Eilenberg-Moore and Kleisli constructions for monads (18C20)
Related Items
Reversible effects as inverse arrows, A survey of categorical properties of \(\mathbb{L}\)-fuzzy relations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On block structures in quantum computation
- Categorical formulation of finite-dimensional quantum algebras
- Fundamentals of quantum information theory
- Notions of computation and monads
- Algebra of proofs
- CPO's of measures for nondeterminism
- Coherence for compact closed categories
- Semantics of probabilistic programs
- Adjunctions in monoidal categories
- Semantics of weakening and contraction
- Involutive categories and monoids, with a GNS-correspondence
- Relative Frobenius algebras are groupoids
- Strong functors and monoidal monads
- Monads and monoids on symmetric monoidal closed categories
- Relating Toy Models of Quantum Computation: Comprehension, Complementarity and Dagger Mix Autonomous Categories
- Handling Algebraic Effects
- A Duality Theorem for Real C * Algebras
- Coalgebraic Walks, in Quantum and Turing Computation
- A Survey of Graphical Languages for Monoidal Categories
- Classical and quantum structuralism
- Quantum and Classical Structures in Nondeterminstic Computation
- Categorical semantics for arrows
- An embedding theorem for Hilbert categories
- Comprehending monads
- Frobenius monads and pseudomonoids
- A new description of orthogonal bases
- Handlers in action
- Foundations of Software Science and Computation Structures
- Homotopy Type Theory: Univalent Foundations of Mathematics
- A lambda calculus for quantum computation with classical control
- Algebra and Coalgebra in Computer Science
- CONCUR 2003 - Concurrency Theory
