533 reputation
28
bio website lambdageek.org
location Boston, MA
age 35
visits member for 3 years, 7 months
seen Sep 19 at 22:32

I used to prove things, now I compile things.


Dec
12
awarded  Nice Answer
May
18
awarded  Yearling
May
14
awarded  Nice Answer
May
18
awarded  Yearling
Nov
23
awarded  Critic
Nov
5
comment Local Stack vs Call Stack
For one thing, your heap (if you heap allocate the explicit stack) is a lot bigger than the call stack. So you can go deeper. Also if you bothered to rewrite a recursive algorithm into an iterative one with an explicit stack, you are often close enough so that with a minimum of additional effort you can manually wring out the tail-call optimization. At that point you win.
Oct
17
awarded  Organizer
Oct
17
revised what is the purpose of arrows?
add haskell tag
Oct
17
suggested approved edit on what is the purpose of arrows?
Oct
17
answered what is the purpose of arrows?
Aug
25
answered What is the most orthogonal programming language?
Jul
31
awarded  Nice Answer
Jul
26
answered How important are Haskell's advanced concepts like Monads and Applicative Functors for most routine programming tasks?
Jul
8
awarded  Teacher
Jun
27
comment Should I use “Business logic” term when speaking about non-business application?
I tend to call all the things you listed "algorithms"
Jun
8
awarded  Supporter
May
18
awarded  Autobiographer