Hi.
I am trying to install haskell on FC3 following the instructions from
http://www.haskell.org/fedora/ I copied the lines:
[EMAIL PROTECTED] ~# cat /etc/yum.repos.d/haskell.repo
[haskell-stable]
name=Haskell Packages (stable)
baseurl=http://haskell.org/fedora/haskell/$releasever/$basearch/RPMS
Hi Emil,
The reason has to do with the definitions of (>>=) for Writer and
(WriterT m). Looking at Control.Monad.Writer (ghc-6.2.2),
newtype Writer w a = Writer { runWriter :: (a, w) }
instance (Monoid w) => Monad (Writer w) where
m >>= k = Writer $ let
(a, w) = runWri
On Tue, 2005-02-15 at 07:42 -0800, John Meacham wrote:
> On Wed, Feb 16, 2005 at 12:42:08AM +1100, Manuel M T Chakravarty wrote:
> > On Mon, 2005-02-14 at 19:17 -0800, John Meacham wrote:
> > > I believe there is a realationship between GADTs and class assosiated
> > > types which hints at a much
Hello,
I have a huge space leak in a program due to laziness in the writer monad. Now
when I'm trying to examine the behaviour of writer I get a bit puzzled by the
following program:
foo :: MonadWriter [Int] m => Int -> m ()
foo n = do tell [n]
foo $ n+1
test = (snd
On Wed, Feb 16, 2005 at 12:42:08AM +1100, Manuel M T Chakravarty wrote:
> On Mon, 2005-02-14 at 19:17 -0800, John Meacham wrote:
> > I believe there is a realationship between GADTs and class assosiated
> > types which hints at a much simpler implementation of class assosiated
> > types (CATs) and
On Tue, 2005-02-15 at 10:16 +, Keean Schupke wrote:
> Perhaps i'm being dumb, but I dont see the need for either GADTs or
> class-associated-types to do this... I am pretty sure it can be done
> using fundeps,
Yes, you can encode this example with functional dependencies (see
Section 3.4 of
On Mon, 2005-02-14 at 19:17 -0800, John Meacham wrote:
> I believe there is a realationship between GADTs and class assosiated
> types which hints at a much simpler implementation of class assosiated
> types (CATs) and possibly a lessoning of the constraints mentioned in
> the paper.
It is true t
On Mon, 14 Feb 2005 12:27:51 -0500, robert dockins
<[EMAIL PROTECTED]> wrote:
> [Dijkstra's] algorithm relies pretty fundamentally on mutability, which makes
> it
> a less than wonderful fit for a functional language. If you want to
> use this algorithm in particular, I would recommend a mutabl
On Mon, 14 Feb 2005 15:00:17 +0100
RCP-Software <[EMAIL PROTECTED]> wrote:
> For input and output I need an appropriate graph representation. It
> should be as simple to implement as possible - speed and memory
> consumption does not matter. The graph consists of vertices (including
> the sourc
John Meacham wrote:
The main advantage of this translation over the one in the paper is that
it is not intertwined with the dictionary generation and typeclass
desugaring code, which is pretty hairy to begin with. Rather it is an
orthogonal transformation so hopefully will be easier to implement
wi
On Tue, Feb 15, 2005 at 10:16:49AM +, Keean Schupke wrote:
> Perhaps i'm being dumb, but I dont see the need for either GADTs or
> class-associated-types to do this... I am pretty sure it can be done
> using fundeps,
> using the techniques from the HList paper... of course I haven't coded
>
Perhaps i'm being dumb, but I dont see the need for either GADTs or
class-associated-types to do this... I am pretty sure it can be done
using fundeps,
using the techniques from the HList paper... of course I haven't coded
it yet so there
might be some problem I haven't considered.
By the way O
12 matches
Mail list logo
