2026-07-24T01:59:22Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13910 2024-03-06T10:53:06Z ddc:004 open_access

Formalising a Turing-Complete Choreographic Language in Coq Cruz-Filipe, Luís Montesi, Fabrizio Peressotti, Marco Choreographic Programming Formalisation Turing Completeness The theory of choreographic languages typically includes a number of complex results that are proved by structural induction. The high number of cases and the subtle details in some of them lead to long reviewing processes, and occasionally to errors being found in published proofs. In this work, we take a published proof of Turing completeness of a choreographic language and formalise it in Coq. Our development includes formalising the choreographic language, its basic properties, Kleene’s theory of partial recursive functions, the encoding of these functions as choreographies, and a proof that this encoding is correct. With this effort, we show that theorem proving can be a very useful tool in the field of choreographic languages: besides the added degree of confidence that we get from a mechanised proof, the formalisation process led us to a significant simplification of the underlying theory. Our results offer a foundation for the future formal development of choreographic languages. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Luís Cruz-Filipe and Fabrizio Montesi and Marco Peressotti 2021 Is Part Of LIPIcs, Volume 193, 12th International Conference on Interactive Theorem Proving (ITP 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITP.2021.15 urn:nbn:de:0030-drops-139109 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2021.15 eng https://creativecommons.org/licenses/by/4.0/legalcode