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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Describes Learn-Heptagon, a web application for writing, simulating, and verifying Lustre programs, together with the lesson plan used to teach it to engineering students.
citing papers explorer
-
Teaching Synchronous Dataflow Modelling with Learn-Heptagon
Describes Learn-Heptagon, a web application for writing, simulating, and verifying Lustre programs, together with the lesson plan used to teach it to engineering students.