Spinal Atomic Lambda-Calculus
David Sherratt, Willem Heijltjes, Tom Gundersen, Michel Parigot · Lecture notes in computer science · 2020
Abstract We present the spinal atomic $$\lambda $$ λ -calculus, a typed $$\lambda $$ λ -calculus with explicit sharing and atomic duplication that achieves spinal full laziness: duplicating only the direct paths between a binder and bound variables is enough for beta reduction to proceed. We show this calculus is the result of a Curry–Howard style interpretation of a deep-inference proof system, and prove that it has natural properties with respect to the $$\lambda $$ λ -calculus: confluence and preservation of strong normalisation.