|
|
|
|
|
by crimsonalucard
2351 days ago
|
|
All right I'll give you that on evaluation order. Did not realize that Haskell took it two steps further. Logical Proofs are possible for most things that have logical definitions. There are aspects of FP that can be enforced in your proof. You don't have to have a vague definition of good design or a vague definition of FP. Follow a strict but commonly agreed upon definition of both and derive a proof from there. It's very possible. |
|
There is no such definition, just like there isn't one for OO. You could of course make one up and then test it qualitatively, but that's far & away from a proof.
I don't believe a 'proof' for something like this exists, if you disagree, I challenge you to find such a proof, or link to any resource describing one.