\documentclass{rtaloop}


\begin{document}
\begin{problem}{Hubert Comon}{}{April 1995}

\begin{abstract}
  Is strong sequentiality decidable for arbitrary rewrite systems?
\end{abstract}
{\em Strong sequentiality\/} is a property of rewrite systems introduced in
\cite{HL78:inria} (see \cite{HL91:mit}), which ensures the existence of optimal
reduction strategies.  Is strong sequentiality
decidable for arbitrary rewrite systems?  What is the complexity of strong
sequentiality in the linear case?  in the orthogonal case?  Decidability
results for particular rewrite systems are given in
\cite{HL91:mitb,toyama92,jouannaud94ctrs}, among others.
\nocite{HL79:inria}

\end{problem}
\end{document}