match package:ghc

Decompose a Graph into the MContext found for the given node and the remaining Graph.
Does the key i match the prefix p (up to but not including bit m)?
Typecheck some Matches
Allow binding only for any variable in the set. Variables may be bound to any type. Used when doing simple matching; e.g. can we find a substitution
S = [a :-> t1, b :-> t2] such that
S( Maybe (a, b->Int )  =   Maybe (Bool, Char -> Int)
Decompose a graph into the Context for an arbitrarily-chosen Node and the remaining Graph.
matchSimply is a wrapper for match which deals with the situation where we want to match a single expression against a single pattern. It returns an expression.