Thanks, and it works! Another question is where can I find some
documentation on these heap modules? What is the difference
between SkewHeap, LazyPairingHeap, SplayHeap, UnbalancedSet, etc?
I couldn't find any in GHC's documentation.
Regards,
.paul.
On Tue, Jul 30, 2002 at 11:22:26AM -0700, Bri
The author of edison, Chris Okasaki, wrote a book called "Purely
Functional Data Structures" (Cambridge University Press). It goes a long
way toward explaining the rationale of many of the structures.
On Wed, 31 Jul 2002 [EMAIL PROTECTED] wrote:
> Thanks, and it works! Another question is wher
Hi, I'm experimenting with various implementations of finite automata.
I think the following is interesting, but gives rise to a question,
which might actually be silly. (Forgive me if it is.)
First, I can define a state as a recursive data type:
data FaState l = FaState {label :: l, acceptQ ::
I'm sorry, there was a subtle error in the definition of the function
finAuDeterminize in my posting, which caused genuine performance
trouble! Replace sort by (sort.nub). That is:
finAuDeterminize :: (Ord l) => FinAu l -> FinAu [l]
finAuDeterminize startStates = [f startStates]
where f ::
Hi all,
I'm looking to purchase one (perhaps two) books for my collection. I'm
looking for two things in particular:
- good algorithmic reference
- good explanation of the meat of haskell (advanced stuff)
I don't care about introductory stuff; I've written tens of thousands of
lines of Has
A book which i absolutly love for learning haskell is
"An Introduction to Functional Programming Systems Using Haskell" by
A J T Davie (cambridge press)
I dont know if other peoples experiences were similar but it took me
about three tries to actually learn haskell, after which a light went on
an
G'day all.
On Wed, Jul 31, 2002 at 04:03:46PM -0700, Hal Daume III wrote:
> I'm not afraid of math (it was my undergraduate degree) and rather enjoy
> theorems, but I'm also insanely practical and am interested in a book
> which has a large section on *efficiency*.
You might want to look throug
Daniel Crealer writes:
>I came across interesting concept of monad, and that is
>what inspired the following idea. I would just like to know if anyone
>thinks it's interesting and if someone has already developed it.
Yes it is interesting, and the fact that you thought of it might mean
you hav
Chris Okasaki's book "Purely Functional Data Structures" is not on
Haskell per se, but it addresses data structures (and efficiency
issues) from a higher level than the typical introductory FP book.
All the data structures and code are available in Haskell in
an appendix (and on-line). Amazon has
