--- John Meacham <[EMAIL PROTECTED]> wrote:
> So, pursuient to discussion on the various other
> haskell lists and some talk about DData recently,
> I was wondering whether adding an ordered
> list type might be useful. Often, when one knows a
> list is ordered, many algorithms (like building a
--- Gour <[EMAIL PROTECTED]> wrote:
> Any comment from some experienced Haskell
programmer
> about the latest
> language shootout published on:
>
> http://shootout.alioth.debian.org/index.php
> regarding Haskell (ghc-6.2.1) score?
I would have liked to re-implement some of the
benchmarks, some of
Hi,
--- Bruno Oliveira <[EMAIL PROTECTED]>
wrote:
> coerce :: a -> b
> coerce x = undefined
>
> As an obvious consequence, Haskell type system would
> be unsound.
Actually, in the isomrphism, "undefined" is a proof
that any theorem is correct. Somehow it can represent
an assumption that a subth
--- Christian Maeder <[EMAIL PROTECTED]> wrote:
> Simon Marlow wrote:
> > Why are there IntBags but no Bags?
>
> As I've said before, rename MultiSet to Bag.
Daan's remark about the difference between bags and
multisets is:
"
A multi set differs from a /bag/ in the sense that it
is represented a
Hi,
> Maybe the documentation to the "0rdered lists"
> section can be improved.
Could you be more specific about this?
> The functions Set.fromAscList and
> Set.fromAscDistinctList should be
> marked as "unsafe", since it's not clear what sets
> result if the input
> is not ascending (and/or
Dear haskellers,
I propose to add a modified version of DData to the
hierachical libraries.
DData is a concrete library of collection types, by
Daan Leijen.
My modifications intend to make DData fit better in
the hierarchical libraries.
The haddock-generated documentation can be found here:
htt
> I believe FiniteMap works by representing the data
> in binary trees. It is therefore O(log2(n)) to
> read and update.
>
> However, if my application reads many more times
> than it writes, then perhaps I can get a
> substantial performance boost by increasing the
> branch factor on the tree.
--- "Sean L. Palmer" <[EMAIL PROTECTED]> wrote:
> Joking aside, surely you intelligent people realize
> that the internals of a
> file format have nothing whatsoever to do with the
> user interface of the
> editing tool. Something like this would be
> completely transparent *if* you
> used the ri
> > I have a question about error reporting. You use
> 'error' quite often. I
> > think that this can cause errors to pop up at
> strange moments during
> > program evaluation. It this a real problem? I
> prefer reporting errors
> > early in the IO monad. I think there is some
> trade-off involved
Hello all,
As an exercise, I've implemented an algorithm for
canonic relabeling of graphs. (Two graphs are
isomorphic
iff they have the same canonic labelling)
The method used is stolen from Brendan McKay,
"Practical graph isomorphism".
http://cs.anu.edu.au/~bdm/nauty/PGI/
In the hope that it is
10 matches
Mail list logo
