4 ms·
I think that's true for anyone who's comfortable with proofs by induction, but most people aren't until well past the point where they'd normally learn to progr
by joker3 8y ago
I think that's true for anyone who's comfortable with proofs by induction, but most people aren't until well past the point where they'd normally learn to program.
- noelwelsh 8y agoYou don't need to understand proof by induction to use these techniques. It's more than I have the energy to explain in a comment here, but the chapter on "Structural Recursion" at http://www.creativescala.org/creative-scala.pdf http://www.creativescala.org/creative-scala.pdf shows some of my thinking (though it has evolved a bit since that written.)
- skrishnamurthi 8y agoLooks rather like an abbreviated version of the _How to Design Programs_ design recipe to me…
- noelwelsh 8y agoIt sure is!
- skrishnamurthi 8y agoSure would have been nice to give credit, then… But more importantly, I can tell you that the design recipe isn't enough. That's why we set out to study the notional machine question (paper cited in another response). We most definitely need it too; what we're trying to figure out is what form of notional machine matches best.
- noelwelsh 8y agoYou're absolutely right on giving credit. I've added this: https://github.com/underscoreio/creative-scala/commit/6ecaa4b0c1d0eb3cf7402c0f611395f6aa9798a4 https://github.com/underscoreio/creative-scala/commit/6ecaa4... And thanks for mentioning the paper. I'll give it a read.