Fellow Haskelleers,
I'm pleased to announce the release of haskell-src-exts-1.13.2!
* On hackage: http://hackage.haskell.org/package/haskell-src-exts
* Via cabal: cabal install haskell-src-exts
* Darcs repo: http://code.haskell.org/haskell-src-exts
This release contains only a few small tweaks
Hello
I got this line in the profile output:
COST CENTRE MODULE
no.entries %time %alloc %time %alloc ticks bytes
addDeductionL42s.Maths.Prover.Base
22730 2362045 1.14.6
Ivan,
This package provides an efficient implementation of so-called
signed multisets, which generalise multisets by allowing for
negative membership.
That is, elements in a signed multiset can have negative multiplicities.
Wait, something can be not in the multiset more than once? :o
Stefan Holdermans stefan at vectorfabrics.com writes:
This package provides an efficient implementation of so-called
signed multisets, which generalise multisets by allowing for
negative membership.
SignedMultiset a = Data.Map.Map a Integer
so what do I gain by using your library?
(what is
Johannes,
This package provides an efficient implementation of so-called
signed multisets, which generalise multisets by allowing for
negative membership.
SignedMultiset a = Data.Map.Map a Integer
Indeed.
so what do I gain by using your library?
(what is the API difference?)
The library
Hi all,
Following a little thread on Reddit[1], I'm trying to add rewrite
rules to conduit to make some simple usages of `yield` more efficient.
I've pushed these changes to a branch on Github[2]. However, I'm not
able to fully optimize the following program:
import Data.Conduit
import qualified
I'm working on getting annotated versions of all instances of a function of
a typeclass, and was wondering what are the relation/differences between
Template Haskell and the Rewrite Rules section. Of course this is specific
to GHC.
Another question, in Racket, primitive function application is
On Tue, Apr 17, 2012 at 1:59 PM, Andres Löh andres.l...@googlemail.com wrote:
* Completely new modular dependency solver (default in most cases)
Great! =D
--
Felipe.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Folks,
Visi 0.1 is available as an executable for OS X 10.7 (
http://tunaforcats.com/visi_0_1.tar.bz ) The blog post announcement is
available at http://blog.goodstuff.im/visi-01-for-os-x/
Visi is written mostly in Haskell (which is totally awesome, btw).
I'll be hacking on Visi this weekend
Hello All
I am trying to understand the Strategies (
http://hackage.haskell.org/packages/archive/parallel/3.2.0.2/doc/html/Control-Parallel-Strategies.html)
and wrote this quick code.
import Data.Listimport Control.Parallel.Strategies
fun :: [ Int ] - [ Int ]fun [] = []fun ( x : xs ) = ( x + 1
Hello Mukesh Tiwari,
I'm wondering what happens if you replace return () with print (last
xs).
Jeff
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Welcome to issue 223 of the HWN, an issue covering crowd-sourced bits
of information about Haskell from around the web. This issue covers the
week of April 8 to 14, 2012.
Quotes of the Week
* merijn: I'm tempted to just do unsafePerformIO newEmptyMVar at the
top level
12 matches
Mail list logo