Hacker News new | past | comments | ask | show | jobs | submit | more doelie_'s comments login

I like Daniel Ingram's approach. He has a strong focus on the essence, and bypasses a lot of Buddhist dogma that seems to get in the way for westerners.

http://www.dharmaoverground.org/web/guest/dharma-wiki/-/wiki...


The "persuasive" approach is reminiscent of the basic techique in Vipassana meditation: focus on a particular sensation (breath at the tip of the nose, tingling sensations in right toe, ...) and whenever that focus drifts off, just bring it back. Rinse, repeat.


http://zwizwa.be/-/libprim/

Lisp in 3 stages: primitive data, composite data, composite functions.


There is no good freelancing site that caters to bigger companies for i.e. embedded development that requires (part-time) on-site work. The companies have a hard time finding good consultants, and vice versa. Many locally acting middle men make a lot of money from this possibly easy-to-solve communication problem.


Concatenative / point-free style? Guy already suggests this on p.68. Paraphrased, if data can be chopped in pieces, maybe code can too?


I'd like to see somebody one-up this and say ``and lambda!''. What I mean is restricting explicit recursion/loops to combinators which respect algebraic laws (i.e. Backus's FP/FL) in order to get a better grip on program transformation to reach efficient implementation. Guy already hints at this by stressing the importance of MapReduce.



Brilliant, thanks. I'll have to have a play with that.


While you're at it, check out http://piumarta.com/ ;)


Indeed. The peg parser generator is quite nice: http://piumarta.com/software/peg/

I recently used it to implement an s-expression reader: http://zwizwa.be/darcs/libprim/ex/sexp.leg

(It's incomplete, but it illustrates the principle: peg parsing is very nice for quick & dirty parsing work.)


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: