The Concurrent Calculi Formalisation Benchmark
summary
A new benchmark collection targets machine-checking of message-passing concurrency by giving three concrete problems: mechanize session-type subject reduction and a minimal type safety proof for linear session contexts; show equivalence between structural-congruence+reduction and a labeled-transition model for scope extrusion; and formalize coinductive strong barbed congruence for replicated (infinite) processes. Challenges include full formal definitions, mechanized proofs in systems like Coq/Isabelle/Agda/Abella, and reusable tutorials available via the project website and technical report.
AI-written summary · about