Re: A little print problem

Martin counsels a smart union of type :

> (24) -> for i in 0..7 repeat print([i, x^i]$List Union(INT, F))
> 
> The "problem" is not print, but rather that the simplest signature for the
> constructor function in [i, x^i] the interpreter can find takes some F's and
> returns a List F.  Above I explicitly told the interpreter to use the
> constructor function that takes Union(INT, F)'s and returns a list of such
> elements. 

Yesterday I was looking for a cartesian product, INT x F
Today Alasdair is looking for a cartesian product.

Cartesian products are very common in mathmeatics 
and axiom seems to have no natural way to work arround this notion.

F.