Pearls of Functional Algorithm Design

Category: Programming
Author: Richard Bird
3.8
All Hacker News 14

Comments

by anonymous   2018-08-01
@user633183 unfortunately, no; I saw it in the book itself, [Pearls of Functional Algorithm Design](https://www.amazon.com/dp/0521513383). the "look inside" can be searched for "foldrn" (the definition is on pg.42).
by anonymous   2017-10-15
@dfeuer https://www.amazon.com/Pearls-Functional-Algorithm-Design-Richard/dp/0521513383/ref=asap_bc?ie=UTF8
by tel   2017-08-19
If you like this then you should check out the source, Richard Bird's book [0] for it and many other similar examples.

[0] http://www.amazon.com/Pearls-Functional-Algorithm-Design-Ric...

by tel   2017-08-19
It's worth noting that Djikstra (to my understanding) thought almost none of that was even contained in the field of CS. His perspective was that CS was about process and verification and proof and thus while the current implementation of computers is interesting, it didn't deserve any privilege.

So being able to prove certain nice properties about algorithms without worrying about the underlying implementation is exactly what Djikstra believed important and something that Haskell does allow you to do... even if the result is abysmal performance.

It's worth noting as well that there's a whole wonderful book [1] that provides a great glimpse of good Haskell style with the conceit that one should program the most abysmally slow correct thing first and then use algebraic theories to transform it along obviously correct paths to something highly performant.

[1] http://www.amazon.com/Pearls-Functional-Algorithm-Design-Ric...

by radicality   2017-08-19
"Pearls of functional algorithm design" [0] is a fantastic book if you are interested in some more equational reasoning, I highly recommend it.

[0] http://www.amazon.co.uk/Pearls-Functional-Algorithm-Design-R...