Status of Ciaffaglione's "Towards Turing computability via coinduction"

[eerio]

Hey,

I want to ask someone who knows more than me about the status of formalizing undecidability proofs: from what I understand, in this repo we focus on constructing reductions between the different decidability problems, taking the undecidability of a couple of them as axioms. But in 2014, Alberto Ciaffaglione (https://doi.org/10.1016/j.scico.2016.02.004) managed to formalize the undecidabiliy of the halting problem using coinductive types in Coq. Would integrating that proof with the work done in this repo not be a big milestone for us?