  The rewriting system sigma is the set of rules propagating explicit
substitutions in the lambda-calculus with explicit substitutions. In this note,
we prove the undecidability of unification modulo sigma.
