Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st RTA 2010: Edinburgh, Scottland, UK
- Christopher Lynch:
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010, July 11-13, 2010, Edinburgh, Scottland, UK. LIPIcs 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2010, ISBN 978-3-939897-18-7
- Christopher Lynch:
Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List). - Christopher Lynch:
Preface. - Mikolaj Bojanczyk:
Automata for Data Words and Data Trees. 1-4 - Vincent van Oostrom:
Realising Optimal Sharing. 5-6 - Takahito Aoto:
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling. 7-16 - Claus Appel, Vincent van Oostrom
, Jakob Grue Simonsen:
Higher-Order (Non-)Modularity . 17-32 - Martin Avanzini, Georg Moser:
Closing the Gap Between Runtime Complexity and Polytime Computability. 33-48 - Patrick Bahr:
Abstract Models of Transfinite Reductions. 49-66 - Patrick Bahr:
Partial Order Infinitary Term Rewriting and Böhm Trees. 67-84 - Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom:
Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. 85-102 - Ken-etsu Fujita, Aleksy Schubert:
The Undecidability of Type Related Problems in Type-free Style System F. 103-118 - Karl Gmeiner, Bernhard Gramlich, Felix Schernhammer:
On (Un)Soundness of Unravelings. 119-134 - Alessio Guglielmi, Tom Gundersen, Michel Parigot:
A Proof Calculus Which Reduces Syntactic Bureaucracy. 135-150 - Mark Hills, Grigore Rosu:
A Rewriting Logic Semantics Approach to Modular Program Analysis. 151-160 - Stefan Kahrs:
Infinitary Rewriting: Foundations Revisited. 161-176 - Alexander Koller, Stefan Thater:
Underspecified computation of normal forms. 177-192 - Temur Kutsia, Mircea Marin:
Order-Sorted Unification with Regular Expression Sorts. 193-208 - Jordi Levy, Mateu Villaret:
An Efficient Nominal Unification Algorithm. 209-226 - Samuel Mimram:
Computing Critical Pairs in 2-Dimensional Rewriting Systems. 227-242 - Friedrich Neurauter, Aart Middeldorp:
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers. 243-258 - Carsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl:
Automated Termination Analysis of Java Bytecode by Term Rewriting. 259-276 - Adrián Riesco, Alberto Verdejo, Narciso Martí-Oliet:
Declarative Debugging of Missing Answers for Maude. 277-294 - Manfred Schmidt-Schauß, David Sabel, Elena Machkasova:
Simulation in the Call-by-Need Lambda-Calculus with letrec. 295-310 - Jakob Grue Simonsen:
Weak Convergence and Uniform Normalization in Infinitary Rewriting. 311-324 - Christian Sternagel, René Thiemann:
Certified Subterm Criterion and Certified Usable Rules. 325-340 - Irène Durand, Géraud Sénizergues, Marc Sylvestre:
Termination of linear bounded term rewriting systems. 341-356 - Johannes Waldmann:
Polynomially Bounded Matrix Interpretations. 357-372 - Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara:
Optimizing mkbTT. 373-384 - Harald Zankl, Martin Korp:
Modular Complexity Analysis via Relative Complexity. 385-400 - Hans Zantema, Matthias Raffelsieper:
Proving Productivity in Infinite Data Structures. 401-416
a service of 
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 2023-03-23 23:58 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:
