Documentation

Given a map of top-level bindings, identify which terms are recursive and organize them into groups of mutually recursive bindings. For example, calling mkRecInfo on a BindingMap with the definitions

f [] = [] f (x:xs) = g x : h xs

g x = x + 1

h [] = [] h (x:xs) = x : f xs

i [] = [] i (x:xs) = x * 2 : i xs

would identify [f, g] and [i] as recursive groups, and g as non-recursive.

Check if a global binder is recursive. To be conservative, binders which are not included in the RecInfo are assumed to be recursive.

Return the recursive group that a global binder belongs to. If the binder is non-recursive or not included in the RecInfo, Nothing is returned.