3 ms·
Most of the time, that's tongue-in-cheek. On the other hand, when working with dependent types, the specification is a type, and if the theorem giving that spe
by eli_gottlieb 12y ago
Most of the time, that's tongue-in-cheek.
On the other hand, when working with dependent types, the specification is a type, and if the theorem giving that specification type-checks (ie: the "proof" is a program of the appropriate type), then the code is correct, period.
Of course, attempting to prove the theorem can be hair-pullingly frustrating and takes valuable time, but it will expose the assumptions and corner-case you weren't thinking clearly about.