Metraipolis › archive › dc_5ca63df6f2dc

Iris on Indirection Theory: Lightweight Higher-order Ghost State — arXiv:2610.41202

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41202
License (as archived)
CC0-1.0
Archived
2026-11-03T05:51:48.876Z
SHA-256 of the archived text
ab7c4e0f8c5bbc7144b30aa97412a4d807f61283a83d3d5ab8be51a952fc0c58
Stable URL of this page
https://metraipolis.com/documento/dc_5ca63df6f2dc

How to cite

Iris on Indirection Theory: Lightweight Higher-order Ghost State — arXiv:2610.41202 — arXiv (en), https://arxiv.org/abs/2610.41202 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5ca63df6f2dc (Metraipolis archive dc_5ca63df6f2dc, sha256 ab7c4e0f8c5bbc7144b30aa97412a4d807f61283a83d3d5ab8be51a952fc0c58)
BibTeX
@misc{dc5ca63df6f2dc,
  title = {Iris on Indirection Theory: Lightweight Higher-order Ghost State — arXiv:2610.41202},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41202},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5ca63df6f2dc; sha256 ab7c4e0f8c5bbc7144b30aa97412a4d807f61283a83d3d5ab8be51a952fc0c58},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41202. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Today, semantic models of languages with concurrency and higher-order state are constructed using step-indexed predicates over resources and higher-order ghost state. There are two main lines of work for constructing such models. On the one hand, Iris provides these in full generality, at the cost of a large body of mechanised domain theory that is difficult to learn and port to new proof assistants. On the other hand, Indirection Theory is much simpler through the use of ordinary dependent types, but its foundation in separation algebra limits the expressiveness of its resource model compared to Iris-style higher-order ghost state. We resolve this conundrum by showing that Indirection Theory can be as expressive as Iris. To that end, we give a lightweight mechanisation of Indirection Theory in Lean, generalised so knots contain resources from an Iris-style resource algebra functor. We then reconstruct the Iris base logic on top of it. The advantage of this approach is in the elementary metatheory: a user can follow the whole construction without domain theory. We conduct two case studies to show that the base logic is expressive and faithful to Iris: a biorthogonal logical relation for higher-order state, and an Iris-style program logic with invariants and user-definable ghost state, complete enough to verify concurrent and higher-order programs.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.PL, nuovi lavori del giorno).
Categorie arXiv: Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2610.41202 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T05:35:46.971Z dalla pagina https://arxiv.org/list/cs.PL/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).