Rewriting techniques and applications : 15th international conference, RTA 2004, Aachen, Germany, June 3-5, 2004 : proceedings /
This volume contains the proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA 2004), which was held June 2– 5, 2004, at the RWTH Aachen in Germany. RTA is the major forum for the presentation of research on all aspects of rewriting. Previous RTA conferences...
| Corporate Author: | |
|---|---|
| Other Authors: | |
| Format: | Conference Proceeding Book |
| Language: | English |
| Published: |
Berlin :
Springer,
2004
Berlin ; New York : c2004 Berlin ; New York, NY : c2004 Berlin ; New York : 2004 |
| Series: | Lecture notes in computer science,
3091 Lecture notes in computer science ; 3091 Lecture notes in computer science 3091 Lecture notes in computer science 3091 |
| Subjects: |
Table of Contents:
- Termination Analysis of the Untyped ?-Calculus
- A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
- Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms
- Monadic Second-Order Unification Is NP-Complete
- A Certified AC Matching Algorithm
- Matchbox: A Tool for Match-Bounded String Rewriting
- TORPA: Termination of Rewriting Proved Automatically
- Querying Unranked Trees with Stepwise Tree Automata
- A Verification Technique Using Term Rewriting Systems and Abstract Interpretation
- Rewriting for Fitch Style Natural Deductions
- Efficient ?-Evaluation with Interaction Nets
- Proving Properties of Term Rewrite Systems via Logic Programs
- On the Modularity of Confluence in Infinitary Term Rewriting
- mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
- Automated Termination Proofs with AProVE
- An Approximation Based Approach to Infinitary Lambda Calculi
- Böhm-Like Trees for Term Rewriting Systems
- Dependency Pairs Revisited
- Inductive Theorems for Higher-Order Rewriting
- The Joinability and Unification Problems for Confluent Semi-constructor TRSs
- A Visual Environment for Developing Context-Sensitive Term Rewriting Systems
- Termination analysis of the untyped [lambda]-calculus / Neil D. Jones and Nina Bohr
- A type-based termination criterion for dependently-typed higher-order rewrite systems / Frederic Blanqui
- Termination of S-expression rewriting systems : lexicographic path ordering for higher-order terms / Yoshihito Toyama
- Monadic second-order unification is NP-complete / Jordi Levy, Manfred Schmidt-Schauss and Mateu Villaret
- A certified AC matching algorithm / Evelyne Contejean
- Matchbox : a tool for match-bounded string rewriting / Johannes Waldmann
- TORPA : termination of rewriting proved automatically / Hans Zantema
- Querying unranked trees with stepwise tree automata / Julien Carme, Joachim Niehren and Marc Tommasi
- A verification technique using term rewriting systems and abstract interpretation / Toshinori Takai
- Rewriting for Fitch style natural deductions / Herman Geuvers and Rob Nederpelt
- Efficient [lambda]-evaluation with interaction nets / Ian Mackie
- Proving properties of term rewrite systems via logic programs / Sebastien Limet and Gernot Salzer
- On the modularity of confluence in infinitary term rewriting / Jakob Grue Simonsen
- MU-TERM : a tool for proving termination of context-sensitive rewriting / Salvador Lucas
- Automated termination proofs with AProVE / Jurgen Giesl, Rene Thiemann, Peter Schneider-Kamp and Stephan Falke
- An approximation based approach to infinitary lambda calculi / Stefan Blom
- Bohm-like trees for term rewriting systems / Jeroen Ketema
- Dependency pairs revisited / Nao Hirokawa and Aart Middeldorp
- Inductive theorems for higher-order rewriting / Takahito Aoto, Toshiyuki Yamada and Yoshihito Toyama
- The joinability and unification problems for confluent semi-constructor TRSs / Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta and Toshiyuki Yamada
- A visual environment for developing context-sensitive term rewriting systems / Jacob Matthews, Robert Bruce Findler, Matthew Flatt and Matthias Felleisen