3 ms·
Absolutely false. We have a large number of machine-checked proof that are 100% "filled in". As a trivial example that a fair number of CS people might have be
by wyager 12y ago
Absolutely false. We have a large number of machine-checked proof that are 100% "filled in".
As a trivial example that a fair number of CS people might have been exposed to: every time someone compiles an Agda program, the compiler does a complete formal proof that the program is total and terminating.