[Haskell] New releases for Edison, Shellac, and the Lambda Shell

2007-12-04 Thread Robert Dockins
have bookmarks or automated build systems that point to older versions of these packages, please update them to point to the new locations listed below. The old website will not dissapear, but it will no longer be updated. Thank you! Edison 1.2.1.1 Edison is a library of purely function

[Haskell] [ANN] Edison 1.2.1

2006-12-16 Thread Robert Dockins
Fellow Haskellers, I am pleased to announce the 1.2.1 release of Edison. Edison is a library of efficient, purely-functional data structures in Haskell. Notable changes from version 1.2.0.1: * A new sequence implementation based on finger trees (similar to Data.Sequence in the base libs

Re: [Haskell] Edison 1.2 and profiling

2006-06-04 Thread Mario Blazevic
f > alone. It > doesn't matter if -auto-all option is there or not. And the profiled program > gobbles up > all memory with or without the +RTS -p option. > Furthermore, the problem has nothing to do with Edison. The version 6.4.2 of ghc is the culprit. I hadn't run the pr

Re: [Haskell] Edison 1.2 and profiling

2006-06-04 Thread Mario Blazevic
to misbehave at the very start of the execution. > > The > > non-profiled version of the program runs perfectly well. In fact, the > > PatriciaLoMap from Edison seems to be about two to three times faster > > than Data.Map library for my purposes. > > That's

Re: [Haskell] Edison 1.2 and profiling

2006-06-04 Thread Robert Dockins
On Jun 4, 2006, at 12:35 PM, Mario Blazevic wrote: The profiled version of the latest Edison library doesn't work for me. I got Edison 1.2 via darcs. I used the regular 'make system' command to build and install the regular (non-profiled) version of Edison. Then I went to

[Haskell] Edison 1.2 and profiling

2006-06-04 Thread Mario Blazevic
The profiled version of the latest Edison library doesn't work for me. I got Edison 1.2 via darcs. I used the regular 'make system' command to build and install the regular (non-profiled) version of Edison. Then I went to edison-api and edison-core subdirectories, in turn, and exe

[Haskell] ANNOUNCE: Edison 1.2

2006-06-03 Thread Robert Dockins
Fellow Haskellers, I am pleased to announce the final, stable release of Edison 1.2. Edison is a library of efficient, purely-functional data structures for Haskell. Many thanks to all of you who helped with your comments and suggestions during the release candidate phase! Edison 1.2

Re: [Haskell] Long live Edison

2006-02-21 Thread Malcolm Wallace
Robert Dockins <[EMAIL PROTECTED]> wrote: > On Feb 20, 2006, at 5:19 PM, [EMAIL PROTECTED] wrote: > > > > Data.Set, Data.Map, Data.Hash and the various Array interfaces are > > all inconsistent in subtle ways, so whatever you do, do not take > > them as the id

[Haskell] Re: Long live Edison

2006-02-20 Thread Paul Johnson
Robert Dockins <[EMAIL PROTECTED]> wrote: Consistency. Almost all the other API functions take the data structure argument last. This seems to be a kind of de facto standard and deviations from it are likely to cause confusion. I'd always assumed that the reason that data structure functi

Re: [Haskell] Long live Edison

2006-02-20 Thread David Menendez
[EMAIL PROTECTED] writes: > G'day all. > > Quoting Robert Dockins <[EMAIL PROTECTED]>: > > > -- The Sequence 'rcons' method takes its arguments in the opposite > > order as the 'lcons' method (for mnemonic purposes). Should the > > arguments to 'rcons' be reversed? > > The argument is that the

Re: [Haskell] Long live Edison

2006-02-20 Thread ajb
G'day all. Quoting Cale Gibbard <[EMAIL PROTECTED]>: > One thing which I found odd about the NotJustMaybe pattern is that not > much is really gained apart from a small amount of convenience. That's not the whole truth. It buys you abstraction, in that the library function can signal an error w

Re: [Haskell] Long live Edison

2006-02-20 Thread Cale Gibbard
On 20/02/06, Iavor Diatchki <[EMAIL PROTECTED]> wrote: > Hello, > > On 2/20/06, John Meacham <[EMAIL PROTECTED]> wrote: > > I think the problem is that 'mzero' exists, the correct solution seems > > to be to get rid of the 'mzero' method of MonadPlus. Since haskell is > > lazy, all Monads have at l

Re: [Haskell] Long live Edison

2006-02-20 Thread John Meacham
On Mon, Feb 20, 2006 at 05:10:02PM -0800, Iavor Diatchki wrote: > On 2/20/06, John Meacham <[EMAIL PROTECTED]> wrote: > > I think the problem is that 'mzero' exists, the correct solution seems > > to be to get rid of the 'mzero' method of MonadPlus. Since haskell is > > lazy, all Monads have at lea

Re: [Haskell] Long live Edison

2006-02-20 Thread Iavor Diatchki
Hello, On 2/20/06, John Meacham <[EMAIL PROTECTED]> wrote: > I think the problem is that 'mzero' exists, the correct solution seems > to be to get rid of the 'mzero' method of MonadPlus. Since haskell is > lazy, all Monads have at least the zero of _|_ which can be overriden by > 'fail' with a mor

Re: [Haskell] Long live Edison

2006-02-20 Thread John Meacham
On Mon, Feb 20, 2006 at 05:29:16PM -0500, [EMAIL PROTECTED] wrote: > The problem with MonadPlus is that you don't actually need the Plus > functionality. It is usually considered good design to only require > what you need, and Monad already has "fail". > > There has been some discussion on haske

Re: [Haskell] Long live Edison

2006-02-20 Thread John Meacham
On Mon, Feb 20, 2006 at 04:22:19PM -0500, Robert Dockins wrote: > Sorry for replying to myself > There are a number of methods which take a monad context and call > 'fail' (rather than error) under some conditions, usually when the > data structure is empty, e.g. > > lview :: Monad m => s

Re: [Haskell] Long live Edison

2006-02-20 Thread Robert Dockins
On Feb 20, 2006, at 5:19 PM, [EMAIL PROTECTED] wrote: G'day all. Quoting Robert Dockins <[EMAIL PROTECTED]>: Although I am not a data structures expert, several weeks ago I decided that I would try my hand at maintaining Edison and see if I could overcome these barriers. Toward

Re: [Haskell] Long live Edison

2006-02-20 Thread ajb
G'day again. Quoting Robert Dockins <[EMAIL PROTECTED]>: > There are a number of methods which take a monad context and call > 'fail' (rather than error) under some conditions, usually when the > data structure is empty [...] > I am considering moving to a MonadPlus context and calling 'mzero'

Re: [Haskell] Long live Edison

2006-02-20 Thread ajb
G'day all. Quoting Robert Dockins <[EMAIL PROTECTED]>: > Although I am not a data structures expert, several weeks ago I > decided that I would try my hand at maintaining Edison and see if I > could overcome these barriers. Toward this end I have taken the most > recent

Re: [Haskell] Long live Edison

2006-02-20 Thread Robert Dockins
Sorry for replying to myselfHaskell community,As many of you are aware, Edison is a venerable library of data structures written in Haskell, primarily by Chris Okasaki.  I have though for some time that it is a great shame that Edison has been languishing in disuse.  It has always seemed to me

[Haskell] Long live Edison

2006-02-20 Thread Robert Dockins
Haskell community, As many of you are aware, Edison is a venerable library of data structures written in Haskell, primarily by Chris Okasaki. I have though for some time that it is a great shame that Edison has been languishing in disuse. It has always seemed to me to be high quality

Re: new version of edison?

2002-10-15 Thread Andrew J Bromage
G'day all. On Tue, Oct 15, 2002 at 04:47:22PM -0700, Hal Daume III wrote: > I was wondering if anyone has a brand-spaking-new version of edison or > anything like it. The edison docs still refer to ghc 4.06, which can't be > good. If not, is there an edison-like projec

new version of edison?

2002-10-15 Thread Hal Daume III
Hi all, I was wondering if anyone has a brand-spaking-new version of edison or anything like it. The edison docs still refer to ghc 4.06, which can't be good. If not, is there an edison-like project out there? - Hal -- Hal Daume III "Computer science is no more about computers

Re: edison question

2002-07-31 Thread Dan Weston
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! Anothe

Re: edison question

2002-07-31 Thread paul
oll Bag a where > insert a c = ... > minElem c = ... > ... > > But I assume that you don't want to implement your own collection datatype or > write your own insert, minElem, etc. Luckily, Edison comes with a few > pre-defined instances of OrdColl, each in a separa

Re: edison question

2002-07-30 Thread Brian Huffman
= ... ... But I assume that you don't want to implement your own collection datatype or write your own insert, minElem, etc. Luckily, Edison comes with a few pre-defined instances of OrdColl, each in a separate module. You just have to import the one you want. Replace the line > import q

Re: edison question

2002-07-30 Thread Hal Daume III
I'm no edison expert but it seems the problem simply is that you're using overloaded functions and the compiler can't tell which instance you're trying to use. Try adding a type signature to the definition of sorted (I'm not familiar enough with edision to know what t

edison question

2002-07-30 Thread paul
I am quite confused with the collection package provided by the edison library. Attached is a sample program, what I wanted to do is to maintain a sorted of Pair of id and time (sorted by time). The error I got is: ghc -package data -package lang test.hs test.hs:17: No instance for

Edison

1999-05-21 Thread Chris Okasaki
I am pleased to make the first public release of Edison, a library of data structures for Haskell. See http://www.cs.columbia.edu/~cdo/edison/ for details. Many thanks to Ralf Hinze for solving the makefile problems that had been plaguing me for many months! Chris Okasaki

Preliminary Design of Edison: A Library of Efficient Data Structures

1997-07-20 Thread Chris Okasaki
I am in the process of designing and implementing a library of efficient data structures tentatively named Edison. However, before I get too deep in the implementation I wanted to solicit feedback from the Haskell community on the preliminary design of the library. I have sketched the general