Compositional control-driven Boolean circuits

DOI10.1007/978-3-032-22469-9_2MaRDI QIDQ7287071zbMATH OpenFDO

Authors Damian Arellanes

Publication date 23 June 2026

Full work available at URL https://doi.org/10.1007/978-3-032-22469-9_2

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Kleene theorem for higher-dimensional automata
• A new implementation technique for applicative languages
• An introduction to string diagrams for computer scientists
• Compositional reasoning
• Compositional separation of control flow and data flow
• Cyclic Boolean circuits
• Diagrammatic Semantics for Digital Circuits.
• Differentiable causal computations via delayed trace (extended version)
• Enriching diagrams with algebraic operations
• Feedback, trace and fixed-point semantics
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 953683 (Why is no real title available?)
• scientific article; zbMATH DE number 5171028 (Why is no real title available?)
• Languages of higher-dimensional automata
• Logic functions and equations. Fundamentals and applications using the XBOOLE-monitor
• On conditional probabilities and their canonical extensions to Boolean algebras of compound conditionals
• On Reliable Computation by Noisy Random Boolean Formulas
• Stochastic neural computation. I. Computational elements
• String diagram rewrite theory II: Rewriting with symmetric monoidal structure
• The complexity of the standard multiplexer function in a class of switching circuits
• Towards an algebraic theory of Boolean circuits.

This page was built for publication: Compositional control-driven Boolean circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287071)