OK. I found cabal-src tool, which solved this perfect.
On Wed, Jun 20, 2012 at 9:22 AM, Magicloud Magiclouds
wrote:
> Hi,
> The names here were just placeholder. And I just found out the reason.
> Hackage magicloud is local (not from hackage.haskell.org), there is
> no its information in cabal
This release has an important bug fix for the metadata download.
When metadata was downloaded using libcurl it was not treated
as binary data. If you used one of our binary installers or if you
built Leksah with the -flibcurl flag then it is likely you have bad
metadata files.
To fix this please
Un-top-posted. See below.
> On 19 June 2012 02:21, Derek Elkins wrote:
>>
>> On Jun 18, 2012 4:54 PM, "George Giorgidze" wrote:
>>>
>>> Hi Derek,
>>>
>>> On 16 June 2012 21:53, Derek Elkins wrote:
>>> > The law that ends up failing is toList .
>>> > fromList /= id, i.e. fmap g . toList . fromL
Hi,
The names here were just placeholder. And I just found out the reason.
Hackage magicloud is local (not from hackage.haskell.org), there is
no its information in cabal INDEX (I assumed so). But this raised
another question, how to reference a local hackage in .cabal. So the
solver could use
I am looking for background material on how GHC and other Haskell
compilers implement the layout rule. Are there any papers,
documentation, commentary, etc. that discus the actual implementation
of this rule (even if only a paragraph or two)?
I've already looked at the parsing code in GHC and UHC
It doesn't work like that by default, and here is why:
-- an infinite tree of values
data InfTree a = Branch a (InfTree a) (InfTree a)
buildTree :: Num a => STRef s a -> ST s (InfTree a)
buildTree ref = do
n <- readSTRef ref
writeSTRef ref $! (n+1)
left <- buildTree ref
right <- b
A good functional programming language has a good "code algebra" after
parsing to which algebraic transformations can be applied for optimization.
For example, reducing the need for generating intermediate data structures.
See: fusion.
On Tue, Jun 19, 2012 at 3:01 PM, Matt Ford wrote:
> Hi A
[Only cc:ing cafe]
There are definite similarities, yes - I only became aware of
testing-feat very recently. You seem to have concentrated more on
efficiency, while we have focused more on the high-level modular design
and on strategies. We should probably merge our efforts, if you are
wil
HI Jacques,
This looks very similar to the recently released testing-feat library:
http://hackage.haskell.org/package/testing-feat-0.2
I get a build error on the latest platform:
Test\GenCheck\Base\LabelledPartition.lhs:126:3:
The equation(s) for `new' have two arguments,
but its type `[
Call for Talks
ACM SIGPLAN Haskell Implementors' Workshop
http://haskell.org/haskellwiki/HaskellImplementorsWorkshop/2012
Copenhagen, Denmark, September 14th, 2012
The workshop will be held in conjunction with ICFP 2012
Hi,
I'm currently working on extending the hascat Server. My problem is, that
for whatever odd reason it will only work on GHC < 7.0 or alternatively if
I execute it with runghc or in ghci.
If I compile it with GHC>=7.0 and execute it, then I get this:
$ ~/.cabal/bin/hascat config.xml
Installing
Test.GenCheck is a Haskell library for /generalized proposition-based
testing/. It simultaneously generalizes *QuickCheck* and *SmallCheck*.
Its main novel features are:
* introduces a number of /testing strategies/ and /strategy combinators/
* introduces a variety of test execution methods
Apologies for duplicates.
CALL FOR PAPERS
STVR Special Issue on Tests and Proofs
http://lifc.univ-fcomte.fr/tap2012/stvr/
The Software Testing, Verification & Reliability (STVR) journal
(http://www3.interscience.wiley.com/journal/13635/home) in
Hi,
Are there any news how things are going? What remains there to be done to
get us to Hackage 2?
I found this list of tickets:
https://github.com/haskell/cabal/issues?labels=hackage2&page=1&state=open
Is there anything more to be done?
Best regards,
Krzysztof Skrzętnicki
On Tue, Feb 14, 2012
Hi.
> Hackage A depends on magicloud (any) and container (0.4.0.0), and
> hackage magicloud depends on container (any).
> Now I've installed magicloud, using container 0.5.0.0. Then I failed
> to install A, with any solver.
>
> So the solvers are using the status that is installed, not the
> defin
And today I met another situation, which I think solvable by computer.
Hackage A depends on magicloud (any) and container (0.4.0.0), and
hackage magicloud depends on container (any).
Now I've installed magicloud, using container 0.5.0.0. Then I failed
to install A, with any solver.
So the solvers
Hi Derek,
Thanks for clarifying your point.
You are right that (fromList . toList) = id is a desirable and it
holds for Data.Set.
But your suggestions that this property does not hold for
Data.Set.Monad is not correct.
Please check out the repo, I have just pushed a quickcheck definition
for t
17 matches
Mail list logo
