Haha, I like this example.
However, if your are using ExtendedDefaultRules then you are likely to
know you are leaving the clean sound world of type inference. The
example of my student works on plain GHC...
The other responses to my message confined to point me to best
practices to avoid
Hi Ross,
can you fix this on Hackage? My suggested solution is to again just
remove the test-suite sections from the cabal file, if that is fine with
Richard.
The current situation is unfortunate, as it breaks almost all installs
from Hackage with cabal-install 0.10.2 / Cabal 1.10.1.0, e.g. you
Upgrading to Cabal-1.10.2.0 (or cabal-install-0.14.0 with
Cabal-1.14.0) should fix the problem.
Currently you would have to do the upgrade manually, as `cabal-install
cabal-install` won't work (or alternatively edit your local
~/.cabl/packages/hackage.haskell.org/00-index.tar).
See my other
On Fri, Jul 20, 2012 at 09:34:16AM +0100, Simon Hengel wrote:
Hi Ross,
can you fix this on Hackage? My suggested solution is to again just
remove the test-suite sections from the cabal file, if that is fine with
Richard.
I'll modify the packages in-place if there's a consensus on what to do.
Does anyone have a parser for COBOL-85 written in Haskell,
or written using some freely available tool that communicates
easily with Haskell?
I don't need it _yet_, but I'm talking with someone who is
trying to get access to a real legacy site with a bunch of,
well, basically COBOL 85, but there
Hi cafe!
I'm a bit confused by the DefaultSignatures extension. It's unclear whether to
consider the following an example of clever use of this extension, or an
example of abuse of it:
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE DefaultSignatures #-}
{-# LANGUAGE FlexibleContexts #-}
{-#
Ralf Laemmel would probably be the world's foremost expert in parsing and
analysing Cobol using functional languages. Try contacting him directly at
uni-koblenz.de
Some of his relevant papers: http://homepages.cwi.nl/~ralf/padl03/
http://homepages.cwi.nl/~ralf/ctp/
On 20 Jul 2012, at 10:08,
Dear all,
how would I quickly select an element of a Set (as in Data.Set)
uniformly at random?
Via the API, this can only be done in linear time? (via toList)
If I could access the tree structure,
then of course it could be logarithmic.
But probably I'd need a weighted selection sooner or
On Fri, Jul 20, 2012 at 01:24:57PM +, jwaldmann wrote:
Dear all,
how would I quickly select an element of a Set (as in Data.Set)
uniformly at random?
Via the API, this can only be done in linear time? (via toList)
If I could access the tree structure,
then of course it could be
There was recently a proposal to add indexing operators to Data.Set.
Until it is accepted, you can simulate Set with Map like this
import Data.Map
type Set a = Map a ()
Data.Map already has indexing operations (e.g. elemAt, deleteAt).
* jwaldmann waldm...@imn.htwk-leipzig.de [2012-07-20
Am 20.07.2012 15:24, schrieb jwaldmann:
Dear all,
how would I quickly select an element of a Set (as in Data.Set)
uniformly at random?
If you use a Map a () (or Map a a) you can use Map.elemAt.
The initial conversion is still linear, though.
-- | convert a set into an identity map
setToMap
On 12-07-17 01:43 PM, Levent Erkok wrote:
It still feels like this'll start biting more folks down the road. I've
created the following cabal ticket so it can be tracked:
https://github.com/haskell/cabal/issues/978
However, my understanding of the problem is rather incomplete; please
feel free
12 matches
Mail list logo
