z-logo
open-access-imgOpen Access
Abstract Conditions for the Confluence of Explicit Substitution Calculi
Author(s) -
Amelia Râştei
Publication year - 2005
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2004.05.016
Subject(s) - confluence , substitution (logic) , mathematical proof , property (philosophy) , mathematics , substitution method , pure mathematics , computer science , discrete mathematics , programming language , geometry , philosophy , telecommunications , epistemology
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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom