X Proofs: Checked Layouts and Memoised Parallel Calls

X Proofs provides mechanised semantic models for X’s ten language constructs in Lean 4. We prove preservation results for record-layout translation and concurrent memoisation, then combine them. For records stored in separate columns, we prove that layout translation preserves values, observations and the first invariant failure. The theorem covers writes through borrowed fields, any finite number of fields and any Boolean record invariant. For memoised calls, we prove that every completed response equals the uncached result when lookup and publication are atomic, even with simultaneous misses and colliding entries. We compose the two results to cover successful record updates followed by read-only calls. We prove that a decoded write and guard satisfying our validation criterion have the same outcome as the source write, then apply the checker to selected LLVM output. Tests of compiled X programs and executable counterexamples show why correctness depends on tracking record owners, checking each write immediately and comparing complete cache keys. Repository: https://github.com/WillKirkmanM/x-proofs

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24305462
Primary Topic
Logic, programming, and type systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

X Proofs: Checked Layouts and Memoised Parallel Calls

William Kirkman-Moller
3 links
Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
preprint

X Proofs: Checked Layouts and Memoised Parallel Calls

William Kirkman-Moller
preprint en

Abstract

X Proofs provides mechanised semantic models for X’s ten language constructs in Lean 4. We prove preservation results for record-layout translation and concurrent memoisation, then combine them. For records stored in separate columns, we prove that layout translation preserves values, observations and the first invariant failure. The theorem covers writes through borrowed fields, any finite number of fields and any Boolean record invariant. For memoised calls, we prove that every completed response equals the uncached result when lookup and publication are atomic, even with simultaneous misses and colliding entries. We compose the two results to cover successful record updates followed by read-only calls. We prove that a decoded write and guard satisfying our validation criterion have the same outcome as the source write, then apply the checker to selected LLVM output. Tests of compiled X programs and executable counterexamples show why correctness depends on tracking record owners, checking each write immediately and comparing complete cache keys. Repository: https://github.com/WillKirkmanM/x-proofs

Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon