I've rather recently started to use cabal-install to install packages
from Hackage. Unfortunately, so far many packages fail to install. I
try to email authors/maintainers, but when I check build logs on
Hackage, I discover that some of these packages have failed building for
some time.
That sounds like a good idea. I'd like to know when my packages fail
to build or show warnings about deprecated features, etc.
On 22 July 2010 09:16, Ketil Malde ke...@malde.org wrote:
I've rather recently started to use cabal-install to install packages
from Hackage. Unfortunately, so far
Interesting tool. For my recent work I too have found a use for the
elf package, but its lack of a full binary instance and no parsing of
.symtab or .dynstr sections limits its usefulness. This isn't a
debilitating limitation - you can use elf for basic inspection then
perform mutations via
On Thu, Jul 22, 2010 at 9:16 AM, Ketil Malde ke...@malde.org wrote:
I've rather recently started to use cabal-install to install packages
from Hackage. Unfortunately, so far many packages fail to install. I
try to email authors/maintainers, but when I check build logs on
Hackage, I discover
I don't know how wise that is; I tend to fix packages when I find
they're broken. I'd prefer a way for there to be more than one
maintainer for a package, i.e., collaborators, like on Github, so that
a maintainer can add me as a collaborator. My only problem with
Hackage is I feel like the
2010/7/21 Richard O'Keefe o...@cs.otago.ac.nz:
One of the really nice ideas in the R statistics system is that
documentation pages can contain executable examples, and when you
wrap up a package for distribution, the system checks that the
examples run as advertised.
The next version of
On Wed, Jul 21, 2010 at 17:43, Rogan Creswick cresw...@gmail.com wrote:
On Wed, Jul 21, 2010 at 3:00 AM, Magnus Therning mag...@therning.org wrote:
I am successfully using hooks with the following in my .cabal file:
Build-Type : Simple
and my main in Setup.hs looks like this:
My only problem with
Hackage is I feel like the maintainer is a fence I have to climb every
time I want to upload a bugfix or a non-broken version of the package.
I just want to fix it, upload it, and continue with my work.
Unfortunately, experience shows that a gatekeeper is usually
On Thu, Jul 22, 2010 at 10:02, Malcolm Wallace malcolm.wall...@me.com wrote:
My only problem with
Hackage is I feel like the maintainer is a fence I have to climb every
time I want to upload a bugfix or a non-broken version of the package.
I just want to fix it, upload it, and continue with my
On Wed, Jul 21, 2010 at 09:43:16AM -0700, Rogan Creswick wrote:
On Wed, Jul 21, 2010 at 3:00 AM, Magnus Therning mag...@therning.org wrote:
I am successfully using hooks with the following in my .cabal file:
Build-Type : Simple
I've been unable to reproduce this -- flipping the
On Thu, Jul 22, 2010 at 10:59, Ross Paterson r...@soi.city.ac.uk wrote:
On Wed, Jul 21, 2010 at 09:43:16AM -0700, Rogan Creswick wrote:
On Wed, Jul 21, 2010 at 3:00 AM, Magnus Therning mag...@therning.org wrote:
I am successfully using hooks with the following in my .cabal file:
David Waern wrote:
2010/7/21 Richard O'Keefe o...@cs.otago.ac.nz:
One of the really nice ideas in the R statistics system is that
documentation pages can contain executable examples, and when you
wrap up a package for distribution, the system checks that the
examples run as advertised.
The
On Thu, Jul 22, 2010 at 11:31:21AM +0100, Magnus Therning wrote:
On Thu, Jul 22, 2010 at 10:59, Ross Paterson r...@soi.city.ac.uk wrote:
Magnus is building by directly running the Setup.hs himself, which ignores
the Build-Type. To get cabal-install to use his Setup.hs, the Build-Type
must
On Thu, Jul 22, 2010 at 11:52, Ross Paterson r...@soi.city.ac.uk wrote:
On Thu, Jul 22, 2010 at 11:31:21AM +0100, Magnus Therning wrote:
On Thu, Jul 22, 2010 at 10:59, Ross Paterson r...@soi.city.ac.uk wrote:
Magnus is building by directly running the Setup.hs himself, which ignores
the
GHC docs seem to have the problem that newer versions only gradually
overtake older ones in page rank, resulting in the effect that if one
uses Google to find library documentation, they may accidentally look
at an old version. For example, if I google Data.Data Haskell the
first link brings me
On 22/07/10 15:33, Ryan Newton wrote:
[snip]
So is the 6.12.2 target accruing pagerank rather than the latest one?
Even if someone links the /latest/ URL? If that's the problem, would
it fix things just to make latest/ a full directory structure in its
own right (a clone rather than redirect)?
Thanks Thomas.
On Thu, Jul 22, 2010 at 12:56 PM, Thomas DuBuisson
thomas.dubuis...@gmail.com wrote:
Interesting tool. For my recent work I too have found a use for the
elf package, but its lack of a full binary instance and no parsing of
.symtab or .dynstr sections limits its usefulness.
On Thu, Jul 22, 2010 at 4:33 PM, Ryan Newton rrnew...@gmail.com wrote:
GHC docs seem to have the problem that newer versions only gradually
overtake older ones in page rank, resulting in the effect that if one
uses Google to find library documentation, they may accidentally look
at an old
Not to discourage this brainstorming, but many of what people think to
be new ideas are being implemented by a GsoC student [1] already.
Yay!
I've rather recently started to use cabal-install to install packages
from Hackage. Unfortunately, so far many packages fail to install. I
try to
On 22 July 2010 16:56, Thomas DuBuisson thomas.dubuis...@gmail.com wrote:
The hackage build logs can be misleading - many system specific
packages may or may not build on hackage because it just isn't the
right OS. Still other packages require particular C libraries that
the hackage server
On Thursday 22 July 2010 18:23:32, Stephen Tetley wrote:
On 22 July 2010 16:56, Thomas DuBuisson thomas.dubuis...@gmail.com
wrote:
The hackage build logs can be misleading - many system specific
packages may or may not build on hackage because it just isn't the
right OS. Still other
Alexander Solla wrote:
After all, the source is always structured in more-or-less the same
way. Fragments of text with opaque -- unless/until you understand
them -- combinators join two distinct concepts/types into functions.
A chain of functions (potentially at various levels of
Hi,
I am a Haskell newbie. I have coded a Regular Expression to Determinate
Finite Automata translator. Algorithm from the Dragon Book.
Would someone eyeball the code and give me suggestions please.
I have not done anything on character classes yet though. And the parsing is
a bit of a hack.
Some comments:
- You can run your code thru HLint, here it gives me 27 suggestions.
- Why don't you derive the Show instance for RE instead of writing it
by yourself?
- Note that
do x
do y
...
is the same as
do x
y
...
- You can parametrize RE as
data RE s p =
The simplest way to make a recogniser out of a RE is to use one of the
available parsing libraries:
module RE where
import Text.ParserCombinators.UU
import Text.ParserCombinators.UU.Examples
data RE = Epsilon | Leaf Char | Selection RE RE | Sequence RE RE | Kleene RE |
Optional RE | End
Hello cafe,
I'm trying to do some things with bounded indices so I can carry
around arrays (well, Vectors, really) without needing to refer to the
bounds.
For example, if I know my indices are Bool values, I can do
rangeSize (minBound, maxBound :: Bool)
2
I'd like to be able to do this in
On Fri, Jul 2, 2010 at 8:34 PM, Christopher Done
chrisd...@googlemail.com wrote:
That sounds like a good idea. I've setup a repo, I've merged in the
latest work I did on it, and I've just updated it to be latest
Prelude/base and to comply with -Wall. I'm just going to make it
consistent with
On Thu, 22 Jul 2010, Chad Scherrer wrote:
Hello cafe,
I'm trying to do some things with bounded indices so I can carry
around arrays (well, Vectors, really) without needing to refer to the
bounds.
For example, if I know my indices are Bool values, I can do
rangeSize (minBound, maxBound ::
On Friday 23 July 2010 00:21:49, Chad Scherrer wrote:
Hello cafe,
I'm trying to do some things with bounded indices so I can carry
around arrays (well, Vectors, really) without needing to refer to the
bounds.
For example, if I know my indices are Bool values, I can do
rangeSize
On Thu, 22 Jul 2010, Chad Scherrer wrote:
I thought it might help to put it into a module and do a better job
with the type, like this:
bdRangeSize :: (Ix i, Bounded i) = i - Int
bdRangeSize _ = rangeSize (minBound, maxBound :: i)
Henning Thielemann lemming at henning-thielemann.de
On Jul 23, 2010, at 12:21 AM, Chad Scherrer wrote:
bdRangeSize :: (Ix i, Bounded i) = i - Int
bdRangeSize _ = rangeSize (minBound, maxBound :: i)
Unlike intended, the `i` in the type annotation to `maxBound` is not
the same as the `i` in the signature of `bdRangeSize`. You need to
enable
On Thu, Jul 22, 2010 at 3:43 PM, Daniel Fischer
daniel.is.fisc...@web.de wrote:
{-# LANGUAGE ScopedTypeVariables #-}
bdRangeSize :: forall i. (Ix i, Bounded i) = i - Int
Ah nice, I tried a forall in that position, but I didn't know about
ScopedTypeVariables. Thanks!
Chad
An alternative to the `asTypeOf` idiom, which is also Haskell 98, is
to use a newtype instead of a dummy argument:
newtype RangeSize i = RangeSize { getRangeSize :: Int }
boundedRangeSize :: Ix i = (i,i) - RangeSize i
boundedRangeSize = RangeSize . rangeSize
bdRangeSize ::
We're pleased to announce the fifth release of the Haskell Platform: a
single, standard Haskell distribution for everyone.
Download the Haskell Platform 2010.2.0.0:
http://hackage.haskell.org.nyud.net/platform/
(Caching server).
The specification, along with installers (including Windows,
On Thu, Jul 22, 2010 at 9:00 PM, Don Stewart d...@galois.com wrote:
We're pleased to announce the fifth release of the Haskell Platform: a
single, standard Haskell distribution for everyone.
That's just great, dons! Thanks a lot!
Cheers, =)
--
Felipe.
Magnus Therning wrote:
On Thu, Jul 22, 2010 at 11:52, Ross Paterson r...@soi.city.ac.uk wrote:
On Thu, Jul 22, 2010 at 11:31:21AM +0100, Magnus Therning wrote:
On Thu, Jul 22, 2010 at 10:59, Ross Paterson r...@soi.city.ac.uk wrote:
Magnus is building by directly running the Setup.hs himself,
On 23 July 2010 02:31, Daniel Fischer daniel.is.fisc...@web.de wrote:
On Thursday 22 July 2010 18:23:32, Stephen Tetley wrote:
Hiding unmaintained libraries seems contrary to Hackage's spirit - if
you want to depend on an unmaintained library why not volunteer to be
the maintainer.
I think
On 22 July 2010 18:33, David Waern david.wa...@gmail.com wrote:
[snip]
We currently only support concrete examples (i.e. unit tests), but the
plan is to add support for QuickCheck properties.
Would you have some kind of inbuilt time limit (similar to what mueval
has) for very long/complex QC
On Fri, Jul 23, 2010 at 12:33 PM, wren ng thornton w...@freegeek.org wrote:
Magnus Therning wrote:
On Thu, Jul 22, 2010 at 11:52, Ross Paterson r...@soi.city.ac.uk wrote:
On Thu, Jul 22, 2010 at 11:31:21AM +0100, Magnus Therning wrote:
On Thu, Jul 22, 2010 at 10:59, Ross Paterson
39 matches
Mail list logo
