Gradually Verifying Unfolding Expressions & Pure Functions
arXiv 2607.15383•1bb3ffd5854d7c0ae8703e43cda5dd79a34f066168f7767ea533cfab7c4fe9a4
GobraGradual-C0IrisNaginiRocqSiliconSnaKtViperYarrowabstract-interpretationalgebraic-effectscausalitygradual-verificationlinear-type-systemmemory-modelsprogram-logicprogram-verificationpure-functionsquantum-controlquantum-programmingquantum-switchregion-based-memory-managementsymbolic-executiontyped-lambda-calculusunfolding-expressions
Paper metadata
- arXiv ID
- 2607.15383
- Version
- Not specified by this published record
- Category
- Computer Science — Programming Languages (cs.PL)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
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.