文章基本信息

标题：Confluence of an Extension of Combinatory Logic by Boolean Constants
本地全文：下载
作者：Lukasz Czajka
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：84
页码：14:1-14:16
DOI：10.4230/LIPIcs.FSCD.2017.14
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We show confluence of a conditional term rewriting system CL-pc^1, which is an extension of Combinatory Logic by Boolean constants. This solves problem 15 from the RTA list of open problems. The proof has been fully formalized in the Coq proof assistant.
关键词：combinatory logic; conditional linearization; unique normal form property; confluence