Gradually Verifying Unfolding Expressions & Pure Functions
2026-07-20T08:51:59Z•1bb3ffd5854d7c0ae8703e43cda5dd79a34f066168f7767ea533cfab7c4fe9a4
GobraGradual-C0IrisNaginiRocqSiliconSnaKtViperYarrowabstract-interpretationalgebraic-effectscausalitygradual-verificationlinear-type-systemmemory-modelsprogram-logicprogram-verificationpure-functionsquantum-controlquantum-programmingquantum-switchregion-based-memory-managementsymbolic-executiontyped-lambda-calculusunfolding-expressions
What happened
Collection of recent research (arXiv) on programming languages and verification: formal semantics and soundness proofs for unfolding expressions and pure functions in static and gradual verifiers (applicable to Gradual C0 and Viper/Silicon backends); a quantum programming language with quantum control and a linear type system resolving the "correspondence problem" and enabling the quantum SWITCH over channels; Yarrow, an ML-like language reconciling algebraic effects with region-based memory management plus a program logic (YL) mechanized in Iris/Rocq; a causality-aware typed lambda calculus/
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_cs_pl
- Record identifier
- 1bb3ffd5854d7c0ae8703e43cda5dd79a34f066168f7767ea533cfab7c4fe9a4
- Enrichment time
- 2026-07-20T08:51:59Z
- 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.