Release early, release often. Here's a second version:
http://hackage.haskell.org/package/signed-multiset-0.2
Changes:
* Added the functions Data.SignedMultiset.isPositive and
Data.SignedMultiset.isNegative, which return whether all elements in a
signed multiset have respectively
Hi Michael,
Am Mittwoch, den 18.04.2012, 19:21 +0300 schrieb Michael Snoyman:
I'm quite a novice at rewrite rules; can anyone recommend an approach
to get my rule to fire first?
I’m not an expert of rewrite rules either, but from some experimentation
and reading -dverbose-core2core (which is
On Thu, Apr 19, 2012 at 11:47 AM, Joachim Breitner
m...@joachim-breitner.de wrote:
Hi Michael,
Am Mittwoch, den 18.04.2012, 19:21 +0300 schrieb Michael Snoyman:
I'm quite a novice at rewrite rules; can anyone recommend an approach
to get my rule to fire first?
I’m not an expert of rewrite
Hi all,
I'm wondering if there are still active users out there of
http-enumerator. Four months ago I released http-conduit, and since
then, my development efforts have gone almost exclusively there. At
this point, I'm not longer actively using http-enumerator on any of my
projects, and while
You're in luck! This is something I've wanted to implement before in
the past, and your email reminded me. While pretty awful, it could be
used for doing some interesting value-interception instrumentation in
Haskell. Recently I've been messing with TH a lot, so this initial
implementation was
Hi Michael!
Thanks (again) for your answer.
I'm not quite confident using TH yet, but it seems in your code you must
define an 'app' function, and then use [overloadedApp|... |] as a
quasiquoteator to inject the overloaded app, right?
Thanks for the zeroth reference too, one question remains for
I'm hoping the second part of the version number isn't ominous, but
I've just uploaded the latest release in my bindings for the Graphviz
suite of graph visualisation tools.
The changes in this release are:
* Added support for the `osage` and `patchwork` visualisation tools,
available as of
On 19/04/2012 4:10 AM, Stefan Holdermans wrote:
Release early, release often. Here's a second version:
http://hackage.haskell.org/package/signed-multiset-0.2
Very cool.
In the literature, we have found [1] that these are sometimes also
called 'hybrid sets'. They do have some rather
I should have pointed out that for most people, there should be
minimal to no API change with this release; the only change I needed
to make in my own code was that a type-class I had defined in
Graphalyze was removed as it provided the impetus for the ToGraphID
class mentioned below.
On 19 April
Hello all,
Right now I'm trying to answer a simple question:
- Would the current Haskell.org / hackage infrastructure benefit from
the donation of a dedicated VM with good bandwidth/uptime?
Whoever already knows how to do this could configure it.
In trying to answer the above question I
Hello,
As someone new to the GSOC system there are some things I'm confused about.
There's a bunch of info out there, and I certainly haven't read all of it.
Who are the program administrator and organization administrator for
the Haskell organization? Those roles are mentioned in the manual
I once experimented with something similar. This is a preprocessor.
This was a long time ago, and I don't use it.
https://patch-tag.com/r/jmcarthur/overloaded-whitespace/snapshot/current/content/pretty/Main.hs
On Thu, Apr 19, 2012 at 8:40 AM, Ismael Figueroa Palet
ifiguer...@gmail.com wrote:
Hi
Hello Ivan,
Thanks for bringing Graphviz to Haskell, and for your continuing
dedication to making it more complete!
I just tried Graphvis for the first time a few days ago. I regretted
the absence of example code, especially as the API has been evolving,
so that examples on the Web do not
Hi,
On Thu, Apr 19, 2012 at 5:12 PM, Ryan Newton rrnew...@gmail.com wrote:
- Would the current Haskell.org / hackage infrastructure benefit from
the donation of a dedicated VM with good bandwidth/uptime?
I can think about at the very least one project (the one you mention
below) that
Jacques,
In the literature, we have found [1] that these are sometimes also called
'hybrid sets'.
They also go by the name of 'shadow sets', which also has a cool ring to it. ;)
PS: the Haddock did not work for 0.2, but did for 0.1, you might want to look
into that.
As I just uploaded
On 19 April 2012 08:12, Ryan Newton rrnew...@gmail.com wrote:
Hello all,
Right now I'm trying to answer a simple question:
Would the current Haskell.org / hackage infrastructure benefit from the
donation of a dedicated VM with good bandwidth/uptime?
Whoever already knows how to do this
Oh yes, it's hackage2... not hackage1.
On 19 April 2012 11:50, David Terei dave.te...@gmail.com wrote:
On 19 April 2012 08:12, Ryan Newton rrnew...@gmail.com wrote:
Hello all,
Right now I'm trying to answer a simple question:
Would the current Haskell.org / hackage infrastructure benefit
Hi Jeff
Thanks for the tip. Now its working but scaling is not good.
[mukesh.tiwari@pg155-n3 ParallelStrat]$ time ./Main +RTS -N1
101
real0m0.591s
user0m0.517s
sys0m0.060s
[mukesh.tiwari@pg155-n3 ParallelStrat]$ time ./Main +RTS -N2 -s
101
618,757,264 bytes allocated in
I'm trying to implement a set of languages with a large overlap between them.
From what I understand, there are 3 main ways to do this: Finally
Tagless, Data Types a la Carte, or manually.
I'm currently leaning toward DTalaC, but not strongly.
There seem to be two packages which implement the
On 20 April 2012 03:21, Ras Far ras...@gmail.com wrote:
Hello Ivan,
Thanks for bringing Graphviz to Haskell, and for your continuing
dedication to making it more complete!
I just tried Graphvis for the first time a few days ago. I regretted
the absence of example code, especially as the
Signed multisets are unfamiliar to most of us, and I for one
found the paper a little fast-paced. Can you put a bit more
into the documentation? Just for starters, I found it
confusing when the documentation talks about an element with
multiplicity zero, because in the _paper_ a value that has
Alright, thank-you Ivan. I'm not yet using any standard library for
my graphs, although no doubt I should, and FGL sounds like the obvious
choice. Just hoping for a tour de force example of the layout and
visualisation possibilities, preferably some Haskell code in the
public domain that was
On 4/19/12 7:02 PM, Richard O'Keefe wrote:
For a specific example, I haven't the faintest intuition about
what 'map' should do. Suppose we have
{(k1)x1, (k2)x2}
and f x1 == f x2 = y. Should the value of map f {...} be
{(k1+k2)y} or {(k1`max`k2)y} or what?
Good question. I'd suppose
2012-04-19 22:31, Alex Rozenshteyn skrev:
I'm trying to implement a set of languages with a large overlap between them.
From what I understand, there are 3 main ways to do this: Finally
Tagless, Data Types a la Carte, or manually.
I'm currently leaning toward DTalaC, but not strongly.
There
Has there been a change in the behaviour/requirement of
TypeSynonymInstances as of GHC-7.4.1? (Not sure if this behaviour
occurs with 7.2.1 as I don't have it installed)
I had an instance for String for a class which ghc accepted whilst
using FlexibleInstances; however, when trying to load it in
25 matches
Mail list logo
