LEADER 04272oam 2200673 450 001 996466026003316 005 20210520115848.0 010 $a1-280-80485-8 010 $a9786610804856 010 $a3-540-44881-0 024 7 $a10.1007/3-540-44881-0 035 $a(CKB)1000000000212057 035 $a(EBL)3036552 035 $a(SSID)ssj0000308420 035 $a(PQKBManifestationID)11225426 035 $a(PQKBTitleCode)TC0000308420 035 $a(PQKBWorkID)10258963 035 $a(PQKB)10058192 035 $a(DE-He213)978-3-540-44881-5 035 $a(MiAaPQ)EBC3036552 035 $a(MiAaPQ)EBC6413226 035 $a(MiAaPQ)EBC6413215 035 $a(Au-PeEL)EBL6413226 035 $a(OCoLC)166467953 035 $a(PPN)15521408X 035 $a(EXLCZ)991000000000212057 100 $a20210520d2003 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aRewriting techniques and applications $e14th international conference, RTA 2003, Valencia, Spain, June 2003 : proceedings /$fedited by Robert Nieuwenhuis 205 $a1st ed. 2003. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[2003] 215 $a1 online resource (526 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2706 300 $aDescription based upon print version of record. 311 $a3-540-40254-3 320 $aIncludes bibliographical references and index. 327 $aInvited Talk -- Symbolic Systems Biology -- Confluence as a Cut Elimination Property -- Associative-Commutative Rewriting on Large Terms -- A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms -- Efficient Reductions with Director Strings -- Rewriting Logic and Probabilities -- The Maude 2.0 System -- Diagrams for Meaning Preservation -- Expression Reduction Systems with Patterns -- Residuals in Higher-Order Rewriting -- Rewriting UNITY -- New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols -- An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation -- Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties -- Rule-Based Analysis of Dimensional Safety -- Invited Talk -- Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems -- On the Complexity of Higher-Order Matching in the Linear ?-Calculus -- XML Schema, Tree Logic and Sheaves Automata -- Size-Change Termination for Term Rewriting -- Monotonic AC-Compatible Semantic Path Orderings -- Relating Derivation Lengths with the Slow-Growing Hierarchy Directly -- Tsukuba Termination Tool -- Liveness in Rewriting -- Validation of the JavaCard Platform with Implicit Induction Techniques -- ?Term Partition? for Mathematical Induction -- Equational Prover of Theorema -- Termination of Simply Typed Term Rewriting by Translation and Labelling -- Rewriting Modulo in Deduction Modulo -- Termination of String Rewriting Rules That Have One Pair of Overlaps -- Environments for Term Rewriting Engines for Free! -- Joint RTA-TLCA Invited Talk -- A Logical Algorithm for ML Type Inference -- A Rewriting Alternative to Reidemeister-Schreier -- Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) -- Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism -- Testing Extended Regular Language Membership Incrementally by Rewriting. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2706 517 3 $aRTA 2003 606 $aRewriting systems (Computer science)$vCongresses 606 $aComputer programming$vCongresses 606 $aAlgorithms$vCongresses 615 0$aRewriting systems (Computer science) 615 0$aComputer programming 615 0$aAlgorithms 676 $a005.131 702 $aNieuwenhuis$b Robert 712 12$aInternational Conference on Rewriting Techniques and Applications 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996466026003316 996 $aRewriting Techniques and Applications$9774195 997 $aUNISA