[Haskell-cafe] Package bounds approximation

[Adam Bergmark]

It might be interesting to revive this PR:
https://github.com/haskell/cabal/pull/1309

- Adam



On Wed, Sep 3, 2014 at 10:48 AM, Ernesto Rodriguez <neto at netowork.me> wrote:

> Dear Cafe,
>
> I was wondering if there exists a tool to approximate what would be the
> minimal versions of the dependencies required by a package.
>
> I know that calculating this exactly is a bit intractable, but I was
> considering whether a tool that works as follows would work:
>
> 1) Compile the package with known to work dependencies
> 2) For each version of dependency as d:
>         For each function in d used by My Package:
>              * Perform unification of the resulting type when compiled
> with known to work dependencies
>                and the type exported by the api of the version of the
> dependency in consideration.
>          If all unifications succeeds, mark the version as compatible,
> incompatible otherwise
>
> This approximation is obviously not complete. Nevertheless, I would like
> to get opinions about whether this would be a good/useful/feasible
> approximation? Does the current GHC api export enough functionality for
> this package to be feasible? Are there alternatives? I was consider doing
> this as my `hack` during the high energy, intense no-sleep jacobsHack!
> <http://jacobshack.com> hackathon, do you think it would be a good idea?
>
> Thank you for the opinions and best regards,
>
> Ernesto Rodriguez
>
> --
> Ernesto Rodriguez
>
> Masters Student
> Computer Science
> Utrecht University
>
> www.netowork.me
> github.com/netogallo
>
>
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20140903/40f37d8e/attachment.html>