look in patterns when building the dependency graph

[janmasrovira]

The dependency graph is computed before holes have been inferred. Consider the following example:

f : _;
f true := zero;
f false := zero;

Unless we look at the patterns we will not know that f depends on Bool.