Church-Rosser theorem for a rewriting system on categorical combinators (Q1119562)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Church-Rosser theorem for a rewriting system on categorical combinators |
scientific article; zbMATH DE number 4099257
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Church-Rosser theorem for a rewriting system on categorical combinators |
scientific article; zbMATH DE number 4099257 |
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
0.90004265
0 references
0.8944769
0 references
0.88473666
0 references
0.8832375
0 references
0.88040054
0 references
0.8803959
0 references
0.87502295
0 references
