Programming challenge: wildcard exclusion in cartesian products

[Tomasz Zielonka]

Major correction (missing case):

Tomasz Zielonka wrote:
> generateMatching :: (Ord a) => Int -> Set a -> [Pat a] -> [[a]]
> generateMatching 0   _        []    = [[]]
  generateMatching 0   alphabet (All:ps) = generateMatching 0 alphabet ps
> generateMatching 0   _        (_:_) = []

Best regards
Tomasz

-- 
I am searching for programmers who are good at least in
(Haskell || ML) && (Linux || FreeBSD || math)
for work in Warsaw, Poland