Church-Rosser theorem for a rewriting system on categorical combinators
type: Item
instance of: scholarly article
title: Church-Rosser theorem for a rewriting system on categorical combinators
zbMATH Open document ID: 0672.03006
DOI: 10.1016/0304-3975(89)90104-7
author: Hirofumi Yokouchi
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
review text: The author addresses the problem of studying the Church-Rosser problem for a rewriting system based on categorical combinators. The results presented are interesting because those combinators are used in functional programming languages and their abstract machines. It is shown that CCL\(\beta\) is non-confluent, but some subsystems are confluent.
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 4099257
zbMATH Keywords: combinatory logic
zbMATH Keywords: Church Rosser theorem
zbMATH Keywords: confluence
zbMATH Keywords: rewriting system
zbMATH Keywords: categorical combinators
zbMATH Keywords: functional programming languages
reviewed by: Alberto Pettorossi
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90104-7
OpenAlex ID: W2077462786
cites work: Q3785893
cites work: Categorical combinators
cites work: Proof of termination of the rewriting system SUBSET on CCL
cites work: Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
Recommended article: On the Church-Rosser property for the direct sum of term rewriting systems
Recommended article: The Church Rosser theorem for strong reduction in combinatory logic
Recommended article: Q4649558
Recommended article: On the efficiency of categorical combinators as a rewriting system
Recommended article: The Church-Rosser property in symmetric combinatory logic
Recommended article: A Rewriting System for Categorical Combinators with Multiple Arguments
Recommended article: Church-Rosser theorem for typed functional systems
Recommended article: Categorification, term rewriting and the Knuth-Bendix procedure
Recommended article: Church-Rosser property for conditional rewriting systems with built-in predicates as premises
description: scientific article; zbMATH DE number 4099257