Publication details

Saarland University Computer Science

Hilbert's Tenth Problem in Coq

Dominique Larchey-Wendling, Yannick Forster

Technical Report, February 2019 (to appear)

We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq’s constructive type theory. To do so, we give the first full mechanisation of the Davis-Putnam-Robinson-Matiyasevich theorem, stating that every recursively enumerable problem – in our case by a Minsky machine – is Diophantine. We obtain an elegant and comprehensible proof by using a synthetic approach to computability and by introducing Conway’s FRACTRAN language as intermediate layer

Coq formalisation available here.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy