Metraipolis › archive › dc_8fc506010d4d

Fibered Separation Logic: Weakest Preconditions, Universal Constructions, and Local Independence — arXiv:2611.08685

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.08685
License (as archived)
CC0-1.0
Archived
2026-11-09T22:47:25.338Z
SHA-256 of the archived text
2e364edc3703653c5ede62c4ce4a8ea961fc1be54a4f991bb456a56209b3e59b
Stable URL of this page
https://metraipolis.com/documento/dc_8fc506010d4d

How to cite

Fibered Separation Logic: Weakest Preconditions, Universal Constructions, and Local Independence — arXiv:2611.08685 — arXiv (en), https://arxiv.org/abs/2611.08685 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8fc506010d4d (Metraipolis archive dc_8fc506010d4d, sha256 2e364edc3703653c5ede62c4ce4a8ea961fc1be54a4f991bb456a56209b3e59b)
BibTeX
@misc{dc8fc506010d4d,
  title = {Fibered Separation Logic: Weakest Preconditions, Universal Constructions, and Local Independence — arXiv:2611.08685},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.08685},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8fc506010d4d; sha256 2e364edc3703653c5ede62c4ce4a8ea961fc1be54a4f991bb456a56209b3e59b},
  year = {2026}
}

Archived text

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

This paper introduces a categorical framework for models of higher-order separation logic including the weakest precondition modality. Weakest preconditions are interpreted by strong monads on a category fibered over a model of Moggi's computational lambda calculus. The fibered categories in question are termed bunched fibrations and shown to be equivalent to BI hyperdoctrines. Well-known heuristic techniques for obtaining weakest preconditions are shown to be expressible in categorical terms and are proved sound. The ``baking in the frame rule'' trick is shown to satisfy a universal property. Constructions are given for extending a program logic with cost credits. Our largest case study is parametrized by a category having local independent product (LIP) structure, a notion due to Simpson that axiomatizes name generation, randomness, and local state. From an LIP category, we construct an allocation monad, a bunched fibration, and a monad lifting. We instantiate our construction to obtain a novel probabilistic separation logic for measure-theoretic probability that both simplifies and clarifies prior work.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno).
Categorie arXiv: Programming Languages (cs.PL) ; Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2611.08685 — 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-09T22:40:44.873Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).