Regular expressions for data words

I will discuss a proposal (one of many others) for regular expressions that use infinite alphabets. The regular expressions describe exactly the languages that can be recognised by nondeterministic orbit-finite automata (equivalently, nondeterministic register automata). The basic idea is to consider expressions that describe not just words, but words with side effects that are atom permutations.