3 ms·
> "helps write more correct code faster due to the rich type-system" -- which is formal verification No it's not. It's an informal probabilistic statement bas
by tome 11y ago
> "helps write more correct code faster due to the rich type-system" -- which is formal verification
No it's not. It's an informal probabilistic statement based on induction, not formal reasoning based on deduction. Stop trolling.
- pron 11y ago> not formal reasoning based on deduction Formal verification is not the same as deductive proof. Some formal methods produce "probabilistic statements based on induction".
- tome 11y agoYou know what? I'd like to ask you a personal question. What is it that motivates you, at the same time as introducing interesting and pertinent details to a discussion, to be so negative and condescending about other people's choice of technologies? You are clearly very intelligent and well educated. Why do you feel the need to do this? I can't for the life of me understand where this is coming from. Do you not realise how aggravating it is for the other parties in the discussion? You have plenty to contribute by mentioning interesting technologies like TLA+ and your threading implementation. Why do you have to dump on other people at the same time?
- tome 11y agoAh right. It's you who gets to define the word "verification" and Haskell is aiming to do it, yet failing to do it, whether its creators and proponents like it or not. An easy way to both start and win an argument!
- tome 11y agoSeeing you edit this post once every five minutes is really quite jarring.