14. RTA 2003:
: Confluence as a Cut Elimination Property.
: Associative-Commutative Rewriting on Large Terms.
Kumar Neeraj Verma
: Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties.
: Invited Talk: Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems.
: Termination of String Rewriting Rules That Have One Pair of Overlaps.
David A. McAllester
: Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference.