Confluence properties of weak and strong calculi of explicit substitutions
- 1 March 1996
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 43 (2) , 362-397
- https://doi.org/10.1145/226643.226675
Abstract
Categorical combinators [Curien 1986/1993; Hardin 1989; Yokouchi 1989] and more recently λσ-calculus [Abadi 1991; Hardin and Le´vy 1989], have been introduced to provide an explicit treatment of substitutions in the λ-calculus. We reintroduce here the ingredients of these calculi in a self-contained and stepwise way, with a special emphasis on confluence properties. The main new results of the paper with respect to Curien [1986/1993], Hardin [1989], Abadi [1991], and Hardin and Le´vy [1989] are the following: (1) We present a confluent weak calculus of substitutions, where no variable clashes can be feared; (2) We solve a conjecture raised in Abadi [1991]: λσ-calculus is not confluent (it is confluent on ground terms only). This unfortunate result is “repaired” by presenting a confluent version of λσ-calculus, named the λ Env -caldulus in Hardin and Le´vy [1989], called here the confluent λσ-calculus.Keywords
This publication has 12 references indexed in Scilit:
- Theoretical Pearl Yet yet a counterexample for λ+SPJournal of Functional Programming, 1994
- Explicit substitutionsJournal of Functional Programming, 1991
- An abstract framework for environment machinesTheoretical Computer Science, 1991
- Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCLTheoretical Computer Science, 1989
- Church-Rosser theorem for a rewriting system on categorial combinatorsTheoretical Computer Science, 1989
- The categorical abstract machineScience of Computer Programming, 1987
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Minimal and Optimal Computations of Recursive ProgramsJournal of the ACM, 1979
- Lambda calculus with namefree formulas involving symbols that represent reference transforming mappingsIndagationes Mathematicae, 1978
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972