Church-Rosser theorem for a rewriting system on categorical combinators (Q1119562): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(89)90104-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077462786 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3785893 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Categorical combinators / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proof of termination of the rewriting system SUBSET on CCL / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL / rank | |||
Normal rank | |||
Latest revision as of 14:13, 19 June 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
