Conferences in DBLP

Rewriting Techniques and Applications (RTA) (rta)
2005 (conf/rta/2005)

1. Yoshihito Toyama
   Confluent Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
   RTA, 2005, pp:1- [Conf]
   
2. Jaco van de Pol, Hans Zantema
   Generalized Innermost Rewriting. [Citation Graph (0, 0)][DBLP]
   RTA, 2005, pp:2-16 [Conf]
   
3. Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio
   Orderings for Innermost Termination. [Citation Graph (0, 0)][DBLP]
   RTA, 2005, pp:17-31 [Conf]
   
4. Nachum Dershowitz, E. Castedo Ellerman
   Leanest Quasi-orderings. [Citation Graph (0, 0)][DBLP]
   RTA, 2005, pp:32-45 [Conf]
   
5. Michael Abbott, Neil Ghani, Christoph Lüth
   Abstract Modularity. [Citation Graph (0, 0)][DBLP]
   RTA, 2005, pp:46-60 [Conf]
   
6. Piotr Hoffman
   Union of Equational Theories: An Algebraic Approach. [Citation Graph (0, 0)][DBLP]
   RTA, 2005, pp:61-73 [Conf]
   
7. James Cheney
   Equivariant Unification. [Citation Graph (0, 0)][DBLP]
   RTA, 2005, pp:74-89 [Conf]
   
8. Christopher Lynch, Barbara Morawska
   Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories. [Citation Graph (0, 0)][DBLP]
   RTA, 2005, pp:90-104 [Conf]
   
9. Thierry Boy de la Tour, Mnacho Echenim
   Unification in a Class of Permutative Theories. [Citation Graph (0, 0)][DBLP]
   RTA, 2005, pp:105-119 [Conf]
   
10. Takahito Aoto, Toshiyuki Yamada
    Dependency Pairs for Simply Typed Term Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:120-134 [Conf]
    
11. Makoto Hamana
    Universal Algebra for Termination of Higher-Order Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:135-149 [Conf]
    
12. Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
    Quasi-interpretations and Small Space Bounds. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:150-164 [Conf]
    
13. Joe Hendrix, Manuel Clavel, José Meseguer
    A Sufficient Completeness Reasoning Tool for Partial Specifications. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:165-174 [Conf]
    
14. Nao Hirokawa, Aart Middeldorp
    Tyrolean Termination Tool. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:175-184 [Conf]
    
15. Philip Wadler
    Call-by-Value Is Dual to Call-by-Name - Reloaded. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:185-203 [Conf]
    
16. Jérôme Rocheteau
    lambda-µ-Calculus and Duality: Call-by-Name and Call-by-Value. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:204-218 [Conf]
    
17. Alex K. Simpson
    Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:219-234 [Conf]
    
18. Ryo Yoshinaka
    Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:235-249 [Conf]
    
19. José Meseguer
    Localized Fairness: A Rewriting Semantics. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:250-263 [Conf]
    
20. Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
    Partial Inversion of Constructor Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:264-278 [Conf]
    
21. Santiago Escobar, José Meseguer, Prasanna Thati
    Natural Narrowing for General Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:279-293 [Conf]
    
22. Hubert Comon-Lundh, Stéphanie Delaune
    The Finite Variant Property: How to Get Rid of Some Algebraic Properties. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:294-307 [Conf]
    
23. Pascal Lafourcade, Denis Lugiez, Ralf Treinen
    Intruder Deduction for AC-Like Equational Theories with Homomorphisms. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:308-322 [Conf]
    
24. Olivier Bournez, Florent Garnier
    Proving Positive Almost-Sure Termination. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:323-337 [Conf]
    
25. Wojciech Moczydlowski, Alfons Geser
    Termination of Single-Threaded One-Rule Semi-Thue Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:338-352 [Conf]
    
26. Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
    On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:353-367 [Conf]
    
27. Jean-Pierre Jouannaud
    Twenty Years Later. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:368-375 [Conf]
    
28. Nachum Dershowitz
    Open. Closed. Open. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:376-393 [Conf]
    
29. Amy P. Felty
    A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:394-406 [Conf]
    
30. Delia Kesner, Stephane Lengrand
    Extending the Explicit Substitution Paradigm. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:407-422 [Conf]
    
31. Gilles Dowek, Benjamin Werner
    Arithmetic as a Theory Modulo. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:423-437 [Conf]
    
32. Jeroen Ketema, Jakob Grue Simonsen
    Infinitary Combinatory Reduction Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:438-452 [Conf]
    
33. Robert Nieuwenhuis, Albert Oliveras
    Proof-Producing Congruence Closure. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:453-468 [Conf]
    
34. Aaron Stump, Li-Yang Tan
    The Algebra of Equality Proofs. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:469-483 [Conf]
    
35. Ahmed Bouajjani, Tayssir Touili
    On Computing Reachability Sets of Process Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:484-499 [Conf]
    
36. Iovka Boneva, Jean-Marc Talbot
    Automata and Logics for Unranked and Unordered Trees. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:500-515 [Conf]