[Haskell-cafe] Tool to brute-force test against hackage libraries to determine lower bounds?

[Johan Tibell]

On Wed, Nov 9, 2011 at 3:58 PM, Ryan Newton <rrnewton at gmail.com> wrote:

> I don't know about you, but I personally haven't found the time to cast
> back in time for each of my package's dependencies to find a true lower
> bound version.
>
> Do we have any tools that would do the following?
>
>    - ask Hackage for the available versions of package foo
>    - use cabal-dev to build your package against foo-X.Y.Z forall {X,Y,Z}
>    (but leaving other packages unconstrained)
>    - report successes and failures, including last failure before the
>    present version (and therefore lower bound, exclusive)
>
> What about dependency interactions? If you depend on foo and bar there
might be versions of foo and bar that don't build together that you might
not discover by varying their versions independently.


>
>
> Johan, would it make any sense to extend your Jenkins setup to do this?
>

If someone came up with a recipe, sure. It might be a bit CPU intensive for
my little VPS though.

-- Johan
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20111109/e4d8bc84/attachment.htm>