A Simplified Suspension Calculus and its Relationship to Other Explicit Substitution Calculi
Andrew Gacek, Gopalan Nadathur

TL;DR
This paper simplifies and rationalizes the suspension calculus for explicit substitutions in lambda calculus, making it more practical and theoretically robust, and compares it with other systems to understand their properties.
Contribution
The paper introduces a simplified, rationalized version of the suspension calculus that supports logical analysis and has strong theoretical properties, and it classifies various explicit substitution calculi.
Findings
Simplified encoding of substitution composition.
The modified calculus supports logical analyses and type assignments.
The calculus exhibits strong termination and confluence properties.
Abstract
This paper concerns the explicit treatment of substitutions in the lambda calculus. One of its contributions is the simplification and rationalization of the suspension calculus that embodies such a treatment. The earlier version of this calculus provides a cumbersome encoding of substitution composition, an operation that is important to the efficient realization of reduction. This encoding is simplified here, resulting in a treatment that is easy to use directly in applications. The rationalization consists of the elimination of a practically inconsequential flexibility in the unravelling of substitutions that has the inadvertent side effect of losing contextual information in terms; the modified calculus now has a structure that naturally supports logical analyses, such as ones related to the assignment of types, over lambda terms. The overall calculus is shown to have pleasing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · semigroups and automata theory · Advanced Algebra and Logic
