Thanks Malcolm, that is a great explanation.
In this code, in fact we
managed to keep the lookup function pure, because the Binary interface
allows referentially-transparent I/O (getFAt), which may not be
possible in other serialisation libraries. This facility however
depends on an invariant t
Scott Weeks <[EMAIL PROTECTED]> writes:
> For a project that I'm working on I need to implement a B-Tree or
> similar disk based data structure for storing large amounts of data. I
> feel like I'm getting it and then I get hung up on disk IO operations
> and trying to figure out how they should
Hello all,
I'm a newbie and while I grasp some of the basics of FP I have yet to
really understand the guts of Haskell. The type system is starting to
clear up for me and so are Monads but I have a long way to go.
For a project that I'm working on I need to implement a B-Tree or
similar disk
Hello all,
(I'm resending this because I sent the first one without being a member
of the list and I'm assuming it bounced)
I'm a newbie and while I grasp some of the basics of FP I have yet to
really understand the guts of Haskell. The type system is starting to
clear up for me and so are M
