default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th RTA 2008: Hagenberg, Austria
- Andrei Voronkov:
Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings. Lecture Notes in Computer Science 5117, Springer 2008, ISBN 978-3-540-70588-8 - María Alpuente
, Santiago Escobar, José Iborra:
Modular Termination of Basic Narrowing. 1-16 - Pablo Arrighi, Gilles Dowek:
Linear-algebraic lambda-calculus: higher-order, encodings, and confluence.. 17-31 - Emilie Balland, Pierre-Etienne Moreau:
Term-Graph Rewriting Via Explicit Paths. 32-47 - Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko:
Finer Is Better: Abstraction Refinement for Rewriting Approximations. 48-62 - Rachid Echahed, Nicolas Peltier:
A Needed Rewriting Strategy for Data-Structures with Pointers. 63-78 - Santiago Escobar, José Meseguer, Ralf Sasse:
Effectively Checking the Finite Variant Property. 79-93 - Stephan Falke, Deepak Kapur:
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures. 94-109 - Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl:
Maximal Termination. 110-125 - Raúl Gutiérrez, Salvador Lucas, Xavier Urbain:
Usable Rules for Context-Sensitive Rewrite Systems. 126-141 - Joe Hendrix, Hitoshi Ohsaki:
Combining Equational Tree Automata over AC and ACI Theories. 142-156 - Florent Jacquemard, Michaël Rusinowitch:
Closure of Hedge-Automata Languages by Hedge Rewriting. 157-171 - Jeroen Ketema:
On Normalisation of Infinitary Combinatory Reduction Systems. 172-186 - Yoshiharu Kojima, Masahiko Sakai:
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems. 187-201 - Adam Koprowski, Johannes Waldmann:
Arctic Termination ...Below Zero. 202-216 - Marco Kuhlmann, Joachim Niehren:
Logics and Automata for Totally Ordered Trees. 217-231 - Yves Lafont, Pierre Rannou:
Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks. 232-245 - Jordi Levy, Mateu Villaret:
Nominal Unification from a Higher-Order Perspective. 246-260 - Steffen Mazanek, Mark Minas:
Functional-Logic Graph Parser Combinators. 261-275 - Georg Moser, Andreas Schnabl:
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations. 276-290 - Naoki Kobayashi, Hitoshi Ohsaki:
Tree Automata for Non-linear Arithmetic. 291-305 - Vincent van Oostrom:
Confluence by Decreasing Diagrams. 306-320 - Manfred Schmidt-Schauß, Elena Machkasova:
A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case. 321-335 - Christian Sternagel, Aart Middeldorp:
Root-Labeling. 336-350 - Sorin Stratulat:
Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities. 351-365 - René Thiemann, Jürgen Giesl, Peter Schneider-Kamp:
Deciding Innermost Loops. 366-380 - Yoshihito Toyama:
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations. 381-391 - Kazunori Ueda:
Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting. 392-408 - Christian Urban, Bozhi Zhu:
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof. 409-424 - Jörg Endrullis, Roel C. de Vrijer:
Reduction Under Substitution. 425-440 - Hans Zantema:
Normalization of Infinite Terms. 441-455
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 2026-05-19 22:22 CEST 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:
