On Sat, 8 May 2004, andrew cooke wrote:
>
> I'm trying to write a simple fifo queue of fixed length (containing type
> Maybe a - it would be initialised to Nothings) where pushing an item pops
> the "last" item "off the end".
>
> data Queue a = QUEUE (Maybe a -> (Queue a, Maybe a))
>
> queue :: May
> On Sun, Apr 25, 2004 at 03:18:20PM -0400, S. Alexander Jacobson wrote:
> >
> >[..]
> > Dell's Poweredge servers address up to 32GB of
> > memory today! There are already 5.7 billion
> > people on the planet (>2^31) and 741 million phone
> > lines. In my mind, there is NO QUESTION that 2^31
> >
Apologies, I sent this to the wrong list. It should go to Libraries...
Robert
-- Forwarded message --
hi Ross and others,
On Wed, 7 Apr 2004, Robert Will wrote:
>
> On Mon, 5 Apr 2004 [EMAIL PROTECTED] wrote:
>
> > To have something concrete to discuss
hi Ross and others,
On Wed, 7 Apr 2004, Robert Will wrote:
>
> On Mon, 5 Apr 2004 [EMAIL PROTECTED] wrote:
>
> > To have something concrete to discuss, I've placed a structure based on
> > Edison at
> > docs: http://www.soi.city.ac.uk/~ross/seq/
> >
On Thu, 8 Apr 2004, S. Alexander Jacobson wrote:
>
> > Haskell is pretty good about letting you install a different Prelude,
> > so you could try it yourself.
>
> Hmm. That's interesting! How does this work?
For your purpose it may suffice to hide some identifiers from the Prelude
and provide yo
hi all,
Curiously I have finished the promised draft standard for the Abstract
Collections just by a time, where many are busily working on DData.
It's there:
http://www.stud.tu-ilmenau.de/~robertw/dessy/fun/
I'm making this discussion hot now, since my Dessy library implements
the proposed c
> import QuickCheck
Dear developers of QuickCheck and Haddock,
Dear Haskell-Community,
((Summary: I'm trying to find notations for Design by Contract in Haskell
which can be standardised to be used by tools like Haddock and
QuickCheck. This will give Haskell programmers an order-of-magnitude
Hello,
As you will have noticed, I'm designing a little library of Abstract Data
Structuresm here is a small excerpt to get an idea:
class Collection coll a where
...
(<+>) :: coll a -> coll a -> coll a
reduce :: (a -> b) -> b
-> coll a -> b
...
class Map map a b wh
hi,
Abstract Data Types plus Data Structures gives Abstract Data Structures.
Divide by Conquer is a technique that every Computer Science Undergraduate
learns: to sort a listm sort each of its halves then merge. This is what
I call "Computational Divide and Conquer" and it is an important algori
hi,
In relation to my other message, I can contribute to this question. I
think it is very important and useful to consider Strings as Sequences of
Characters. And independently of the issue discussed elsewhere -- whether
Characters should be a type or a class -- I am asking whether Sequences
sh
10 matches
Mail list logo
