Is there Ramsey Theorem for infinitary tuples?

I'm wondering if there's any sort of Ramsey relation that allows for the tuples to be of arbitrary infinite size $\mu$? This $\mu$ is below some strongly compact cardinal, so I'm not worried about large cardinal hypotheses.

• There are some generalizations of the Galvin-Prikry Ramsey theorem to higher cardinals. The experts here can no doubt point to them. One source I found with a quick google search is R.J. Watro's paper, "On partitioning the infinite subsets of large cardinals", J. Symbolic Logic 49 no. 2, June, 1984. – Bill Johnson Jun 11 '11 at 4:57

Infinite exponent partition relations are inconsistent with the axiom of choice, so in ZFC, this phenomenon does not exist, but nevertheless, in the context of $ZF+\neg AC$ there is a robust theory. See for example Andres Caicedo's discussion, this Kleinberg article, and the items in this Google search.
The classical Erdős-Hajnal proof uses the axiom of choice - in the guise of a well-ordering of the power set of $\Bbb {N}$ - to construct a "wild" coloring $C$ of infinite subsets $[\Bbb{N}]^\omega$ of $\Bbb{N}$ into two colors such that there is no infinite monochromatic set for $C$.
In contrast, Galvin and Prikry showed that for Borel colorings $C$ of $[\Bbb{N}]^\omega$, an infinite monochromatic subset for $C$ always exists. Silver then extended this result to analytic colorings. Note that $[\Bbb{N}]^\omega$ inherits a natural topology from $P(\Bbb{N})$, which is itself topologized via an identification with the product space $2^\Bbb{N}$.