Same Coeffect, Different Base: Connecting Two Dominant Approaches to Graded Types
2026-06-29T08:52:00Z•5a3992b6de6b110ab8d0ec068f8f2eb7add39053f26bae2911255318322c9777
ELRustadversary emulationautomated red teamingcoeffectsconcurrent verificationconstrained Horn clausesdual-useeffects languageformal verificationgraded typeslambda-calculuslinear logicmemoizationmessage-passingprogram analysisprophecyquantum computingquantum monad
What happened
This document aggregates several recent CS/PL arXiv papers: (1) "Same Coeffect, Different Base" — formal translations proving equivalence between two lineages of graded/coeffect type systems (graded-base vs linear-base), enabling transfer of results and informing language design. (2) "Prophecy-Based Automated Verification of Message-Passing Programs" — a fully automated reduction of correctness for message-passing concurrency to constrained Horn clause (CHC) solving using prophecy-style encodings (channel send-lists and timestamps); the reduction is sound and complete and a prototype verifier/
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_cs_pl
- Record identifier
- 5a3992b6de6b110ab8d0ec068f8f2eb7add39053f26bae2911255318322c9777
- Enrichment time
- 2026-06-29T08:52:00Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.