Skip to main content
17 events
when toggle format what by license comment
S Apr 23, 2014 at 3:17 history bounty ended 200_success
S Apr 23, 2014 at 3:17 history notice removed 200_success
Apr 22, 2014 at 7:20 history edited Jamal CC BY-SA 3.0
deleted 2 characters in body; edited tags
Apr 22, 2014 at 7:13 answer added max taldykin timeline score: 12
S Apr 15, 2014 at 23:59 history bounty started 200_success
S Apr 15, 2014 at 23:59 history notice added 200_success Draw attention
Feb 19, 2014 at 0:45 history edited syb0rg
edited tags
Feb 18, 2014 at 6:55 comment added PressingOnAlways I don't know Haskell, but I know if I were approaching this problem in a language I'm familiar with, I would write tests whether it be unit tests or integration tests to determine if it works as expected. Run it through its paces and assert that you don't get overflows and the stack responds properly.
Sep 2, 2013 at 19:04 comment added Ms. Molly Stewart-Gallus Performance is only a side point. The point is semi-deterministic allocation of memory (which will also be neat for debugging.) For that reason just using a list is incorrect.
S Jul 23, 2013 at 11:15 history suggested Aseem Bansal CC BY-SA 3.0
Removed redundant language tag
Jul 23, 2013 at 10:47 review Suggested edits
S Jul 23, 2013 at 11:15
Apr 9, 2013 at 13:29 comment added jpaugh Actually, a list is a stack: it's biased toward accessing the first element. And, [] is a Monad... and likely heavily optimized, although it is not as fast as, say a Vector.
Jun 16, 2012 at 5:51 history edited Rahul Gopinath CC BY-SA 3.0
Got rid of extra spaces
May 5, 2012 at 19:57 comment added FUZxxl Did you tried out an implementation where the stack is just a plain list? Letting the runtime do the work for you is usually faster.
Apr 19, 2012 at 8:08 history tweeted twitter.com/#!/StackCodeReview/status/192887330590306305
Apr 19, 2012 at 5:24 history edited Ms. Molly Stewart-Gallus CC BY-SA 3.0
I fixed a tiny typo.
Apr 19, 2012 at 5:13 history asked Ms. Molly Stewart-Gallus CC BY-SA 3.0