|
|
# Relaxed Dependency Analysis
|
|
|
|
|
|
[Ticket(s)](/search?q="RelaxedDependencyAnalysis"&ticket=on)
|
|
|
**[Ticket(s)](/search?q="RelaxedDependencyAnalysis"&ticket=on)**
|
|
|
|
|
|
## Brief Explanation
|
|
|
|
|
|
|
|
|
In Haskell 98, a group of bindings is sorted into strongly-connected components, and then type-checked in dependency order ([ H98 s4.5.1](http://haskell.org/onlinereport/decls.html#sect4.5.1)). As each dependency group is type-checked, any binders of the group that have an explicit type signature are put in the type environment with the specified polymorphic type, and all others are monomorphic until the group is generalized ([ H98 s4.5.2](http://haskell.org/onlinereport/decls.html#sect4.5.2)).
|
... | ... | |