Representing Tuple types as products

[Thomas Davie]

Here's a random idea that popped into my head.  There have been a few  
discussions about unicode support in Haskell'. One of the particular  
places this is useful would appear to be type signatures, I was  
considering that it would be particularly neat to be able to  
represent tuples as cross products if the user so desired.  As such:

fst :: α × β → α
would be equivalent to:
fst :: (α, β) → α

Just random thought for the day, what do people think?

Bob