We consider higher-order rewriting in presence of associative
and commutative (AC) symbols. The paper presents a reduction
ordering which allows to state the termination of a given
rewriting
system. This ordering is an AC-extension of lambda-RPO
and is defined on
simply-typed higher-order terms in beta-normal eta-long
form. It
is total on ground terms.