On 12/22/06, Reto Kramer [EMAIL PROTECTED] wrote:
What I'm really looking for is not so much the chaining of StateT
compositions, but rather the isolation of StateA from StateB while
they both flow from the search loop into the respective library calls
(foo, bar) transparently to the application
Cafe Crew --
I posted my simple-but-slow solution to Ruby Quiz problem #2:
http://mult.ifario.us/articles/2006/12/22/secret-santas-in-haskell-iii-collect-reap-repeat
(Or http://tinyurl.com/y3l2re if your mail client messes up the URL...)
It's more than practically fast enough unless you have,
I think I've decided that this isn't the right time for me to take the
lead on this book-writing project, and in addition, I've come to think
that maybe the things *I'd* like to say about Haskell hacking can't be
transmitted so easily in book form. However, if any others would like
to organize
G'day all.
Quoting Sebastian Sylvan [EMAIL PROTECTED]:
There are of course other real world scenarios. For example you may
have competitors. I currently write C++ for my day job because in my
industry (games) speed is a major bullet point on which you get
judged.
I have a suspicion that
G'day all.
Quoting Tomasz Zielonka [EMAIL PROTECTED]:
I think it's high time to remind the very true Hoare's words:
Premature optimization is the root of all evil in programming
It's strange nobody mentioned it earlier.
You have yeard it said in the past that the three rules of
Another option is to use the HList library (though this can involve a
learning curve). Essentially your monad is a state monad and its state
is a big tuple constrained to contain at least whichever types you ask
of it. Consider
foo :: (HOccurs StateA st, ...other HList properties..., MonadState
On Fri, Dec 22, 2006 at 06:16:03PM +0100, Joachim Durchholz wrote:
* Forcing the expressions that get written out means that I cannot use
lazy evaluation freely. In particular, if some library code returns a
data structure that contains a lazy-infinite subexpression, serializing
it would
On Tue, Dec 19, 2006 at 06:19:25PM +, Neil Mitchell wrote:
Imagine you are writing a version control client, people will complain
because certain operations take 100's of years on their big Haskell
repo. [I use Hugs, and complain that darcs on the Yhc repo sometimes
goes into virtual
