An abstract factorization theorem for explicit substitutions

Beniamino Accattoli (1, 2)

1 PARSIFAL - Proof search and reasoning with logic specifications
2 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

We study a simple form of standardization, here called factorization, for explicit substitutions calculi, i.e. lambda-calculi where beta-reduction is decomposed in various rules. These calculi, despite being non-terminating and non-orthogonal, have a key feature: each rule terminates when considered separately. It is well-known that the study of rewriting properties simplifies in presence of termination (e.g. confluence reduces to local confluence). This remark is exploited to develop an abstract theorem deducing factorization from some axioms on local diagrams. The axioms are simple and easy to check, in particular they do not mention residuals. The abstract theorem is then applied to some explicit substitution calculi related to Proof-Nets. We show how to recover standardization by levels, we model both call-by-name and call-by-value calculi and we characterize linear head reduction via a factorization theorem for a linear calculus of substitutions.

Domaines: Logique en informatique [cs.LO]

Beniamino Accattoli. An abstract factorization theorem for explicit substitutions. 23rd International Conference on Rewriting Techniques and Applications (RTA'12), May 2012, Nagoya, Japan. ⟨hal-00780344⟩