Confluence of an extension of combinatory logic by Boolean constants
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Dokumenter
- Confluence of an extension of combinatory logic by Boolean constants
Forlagets udgivne version, 513 KB, PDF-dokument
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.
| Originalsprog | Engelsk |
|---|---|
| Titel | 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017 |
| Redaktører | Dale Miller |
| Antal sider | 16 |
| Forlag | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| Publikationsdato | 1 sep. 2017 |
| Artikelnummer | 14 |
| ISBN (Elektronisk) | 9783959770477 |
| DOI | |
| Status | Udgivet - 1 sep. 2017 |
| Begivenhed | 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017 - Oxford, Storbritannien Varighed: 3 sep. 2017 → 9 sep. 2017 |
Konference
| Konference | 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017 |
|---|---|
| Land | Storbritannien |
| By | Oxford |
| Periode | 03/09/2017 → 09/09/2017 |
| Navn | Leibniz International Proceedings in Informatics |
|---|---|
| Vol/bind | 84 |
| ISSN | 1868-8969 |
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
Ingen data tilgængelig
ID: 194818826