Skip to content
Book Open access

Assignment Has Never Existed: Programs Have Always Been Difference Equations

Oct 2026 · Proceedings of the 2026 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software · 0 citations · 56 references

Abstract

The assignment statement x = x + 1 is a difference equation with its time index removed. Program verification research has shown that restoring the index simplifies reasoning, but only specification languages have incorporated this idea. We present , a programming language that uses difference equations with a time index, x’ = x + 1, instead of assignments. This has four benefits: source order is not significant for equations, which simplifies reasoning; imperative style thinking and efficient mutation are retained, while reasoning remains simple; loop transition relations may be read off the body with frame conditions supplied by the notation, reducing proof bookkeeping; and the same notation supports reasoning from introductory trace tables to two-state relational Hoare proofs. Further, applies difference equations to arbitrary data types: arrays, sets, dictionaries, and pointer structures, making it a general-purpose language rather than a numerical-methods formalism. Examples spanning sorting, graph algorithms, and low-level pointer manipulation show where can make updates order-independent to simplify reasoning, and where sequencing or convergence arguments remain necessary.

Read PDF

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.