News for hackers. Stuff that matters.

A comment on The Most Important Algorithms. Parent comment

Re:The Most Important Algorithms by igravious on Tuesday July 06, 2010 @04:15AM (#1490352)
Hi nostrademons, do you mind if I put this observation onto Wikipedia if it is not already there? I would add the cyclic/acyclic observation of sb's reply also. http://en.wikipedia.org/wiki/Graph_traversal is just a stub, it could nearly go there.
[ Parent | on HN ]
Re:The Most Important Algorithms by nostrademons on Tuesday July 06, 2010 @04:39AM (#1490391)
I don't mind, but I'm guessing it'll get tagged with [citation needed], and I don't know what an appropriate citation for it is.
[ Parent | on HN ]
Re:The Most Important Algorithms by jewbacca on Tuesday July 06, 2010 @08:04AM (#1490711)
The extent of my experience on the topic is in half-comprehending hobbyist's awe and the inclusion of okmij on my "personal heroes and demigods" list. The only word I could half-heartedly associate with this structure is the incredibly lame "hylomorphism"... which actually kinda generally expresses the pattern of much of computing. It's 5 AM and I'm going to sleep, but I'll leave you with the the most plausible leaves of a very brief search towards finding some recognized formal name for this structure:

http://blog.sigfpe.com/2009/07/monad-for-combinatorial-searc... http://spivey.oriel.ox.ac.uk/mike/search-jfp.pdf http://www.cs.au.dk/~gerth/papers/jfp96.pdf

If you really don't like yourself, try digging here:

http://hackage.haskell.org/packages/archive/pointless-haskel... http://comonad.com/reader/2009/recursion-schemes/

[ Parent | on HN ]