I think the deeper problem - an I am reading Computational Reflections by Cantwell Smith and that might be colouring my view - is that fundamentally it comes down to the interpretation of what the code or the math says.
The very meaning of interpretation in computer science is at odds with the use in philosophy of language and that is symptomatic.
We're still fundamentally trying to advance Hilbert's program. It's like Göedel's work hasn't sunk in to our collective reasoning about reasoning. It just doesn't seem possible to build a self contained correct and truthful system of symbolic logic. Truth is in the relationship of the system with other systems.
Automating mathematics, like automating software engineering, or automating automation, are all self contradictory propositions. Anything of what we build only ever means anything in how it interacts with us. I mean, people will go round and round in this forum discussing semantics and the meta implication of these unceasing discussions never seems to hit home. Namely, that there is no universal, truthful, correct, system of symbolic logic. It seems in fact impossible to have one. But the results that indicate this impossibility are built with a system of symbolic logic and the validity therein is contingent on people's understanding and, like all symbolic logic systems (including the ones that states the limits to universal symbolic logic systems) they are bootstrapped from axioms one must chose at the start or by default and they can never be fully proved by the very system built atop them.
Gödel incompleteness work has indeed an effect on Lean. Lean cannot prove that the kernel itself is valid; you would need a system "greater" than dependent-type theory, or bigger than Proof Calculus [1] [2], for this.
[1] https://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspon...
> self contained
This is a totally unnecessary requirement, noticed by Alfred Tarski roughly two seconds after Göedel's work was announced.
If you don't personally find formal reasoning useful in proving correctness, that's a you problem. The rest of us are progressing forward just fine.
As an ex- mathematician and ex- computer scientist who worked in programming language theory and computer algebra systems, I can assure you that we think about these problems deeply. In fact, outside of a few strongly normalizing toys, the first thing we do in PLT is drop completeness in favor of soundness. The article itself discusses this (the soundness issues that were addressed).
Although, now I'm charmed about the idea of a programming language -- possibly a Brainfuck descendent? -- that drops soundness for completeness.