Matching two patterns?

*To*: mathgroup at smc.vnet.net*Subject*: [mg74105] Matching two patterns?*From*: "Neri" <nkafkafi at yahoo.com>*Date*: Sat, 10 Mar 2007 06:52:26 -0500 (EST)

Can two patterns be matched with each other, to find if they intersect? What I mean is that { _, 1} matches {1, _ } in the sense that there are lists that fit both, in this case {1,1}. However, { _, 1} doesn't match { _, 2} in the sense that no list can fit both. For lists it seems easy to write a function that does that, but I wondered if such a function already exists and can it be more general? Thanks, Neri