default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th RTA 2004: Aachen, Germany
- Vincent van Oostrom
:
Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings. Lecture Notes in Computer Science 3091, Springer 2004, ISBN 3-540-22153-0 - Neil D. Jones, Nina Bohr:
Termination Analysis of the Untyped lamba-Calculus. 1-23 - Frédéric Blanqui:
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems. 24-39 - Yoshihito Toyama:
Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms. 40-54 - Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
Monadic Second-Order Unification Is NP-Complete. 55-69 - Evelyne Contejean:
A Certified AC Matching Algorithm. 70-84 - Johannes Waldmann:
Matchbox: A Tool for Match-Bounded String Rewriting. 85-94 - Hans Zantema:
TORPA: Termination of Rewriting Proved Automatically. 95-104 - Julien Carme, Joachim Niehren, Marc Tommasi:
Querying Unranked Trees with Stepwise Tree Automata. 105-118 - Toshinori Takai:
A Verification Technique Using Term Rewriting Systems and Abstract Interpretation. 119-133 - Herman Geuvers, Rob Nederpelt:
Rewriting for Fitch Style Natural Deductions. 134-154 - Ian Mackie:
Efficient lambda-Evaluation with Interaction Nets. 155-169 - Sébastien Limet, Gernot Salzer:
Proving Properties of Term Rewrite Systems via Logic Programs. 170-184 - Jakob Grue Simonsen:
On the Modularity of Confluence in Infinitary Term Rewriting. 185-199 - Salvador Lucas:
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting. 200-209 - Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Automated Termination Proofs with AProVE. 210-220 - Stefan Blom:
An Approximation Based Approach to Infinitary Lambda Calculi. 221-232 - Jeroen Ketema:
Böhm-Like Trees for Term Rewriting Systems. 233-248 - Nao Hirokawa, Aart Middeldorp:
Dependency Pairs Revisited. 249-268 - Takahito Aoto, Toshiyuki Yamada, Yoshihito Toyama:
Inductive Theorems for Higher-Order Rewriting. 269-284 - Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada:
The Joinability and Unification Problems for Confluent Semi-constructor TRSs. 285-300 - Jacob Matthews, Robert Bruce Findler, Matthew Flatt, Matthias Felleisen:
A Visual Environment for Developing Context-Sensitive Term Rewriting Systems. 301-311
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-27 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
