Papers › Programming Really Is Simple Mathematics
Programming Really Is Simple Mathematics
Bertrand Meyer, Reto Weber
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A re-construction of the fundamentals of programming as a small mathematical theory (PRISM) based on elementary set theory. Highlights: ∙ Zero axioms. No properties are assumed, all are proved (from standard set theory). ∙ A single concept covers specifications and programs. ∙ Its definition only involves one relation and one set. ∙ Everything proceeds from three operations: choice, composition and restriction. ∙ These techniques suffice to derive the axioms of classic papers on the "laws of programming" as consequences and prove them mechanically. ∙ The ordinary subset operator suffices to define both the notion of program correctness and the concepts of specialization and refinement. ∙ From this basis, the theory deduces dozens of theorems characterizing important properties of programs and programming. ∙ All these theorems have been mechanically verified (using Isabelle/HOL); the proofs are available in a public repository. This paper is a considerable extension and rewrite of an earlier contribution [arXiv:1507.00723]
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections