Twenty Years Later

The first RTA conference took place in Dijon, in 1985. This year, 2005, it takes place in Nara. Nara and Dijon share a glorious past but can be considered as being “Sleeping Beauties”, after the title of a book by the Nobel price novelist yasunari Kawabata. Is RTA sleeping on its glorious past? Back in the late 80s, many of us feared that this would soon be the case, that research in rewrite systems was deepening the gap with everyday's computer science practice, and that we should develop rewrite-based powerful provers that would make a difference with the state of art and help address real applications such as software verification. More than ten years later this has not really happened in the way we thought it would. What has happened is that many research areas, such as programming languages, constraint solving, first-order provers, proof assistants, security theory, and verification have all been fertilized by ideas coming from term rewriting. In return, our field has been renewed by new problems and techniques coming from outside our small community. I am convinced that this will continue, and that new subject areas will join the journey. There are at least two reasons. To quote a celebrated sentence that I have read in many papers: Equations are ubiquitous in computer science. This is the first reason: we all like to use equations for modeling problems. The second is that we have developed extremely powerful, sophisticated tools to reason with equations. Many computer scientists do not know these tools. It is our responsibility to preach for their use by showing all we can do with them.

[1]  L. Fribourg,et al.  Automates concurrents à contraintes , 1994 .

[2]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[3]  Max Dauchet,et al.  Encompassment Properties and Automata with Constraints , 1993, RTA.

[4]  HuetGérard.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980 .

[5]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[6]  Jean-Pierre Jouannaud,et al.  Proofs by induction in equational theories without constructors , 1985, Bull. EATCS.

[7]  Harald Ganzinger,et al.  Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria , 1992, LPAR.

[8]  Hélène Kirchner,et al.  Non-deterministic Computations in ELAN , 1998, WADT.

[9]  Claude Kirchner,et al.  Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[10]  Robert Nieuwenhuis,et al.  Basic paramodulation and decidable theories , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[11]  Jean-Pierre Jouannaud,et al.  Unification in Boolean Rings and Abelian Groups , 1989, J. Symb. Comput..

[12]  Razvan Diaconescu,et al.  Cafeobj Report - The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification , 1998, AMAST Series in Computing.

[13]  Jean-Jacques Lévy,et al.  An abstract standardisation theorem , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[14]  Harald Ganzinger,et al.  On Restrictions of Ordered Paramodulation with Simplification , 1990, CADE.

[15]  C. Kirchner,et al.  Deduction with symbolic constraints , 1990 .

[16]  Hubert Comon-Lundh,et al.  Diophantine Equations, Presburger Arithmetic and Finite Automata , 1996, CAAP.

[17]  Frédéric Blanqui,et al.  Inductive types in the Calculus of Algebraic Constructions , 2003, Fundam. Informaticae.

[18]  Sophie Tison,et al.  Solving Systems of Set Constraints using Tree Automata , 1993, STACS.

[19]  Michaël Rusinowitch,et al.  On Word Problems in Equational Theories , 1987, ICALP.

[20]  José Meseguer,et al.  A logical theory of concurrent objects and its realization in the Maude language , 1993 .

[21]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[22]  Hubert Comon-Lundh,et al.  Higher-Order Matching and Tree Automata , 1997, CSL.

[23]  Robert E. Shostak,et al.  A Practical Decision Procedure for Arithmetic with Function Symbols , 1979, JACM.

[24]  Larry Wos,et al.  The Concept of Demodulation in Theorem Proving , 1967, JACM.

[25]  David A. Plaisted,et al.  Semantic Confluence Tests and Completion Methods , 1985, Inf. Control..

[26]  Alexander Aiken,et al.  Type inclusion constraints and type inference , 1993, FPCA '93.

[27]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[28]  Claude Kirchner,et al.  Pure patterns type systems , 2003, POPL '03.

[29]  José Meseguer,et al.  Specification and proof in membership equational logic , 2000, Theor. Comput. Sci..

[30]  Robert E. Shostak,et al.  Deciding Combinations of Theories , 1982, JACM.

[31]  Wayne Snyder,et al.  Basic Paramodulation and Superposition , 1992, CADE.

[32]  Tobias Nipkow,et al.  Higher-Order Rewrite Systems and Their Confluence , 1998, Theor. Comput. Sci..

[33]  Joseph A. Goguen,et al.  The Semantics of CLEAR, A Specification Language , 1979, Abstract Software Specifications.

[34]  Frank Pfenning,et al.  Dependent types in practical programming , 1999, POPL '99.

[35]  Harald Ganzinger,et al.  Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract) , 1990, CTRS.

[36]  Sebastian Mödersheim,et al.  The AVISS Security Protocol Analysis Tool , 2002, CAV.

[37]  Ataru T. Nakagawa,et al.  An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks , 1997, First IEEE International Conference on Formal Engineering Methods.

[38]  Hubert Comon,et al.  Sequentiality, second order monadic logic and tree automata , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[39]  Frédéric Blanqui.  Definitions by rewriting in the Calculus of Constructions , 2005, Math. Struct. Comput. Sci..

[40]  Christine Paulin-Mohring,et al.  Inductive Definitions in the system Coq - Rules and Properties , 1993, TLCA.

[41]  Denis Lugiez,et al.  Complement Problems and Tree Automata in AC-like Theories (Extended Abstract) , 1993, STACS.

[42]  Gerald E. Peterson,et al.  A Technique for Establishing Completeness Results in Theorem Proving with Equality , 1980, SIAM J. Comput..

[43]  Jacek Chrzaszcz,et al.  Modules in Coq Are and Will Be Correct , 2003, TYPES.

[44]  Jean-Pierre Jouannaud,et al.  Automata-Driven Automated Induction , 2001, Inf. Comput..

[45]  Hubert Comon-Lundh,et al.  Equational Formulae with Membership Constraints , 1994, Inf. Comput..

[46]  J. Jouannaud,et al.  Higher-order rewriting with types and arities , 2004 .

[47]  Harald Ganzinger,et al.  Set constraints are the monadic class , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.