15. RTA 2004: Aachen, Germany

@proceedings{DBLP:conf/rta/2004,
  editor    = {Vincent van Oostrom},
  title     = {Rewriting Techniques and Applications, 15th International Conference,
               RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings},
  booktitle = {RTA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3091},
  year      = {2004},
  isbn      = {3-540-22153-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Neil D. Jones, Nina Bohr:
  Termination Analysis of the Untyped lamba-Calculus. 1-23
  Electronic Edition (link) BibTeX
• Frédéric Blanqui:
  A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems. 24-39
  Electronic Edition (link) BibTeX
• Yoshihito Toyama:
  Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms. 40-54
  Electronic Edition (link) BibTeX
• Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
  Monadic Second-Order Unification Is NP-Complete. 55-69
  Electronic Edition (link) BibTeX
• Evelyne Contejean:
  A Certified AC Matching Algorithm. 70-84
  Electronic Edition (link) BibTeX
• Johannes Waldmann:
  Matchbox: A Tool for Match-Bounded String Rewriting. 85-94
  Electronic Edition (link) BibTeX
• Hans Zantema:
  TORPA: Termination of Rewriting Proved Automatically. 95-104
  Electronic Edition (link) BibTeX
• Julien Carme, Joachim Niehren, Marc Tommasi:
  Querying Unranked Trees with Stepwise Tree Automata. 105-118
  Electronic Edition (link) BibTeX
• Toshinori Takai:
  A Verification Technique Using Term Rewriting Systems and Abstract Interpretation. 119-133
  Electronic Edition (link) BibTeX
• Herman Geuvers, Rob Nederpelt:
  Rewriting for Fitch Style Natural Deductions. 134-154
  Electronic Edition (link) BibTeX
• Ian Mackie:
  Efficient lambda-Evaluation with Interaction Nets. 155-169
  Electronic Edition (link) BibTeX
• Sébastien Limet, Gernot Salzer:
  Proving Properties of Term Rewrite Systems via Logic Programs. 170-184
  Electronic Edition (link) BibTeX
• Jakob Grue Simonsen:
  On the Modularity of Confluence in Infinitary Term Rewriting. 185-199
  Electronic Edition (link) BibTeX
• Salvador Lucas:
  mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting. 200-209
  Electronic Edition (link) BibTeX
• Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
  Automated Termination Proofs with AProVE. 210-220
  Electronic Edition (link) BibTeX
• Stefan Blom:
  An Approximation Based Approach to Infinitary Lambda Calculi. 221-232
  Electronic Edition (link) BibTeX
• Jeroen Ketema:
  Böhm-Like Trees for Term Rewriting Systems. 233-248
  Electronic Edition (link) BibTeX
• Nao Hirokawa, Aart Middeldorp:
  Dependency Pairs Revisited. 249-268
  Electronic Edition (link) BibTeX
• Takahito Aoto, Toshiyuki Yamada, Yoshihito Toyama:
  Inductive Theorems for Higher-Order Rewriting. 269-284
  Electronic Edition (link) BibTeX
• Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada:
  The Joinability and Unification Problems for Confluent Semi-constructor TRSs. 285-300
  Electronic Edition (link) BibTeX
• Jacob Matthews, Robert Bruce Findler, Matthew Flatt, Matthias Felleisen:
  A Visual Environment for Developing Context-Sensitive Term Rewriting Systems. 301-311
  Electronic Edition (link) BibTeX