haskell / haskell/cabal

reject-unconstrained-dependencies and qualified solving

Open
#5,500 0 comments 0 reactions 0 assignees View on GitHub
cabal-install: solver type: enhancement
Dominant language
Haskell
Stars
1.7k
Forks
750
Avg merge
4d 3h
Merged PRs (30d)
28

Description

#5475 has some discussion about `reject-unconstrained-dependencies` and the interaction with qualified goals.

There are at least two options here, and they aren't necessarily mutually exclusive:

* a new mode that will only restrict unconstrained and unqualified dependencies; qualified goals are free to pick any version

* or being able to separately restrict each qualified goal (e.g., being able to nail down the version `happy:Setup.Cabal` separately from `cpphs`).

This probably isn't worthwhile until #3502 is solved.

Contributor guide

Open the contributing guide

Research direction

Start by reading the discussion in #5475 and the prerequisite work in #3502. Determine which dependency restrictions are intended for unconstrained, unqualified, and qualified goals, then confirm that the chosen behavior is specified clearly enough to implement and test.

Written by the indexing model from the issue text.

Assessment

Tech stack
haskell
Domain
build-system
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
20/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.