Re: [Haskell-cafe] An Easy Solution to PVP Bounds and Cabal Hell

2015-04-01 Thread Thomas Tuegel
Hi Gershom, On Tue, Mar 31, 2015 at 11:22 PM, Gershom B gersh...@gmail.com wrote: One way to look at a particular build is in an n-dimensional state space (of the Hilbert sort) determined by all its dependencies, not least the compiler itself. The solver acts as a particle traversing this

Re: [Haskell-cafe] An Easy Solution to PVP Bounds and Cabal Hell

2015-04-01 Thread Brandon Allbery
On Wed, Apr 1, 2015 at 10:53 AM, Thomas Tuegel ttue...@gmail.com wrote: [2]. If you've never had an upper bounds problem on a package you maintain, I'm happy for you, but there is mounting evidence that as a community, we are very bad guessers, on average. I think upper bound with easy way

An Easy Solution to PVP Bounds and Cabal Hell

2015-03-31 Thread Gershom B
Recently there has been some discussion about how we can fix the problem of “Cabal Hell”. Some people advocate restrictive upper bounds, to prevent packages from being broken by new updates. Some other people point out that too-restrictive bounds can lead to bad install plans, since some