Church-Rosser theorem for a rewriting system on categorical combinators
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.
scientific article; zbMATH DE number 4099257
scientific article