Are we foolish enough to attempt this?

The internal differentials of a brane is a directed graph. The number of paths from one line to a later line is the direct programatic dependence of the latter on the former. Following this we may determine the number of distinct code paths between a method’s outputs and each of its inputs. If two lines share a path, then differential with respect to them is not separable into separate univariate methods.

A parameter A is not affected by another, B, if

Implicit dependence theorem

But this is not equivalent to