Thomas Jäger [EMAIL PROTECTED] writes:
I believe there may be some nasty interactions with generalized
newtype-deriving, since we can construct two Leibniz-equal types which
are mapped to different types using fundeps:
class Foo a where
foo :: forall f. f Int - f a
instance Foo
Adam Wyner [EMAIL PROTECTED] writes:
I am getting a pattern match failure, and then subsequent functions
which worked right work wrong. I am using Hugs and Trex.
The problem with subsequent evaluations is simple. When Hugs says this:
INTERNAL ERROR: Error in graph
it means that the whole
would the STM constructs in GHC 6.4 be suitable for your project?
jake
Hi Jake,
as far as I understand STM is does not exactly match my requirements - it
is meant
to support concurrent programming.
But it is a great reading - thanks for pointing that out to me!
I'll get to use it later when I
On 14/08/05, Carl Marks id2359 at yahoo.com wrote:
Is there any text/article which makes precise/rigorous/explicit
the connection between the category theoretic definition of
monad with the haskell implementation?
I did try to do this in my (rejected) paper A monadic
interpretation of tactics
Bayley, Alistair wrote:
I've fixed this now, so it should be quite a bit more usable. The code's in
the experimental branch, but it's all quite safe, except for the MS Sql
Server stuff, which is work-in-progress.
I've updated the Haddock docs, which should explain how to use everything.
Please
