Abstract
The aim of this paper is to give abstract properties of some calculi with explicit substitution which will be sufficient to prove their confluence. We define a property that we call "implementing a good notion of substitution." We show that calculi with explicit substitution having this property are confluent and their substitution reductions are also confluent. We test our theory with the well-known calculi of explicit substitution ?s, ?? and ?se. The latter is ?s with open terms. The property of implementing a good substitution is natural and characterizes a large number of calculi. Two conditions of this property are usually checked as an initial step in the proof for confluence. The third condition is new and is the key for our proofs of confluence. © 2005 Elsevier B.V. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 213-228 |
Number of pages | 16 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 123 |
DOIs | |
Publication status | Published - 1 Mar 2005 |
Event | 2004 5th Asian Control Conference - Melbourne, Australia Duration: 20 Jul 2004 → 23 Jul 2004 |
Keywords
- β-reduction
- Confluence
- Explicit substitution
- Good substitution
- Lambda calculi