Formalising a Turing-Complete Choreographic Language in Coq

02/04/2021
by   Luís Cruz-Filipe, et al.
0

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 and its basic properties, Kleene's theory of partial recursive functions, the encoding of these functions as choreographies, and proving this encoding 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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/26/2017

Proving Parikh's theorem using Chomsky-Schutzenberger theorem

Parikh theorem was originally stated and proved by Rohkit Parikh in MIT ...
08/12/2015

Syntax Evolution: Problems and Recursion

Why did only we humans evolve Turing completeness? Turing completeness i...
02/17/2021

Formalizing relations in type theory

Type theory plays an important role in foundations of mathematics as a f...
06/26/2018

Self-Reproducing Coins as Universal Turing Machine

Turing-completeness of smart contract languages in blockchain systems is...
07/05/2019

From LCF to Isabelle/HOL

Interactive theorem provers have developed dramatically over the past fo...
06/16/2020

On the Computational Power of Transformers and Its Implications in Sequence Modeling

Transformers are being used extensively across several sequence modeling...
01/07/2020

Understanding the QuickXPlain Algorithm: Simple Explanation and Formal Proof

In his seminal paper of 2004, Ulrich Junker proposed the QuickXPlain alg...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.