Church-Rosser theorem for a rewriting system on categorical combinators (Q1119562): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Church-Rosser theorem for a rewriting system on categorical combinators |
scientific article |
Statements
Church-Rosser theorem for a rewriting system on categorical combinators (English)
0 references
1989
0 references
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.
0 references
combinatory logic
0 references
Church Rosser theorem
0 references
confluence
0 references
rewriting system
0 references
categorical combinators
0 references
functional programming languages
0 references
