Pat is the first actor programming language with mailbox types that enable static detection of four classes of behavioral errors plus ordinary type errors via an algorithmic type system proven sound and complete.
Andr´ e Joyal and Ross Street
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
Machine-checked model in Rocq establishes that governance is coterminous with expressibility via four primitive constructors in a symmetric monoidal category with capability bounds and verified coherence.
A probabilistic runtime extension to typestates adds mutable state, mixed input/output sessions, and monitoring of expected action ratios to model concurrent and quantitative aspects of distributed protocols.
Mechanizes three governance theorems in Coq and proves two on paper for structural governance in AI systems, with runtime verification via property-based testing showing zero discrepancies.
citing papers explorer
-
Algebraic Semantics of Governed Execution: Monoidal Categories, Effect Algebras, and Coterminous Boundaries
Machine-checked model in Rocq establishes that governance is coterminous with expressibility via four primitive constructors in a symmetric monoidal category with capability bounds and verified coherence.
-
Modelling Distributed Applications with Mixed-Choice Stateful Typestates
A probabilistic runtime extension to typestates adds mutable state, mixed input/output sessions, and monitoring of expected action ratios to model concurrent and quantitative aspects of distributed protocols.
-
Mechanized Foundations of Structural Governance: Machine-Checked Proofs for Governed Intelligence
Mechanizes three governance theorems in Coq and proves two on paper for structural governance in AI systems, with runtime verification via property-based testing showing zero discrepancies.