3 ms·
> dependency info is turing complete It's NP-complete in general I think, definitely the case in Haskell-land. I think OCaml sets an explicit timeout for depen
by vmchale 6y ago
> dependency info is turing complete
It's NP-complete in general I think, definitely the case in Haskell-land. I think OCaml sets an explicit timeout for dependency resolution?
> the dependency graph cannot be computed without installing many versions of all dependencies?
Does PyPi not have an index or something? (with statically known package bounds?)