And a lot more bug prone. I'm just explaining the OP because people didn't get it. I'm not saying dynamic languages are bad. I'm saying they have different trade-offs.

[–] [email protected] 11 points 1 year ago* (last edited 1 year ago) (1 children)

The problem with formal proofs for code is that it assumes the spec/requirements are complete and bug-free.

I find most bugs come from missed or misinterpreted requirements.

[–] tatterdemalion 25 points 1 year ago* (last edited 1 year ago)

I have a feeling you are misunderstanding what is meant by "theorems for free" here. For example, one theorem that is proven by all safe Rust programs is that they don't have data races. That should always be a requirement for functional software. This is a more pragmatic type of automatic theorem proving that doesn't require a direct proof from the code author. The compiler does the proof for you. Otherwise the theorem would not be "free" as stated in OP.