Changes between Version 2 and Version 3 of RelaxedDependencyAnalysis


Ignore:
Timestamp:
Jan 26, 2006 8:01:14 PM (8 years ago)
Author:
ross@…
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • RelaxedDependencyAnalysis

    v2 v3  
    11= Relaxed Dependency Analysis = 
     2 
     3[search:?q="RelaxedDependencyAnalysis"&ticket=on Ticket(s)] 
    24 
    35In Haskell 98, a group of bindings is sorted into strongly-connected components, and then type-checked in dependency order ([http://haskell.org/onlinereport/decls.html#sect4.5.1 H98 s4.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 ([http://haskell.org/onlinereport/decls.html#sect4.5.2 H98 s4.5.2]).