Establishes a formal connection between Jacobs-Staton categorical De Finetti theorem and Melliès free exponential in linear logic, instantiated in probabilistic coherence spaces, then characterizes total elements of !Bool.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proposes an annotation language, program-structure invariants, and SMT solvers to partially automate verification condition proving for Reflex programs in process-oriented control systems.
citing papers explorer
-
Interpreting De Finetti's theorem in the Category of Integrable Cones (long version)
Establishes a formal connection between Jacobs-Staton categorical De Finetti theorem and Melliès free exponential in linear logic, instantiated in probabilistic coherence spaces, then characterizes total elements of !Bool.
-
Partial Automation of Verification Condition Proving for Reflex Programs (Draft)
Proposes an annotation language, program-structure invariants, and SMT solvers to partially automate verification condition proving for Reflex programs in process-oriented control systems.