hi,
both of the data structures are based on Adams' balancing algorithm
which contains a bug -- at least in its proof. (Perhaps it is
correct, but I don't know anyone that knows if.)
Instead of fixing the bug I have re-derived the algorithm from the
invariant together with a (now hopefully corre
$ ghc -O -O2-for-C -fvia-c -o teiler teiler.hs
panic! (the `impossible' happened):
funResultTy t{-r270-}
Please report it as a compiler bug to [EMAIL PROTECTED]
$ gcc -dumpversion
2.95.2
$ ghc --version
The Glorious Glasgow Haskell Compilation System, version 4.05, patchlevel
0
it w
