The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Neil D. Jones, Nina Bohr
    Termination Analysis of the Untyped lamba-Calculus. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:1-23 [Conf]
  2. Frédéric Blanqui
    A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:24-39 [Conf]
  3. Yoshihito Toyama
    Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:40-54 [Conf]
  4. Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
    Monadic Second-Order Unification Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:55-69 [Conf]
  5. Evelyne Contejean
    A Certified AC Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:70-84 [Conf]
  6. Johannes Waldmann
    Matchbox: A Tool for Match-Bounded String Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:85-94 [Conf]
  7. Hans Zantema
    TORPA: Termination of Rewriting Proved Automatically. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:95-104 [Conf]
  8. Julien Carme, Joachim Niehren, Marc Tommasi
    Querying Unranked Trees with Stepwise Tree Automata. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:105-118 [Conf]
  9. Toshinori Takai
    A Verification Technique Using Term Rewriting Systems and Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:119-133 [Conf]
  10. Herman Geuvers, Rob Nederpelt
    Rewriting for Fitch Style Natural Deductions. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:134-154 [Conf]
  11. Ian Mackie
    Efficient lambda-Evaluation with Interaction Nets. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:155-169 [Conf]
  12. Sébastien Limet, Gernot Salzer
    Proving Properties of Term Rewrite Systems via Logic Programs. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:170-184 [Conf]
  13. Jakob Grue Simonsen
    On the Modularity of Confluence in Infinitary Term Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:185-199 [Conf]
  14. Salvador Lucas
    mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:200-209 [Conf]
  15. Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke
    Automated Termination Proofs with AProVE. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:210-220 [Conf]
  16. Stefan Blom
    An Approximation Based Approach to Infinitary Lambda Calculi. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:221-232 [Conf]
  17. Jeroen Ketema
    Böhm-Like Trees for Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:233-248 [Conf]
  18. Nao Hirokawa, Aart Middeldorp
    Dependency Pairs Revisited. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:249-268 [Conf]
  19. Takahito Aoto, Toshiyuki Yamada, Yoshihito Toyama
    Inductive Theorems for Higher-Order Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:269-284 [Conf]
  20. Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada
    The Joinability and Unification Problems for Confluent Semi-constructor TRSs. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:285-300 [Conf]
  21. Jacob Matthews, Robert Bruce Findler, Matthew Flatt, Matthias Felleisen
    A Visual Environment for Developing Context-Sensitive Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:301-311 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002