I'm a real newbie to Haskell, and I'm having trouble with a particular problem
dealing with higher-order functions.
Exercise 5.9 in Hudak's "School of Expression" asks us to write a function,
"makeChange," s.t. it makes change for a given amount using coins in a coin
supply (represented by a li
Sengan Baring-Gould wrote:
> http://www.catb.org/~esr/writings/taoup/html/ch01s06.html
>
> states that "debugging often occupies three-quarters or more
> of development time". I don't think that is my experience
> in Haskell... more like 1/4 at most. I was wondering what
> others felt.
Me eithe
Eh, state is not possible. This is a recursive state space search. I need
to branch the state of the game and not allow branches to effect others.
Though I'd really like to represent them as arrays like such:
data Player = Red | Green | Blue deriving (Enum,Eq,Ix)
data Ticket = Taxi | Bus | Undergr
http://www.catb.org/~esr/writings/taoup/html/ch01s06.html
states that "debugging often occupies three-quarters or more of development time".
I don't think that is my experience in Haskell... more like 1/4 at most. I was
wondering what others felt.
Sengan
_
[moved to haskell-cafe]
While I largely agree with what Nils said, it does seem that arrays are a good match
for your application. It is true, unfortunately, as you're discovering, that
mutable arrays are awkward in a pure functional language. I think the most
appropriate way to deal with them w
