On word problems in equational theories
14th International Colloquium on Automata, languages and programming
Information and Computation - Semantics of Data Types
Unification in Boolean Rings and Abelian Groups
Journal of Symbolic Computation
On restrictions of ordered paramodulation with simplification
CADE-10 Proceedings of the tenth international conference on Automated deduction
Type inclusion constraints and type inference
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Equational formulae with membership constraints
Information and Computation
Higher-order rewrite systems and their confluence
Theoretical Computer Science - Special issue: rewriting systems and applications
Dependent types in practical programming
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Concept of Demodulation in Theorem Proving
Journal of the ACM (JACM)
A Practical Decision Procedure for Arithmetic with Function Symbols
Journal of the ACM (JACM)
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Non-deterministic Computations in ELAN
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Complement Problems and Tree Automata in AC-like Theories (Extended Abstract)
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Solving Systems of Set Constraints using Tree Automata
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Specification and Proof in Membership Equational Logic
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Encompassment Properties and Automata with Constraints
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
The Semantics of CLEAR, A Specification Language
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Higher-Order Matching and Tree Automata
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Diophantine Equations, Presburger Arithmetic and Finite Automata
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Basic Paramodulation and Superposition
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract)
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
Sequentiality, Second-order Monadic Logic and Tree Automata
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Basic Paramodulation and Decidable Theories
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Automata-driven automated induction
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Hi-index | 0.00 |
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.