1,806 reputation
712
bio website
location
age 20
visits member for 2 years
seen 20 mins ago

Mar
23
awarded  Yearling
Mar
11
answered How does persistence fit into a purely functional language?
Mar
10
comment How does persistence fit into a purely functional language?
The Query and Update monads are pretty far removed from IO, actually. I'll try to give a simple example in an answer.
Mar
1
comment How does persistence fit into a purely functional language?
Perhaps it would be helpful to look at the design of various persistence libraries in Haskell; in particular, acid-state seems to be close to what you are describing.
Feb
23
answered What is the difference between dependent typing and contracts?
Feb
11
comment An alternative to an array of functions?
I think it's worth noting that you're basically creating a so-called "structural object" here, so any existing work on doing structural OO in PHP should be of help to you.
Jan
25
comment Why doesn't Haskell have a 'format' function for string interpolation?
You can also use shakespeare-text, which may be of interest to you.
Jan
20
awarded  Nice Answer
Jan
8
awarded  Nice Answer
Dec
31
awarded  Informed
Nov
1
comment Non-trivial functions that operate on any monad
Just to note, your bindFold is normally called sequence, and can be made generic over all Applicatives, not just Monads. The same goes for the more general version traverse.
Oct
5
comment Functional programming and stateful algorithms
@bigstones Perhaps this library will be helpful to you?
Oct
5
comment Functional programming and stateful algorithms
@Philipp I disagree. An automaton or state machine is sometimes the most natural and accurate way to represent a problem, and functional automata are well studied.
Oct
4
comment Functional programming and stateful algorithms
I, for one, would love to see the code that you've been trying to work with. In the absence of that, my best advice is that Haskell's laziness can often be exploited to not compute things more than once. Look into so-called "tying the knot" and lazy value recursion, although your problem is likely simple enough that the more advanced techniques that take advantage of infinite values and similar things would be overkill, and would probably just confuse you right now.
Oct
1
awarded  Guru
Sep
30
comment What can Haskell's type system do that Java's can't and vice versa?
@AndresF. I wouldn't call it a syntactic difference, but it's not a type system difference, more of a standard library difference. Java could easily (well, "easily") have chosen to use some kind of effect-tracking system, since it's type system is already powerful enough to handle it.
Sep
30
revised What can Haskell's type system do that Java's can't and vice versa?
fixed grammar
Sep
30
suggested suggested edit on What can Haskell's type system do that Java's can't and vice versa?
Sep
30
comment What can Haskell's type system do that Java's can't and vice versa?
@DarkOtter I'm aware of Typeable, but Haskell 2010 does not have it (maybe Haskell 2014 will?).
Sep
30
comment What can Haskell's type system do that Java's can't and vice versa?
@awashburn Thanks! This is fixed now.