Abstract is missing.
- Termination Analysis of the Untyped lamba-CalculusNeil D. Jones, Nina Bohr. 1-23 [doi]
- A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite SystemsFrédéric Blanqui. 24-39 [doi]
- Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order TermsYoshihito Toyama. 40-54 [doi]
- Monadic Second-Order Unification Is NP-CompleteJordi Levy, Manfred Schmidt-Schauß, Mateu Villaret. 55-69 [doi]
- A Certified AC Matching AlgorithmEvelyne Contejean. 70-84 [doi]
- Matchbox: A Tool for Match-Bounded String RewritingJohannes Waldmann. 85-94 [doi]
- TORPA: Termination of Rewriting Proved AutomaticallyHans Zantema. 95-104 [doi]
- Querying Unranked Trees with Stepwise Tree AutomataJulien Carme, Joachim Niehren, Marc Tommasi. 105-118 [doi]
- A Verification Technique Using Term Rewriting Systems and Abstract InterpretationToshinori Takai. 119-133 [doi]
- Rewriting for Fitch Style Natural DeductionsHerman Geuvers, Rob Nederpelt. 134-154 [doi]
- Efficient lambda-Evaluation with Interaction NetsIan Mackie. 155-169 [doi]
- Proving Properties of Term Rewrite Systems via Logic ProgramsSébastien Limet, Gernot Salzer. 170-184 [doi]
- On the Modularity of Confluence in Infinitary Term RewritingJakob Grue Simonsen. 185-199 [doi]
- mu-term: A Tool for Proving Termination of Context-Sensitive RewritingSalvador Lucas. 200-209 [doi]
- Automated Termination Proofs with AProVEJürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke. 210-220 [doi]
- An Approximation Based Approach to Infinitary Lambda CalculiStefan Blom. 221-232 [doi]
- Böhm-Like Trees for Term Rewriting SystemsJeroen Ketema. 233-248 [doi]
- Dependency Pairs RevisitedNao Hirokawa, Aart Middeldorp. 249-268 [doi]
- Inductive Theorems for Higher-Order RewritingTakahito Aoto, Toshiyuki Yamada, Yoshihito Toyama. 269-284 [doi]
- The Joinability and Unification Problems for Confluent Semi-constructor TRSsIchiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada. 285-300 [doi]
- A Visual Environment for Developing Context-Sensitive Term Rewriting SystemsJacob Matthews, Robby Findler, Matthew Flatt, Matthias Felleisen. 301-311 [doi]