default search action
24th RTA 2013: Eindhoven, The Netherlands
- Femke van Raamsdonk:
24th International Conference on Rewriting Techniques and Applications, RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands. LIPIcs 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-53-8 - Frontmatter, Table of Contents, Preface, Conference Organization.
- Jarkko Kari
:
Pattern Generation by Cellular Automata (Invited Talk). 1-3 - Mitsuhiro Okada:
Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk). 4-19 - Dimitrios Vytiniotis, Simon L. Peyton Jones:
Evidence Normalization in System FC (Invited Talk). 20-38 - Beniamino Accattoli:
Linear Logic and Strong Normalization. 39-54 - Martin Avanzini, Georg Moser:
A Combination Framework for Complexity. 55-70 - Martin Avanzini, Georg Moser:
Tyrolean Complexity Tool: Features and Usage. 71-80 - Kyungmin Bae, Santiago Escobar
Abstract Logical Model Checking of Infinite-State Systems Using Narrowing. 81-96 - Alexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann:
Compression of Rewriting Systems for Termination Analysis. 97-112 - Alexander Baumgartner, Temur Kutsia
A Variant of Higher-Order Anti-Unification. 113-127 - Yohan Boichut, Jacques Chabin, Pierre Réty:
Over-approximating Descendants by Synchronized Tree Languages. 128-142 - Christophe Calvès:
Unifying Nominal Unification. 143-157 - Anupam Das
Rewriting with Linear Inferences in Propositional Logic. 158-173 - Bertram Felgenhauer, Vincent van Oostrom
Proof Orders for Decreasing Diagrams. 174-189 - Ken-etsu Fujita, Aleksy Schubert:
Decidable structures between Church-style and Curry-style. 190-205 - Clemens Grabmayer, Jan Rochel:
Expressibility in the Lambda Calculus with Mu. 206-222 - Yves Guiraud, Philippe Malbos
A Homotopical Completion Procedure with Applications to Coherence of Monoids. 223-238 - Manfred Schmidt-Schauß, Elena Machkasova, David Sabel
Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings. 239-254 - Manfred Schmidt-Schauß, Conrad Rau, David Sabel
Algorithms for Extended Alpha-Equivalence and Complexity. 255-270 - Gert Smolka, Tobias Tebbi:
Unification Modulo Nonnested Recursion Schemes via Anchored Semi-Unification. 271-286 - Christian Sternagel, René Thiemann
Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion. 287-302 - Elena Tushkanova, Christophe Ringeissen, Alain Giorgetti
Automatic Decidability: A Schematic Calculus for Theories with Counting Operators. 303-318 - Sarah Winkler, Aart Middeldorp
Normalized Completion Revisited. 319-334 - Sarah Winkler, Harald Zankl, Aart Middeldorp
Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence. 335-351 - Harald Zankl:
Confluence by Decreasing Diagrams - Formalized. 352-367
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-22 19:08 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: