The Church-Rosser property in dual combinatory logic
Katalin Bimbó
Abstract
Katalin Bimbó
Abstract
Abstract Dual combinatorsemerge from the aim of assigning formulas containing ← as types to combinators. This paper investigates formally some of the properties of combinatory systems that include both combinators and dual combinators. Although the addition of dual combinators to a combinatory system does not affect the unique decomposition of terms, it turns out that some terms might be redexes in two ways (with a combinator as its head, and with a dual combinator as its head). We prove a general theorem stating thatno dual combinatory system possesses the Church-Rosser property. Although the lack of confluence might be problematic in some cases, it is not a problemper se. In particular, we show that no damage is inflicted upon thestructurally free logics, the system in which dual combinators first appeared.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract Dual combinatorsemerge from the aim of assigning formulas containing ← as types to combinators. This paper investigates formally some of the properties of combinatory systems that include both combinators and dual combinators. Although the addition of dual combinators to a combinatory system does not affect the unique decomposition of terms, it turns out that some terms might be redexes in two ways (with a combinator as its head, and with a dual combinator as its head). We prove a general theorem stating thatno dual combinatory system possesses the Church-Rosser property. Although the lack of confluence might be problematic in some cases, it is not a problemper se. In particular, we show that no damage is inflicted upon thestructurally free logics, the system in which dual combinators first appeared.
Key concepts: Combinatory logic, Dual (grammatical number), Property (philosophy), Computer science, Mathematics, Algebra over a field, Programming language, Pure mathematics