Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.
Laplaza (1972):Coherence for distributivity
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Introduces essential unitarity as the unique structure-compatible generalization of unitarity to higher-order quantum interfaces in a categorical framework, with all quantum core morphisms satisfying it.
Kleene-Cartesian rig categories equip tape diagrams to handle imperative programs and program logic.
citing papers explorer
-
Completeness for Probabilistic Boolean Tapes
Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.
-
Essential Unitarity for Higher-Order Quantum Computation
Introduces essential unitarity as the unique structure-compatible generalization of unitarity to higher-order quantum interfaces in a categorical framework, with all quantum core morphisms satisfying it.
-
A Diagrammatic Basis for Computer Programming
Kleene-Cartesian rig categories equip tape diagrams to handle imperative programs and program logic.