LEADER 06297nam 22008055 450 001 996466225803316 005 20200706112619.0 010 $a3-540-25979-1 024 7 $a10.1007/b98160 035 $a(CKB)1000000000212420 035 $a(DE-He213)978-3-540-25979-4 035 $a(SSID)ssj0000237865 035 $a(PQKBManifestationID)11221128 035 $a(PQKBTitleCode)TC0000237865 035 $a(PQKBWorkID)10222204 035 $a(PQKB)10599308 035 $a(MiAaPQ)EBC3088015 035 $a(PPN)15519660X 035 $a(EXLCZ)991000000000212420 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aRewriting Techniques and Applications$b[electronic resource] $e15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings /$fedited by Vincent van Oostrom 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (X, 315 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3091 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-22153-0 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aTermination Analysis of the Untyped ?-Calculus -- A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems -- Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms -- Monadic Second-Order Unification Is NP-Complete -- A Certified AC Matching Algorithm -- Matchbox: A Tool for Match-Bounded String Rewriting -- TORPA: Termination of Rewriting Proved Automatically -- Querying Unranked Trees with Stepwise Tree Automata -- A Verification Technique Using Term Rewriting Systems and Abstract Interpretation -- Rewriting for Fitch Style Natural Deductions -- Efficient ?-Evaluation with Interaction Nets -- Proving Properties of Term Rewrite Systems via Logic Programs -- On the Modularity of Confluence in Infinitary Term Rewriting -- mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting -- Automated Termination Proofs with AProVE -- An Approximation Based Approach to Infinitary Lambda Calculi -- Böhm-Like Trees for Term Rewriting Systems -- Dependency Pairs Revisited -- Inductive Theorems for Higher-Order Rewriting -- The Joinability and Unification Problems for Confluent Semi-constructor TRSs -- A Visual Environment for Developing Context-Sensitive Term Rewriting Systems. 330 $aThis volume contains the proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA 2004), which was held June 2? 5, 2004, at the RWTH Aachen in Germany. RTA is the major forum for the presentation of research on all aspects of rewriting. Previous RTA conferences took place in Dijon (1985), Bordeaux (1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), Rutgers (1996), Sitges (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht (2001), Copenhagen (2002), and Valencia (2003). The program committee selected 19 papers for presentation, including ?ve system descriptions, from a total of 43 submissions. In addition, there were invited talks by Neil Jones, Aart Middeldorp, and Robin Milner. Many people helped to make RTA 2004 a success. I am grateful to the m- bers of the program committee and the external referees for reviewing the s- missionsandmaintainingthehighstandardsoftheRTAconferences. Itisagreat pleasure to thank the conference chair Jurgen ¨ Giesl and the other members of the local organizing committee. They were in charge of the local organization of all events partaking in the Federated Conference on Rewriting, Deduction, and Programming (RDP). Apart from RTA 2004, these events were: ? 2nd International Workshop on Higher-Order Rewriting (Delia Kesner, Femke van Raamsdonk, and Joe Wells), ? 5th International Workshop on Rule-Based Programming (Slim Abdennadher and Christophe Ringeissen), ? 13thInternationalWorkshoponFunctionaland(Constraint)LogicProgr- ming (Herbert Kuchen), ? IFIP Working Group 1. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3091 606 $aMathematical logic 606 $aProgramming languages (Electronic computers) 606 $aComputer programming 606 $aComputer logic 606 $aArtificial intelligence 606 $aComputer science?Mathematics 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aSymbolic and Algebraic Manipulation$3https://scigraph.springernature.com/ontologies/product-market-codes/I17052 615 0$aMathematical logic. 615 0$aProgramming languages (Electronic computers). 615 0$aComputer programming. 615 0$aComputer logic. 615 0$aArtificial intelligence. 615 0$aComputer science?Mathematics. 615 14$aMathematical Logic and Formal Languages. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aProgramming Techniques. 615 24$aLogics and Meanings of Programs. 615 24$aArtificial Intelligence. 615 24$aSymbolic and Algebraic Manipulation. 676 $a005.13/1 702 $aOostrom$b Vincent van$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Rewriting Techniques and Applications 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466225803316 996 $aRewriting Techniques and Applications$9774195 997 $aUNISA