SRechenberger

import Data.List hiding (nub)
import Prelude hiding (gcd)

-- FreeCHR Instance
newtype SolverStep c = SolverStep { runSolverStep :: [c] -> [c] }


match :: [a -> Bool] -> [a] -> [[a]]
match ps as = [ as''
    | as' <- subsequences as, length as' == length ps

SRechenberger

from itertools import permutations


def match(pattern, constraints):
    return (perm
        for perm in permutations(constraints, len(pattern))
        if all(p(c) for p, c in zip(pattern, perm))
    )