LEADER 04643nam 22007935 450 001 996466152503316 005 20200701234148.0 010 $a3-540-44980-9 024 7 $a10.1007/10721975 035 $a(CKB)1000000000548887 035 $a(SSID)ssj0000326344 035 $a(PQKBManifestationID)11232896 035 $a(PQKBTitleCode)TC0000326344 035 $a(PQKBWorkID)10296784 035 $a(PQKB)11001626 035 $a(DE-He213)978-3-540-44980-5 035 $a(MiAaPQ)EBC3088248 035 $a(PPN)155217909 035 $a(EXLCZ)991000000000548887 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aRewriting Techniques and Applications$b[electronic resource] $e11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings /$fedited by Leo Bachmair 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (X, 282 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1833 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-67778-X 320 $aIncludes bibliographical references. 327 $aInvited Talk -- Rewriting Logic and Maude: Concepts and Applications -- Invited Tutorial -- Tree Automata and Term Rewrite Systems -- Regular Papers -- Absolute Explicit Unification -- Termination and Confluence of Higher-Order Rewrite Systems -- A de Bruijn Notation for Higher-Order Rewriting -- Rewriting Techniques in Theoretical Physics -- Normal Forms and Reduction for Theories of Binary Relations -- Parallelism Constraints -- Linear Higher-Order Matching Is NP-Complete -- Standardization and Confluence for a Lambda Calculus with Generalized Applications -- Linear Second-Order Unification and Context Unification with Tree-Regular Constraints -- Word Problems and Confluence Problems for Restricted Semi-Thue Systems -- The Explicit Representability of Implicit Generalizations -- On the Word Problem for Combinators -- An Algebra of Resolution -- Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems -- Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability -- System Descriptions -- System Description: The Dependency Pair Method -- REM (Reduce Elan Machine): Core of the New ELAN Compiler -- TALP: A Tool for the Termination Analysis of Logic Programs. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1833 606 $aSoftware engineering 606 $aMathematical logic 606 $aComputer logic 606 $aProgramming languages (Electronic computers) 606 $aArtificial intelligence 606 $aComputer science?Mathematics 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 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$aSoftware engineering. 615 0$aMathematical logic. 615 0$aComputer logic. 615 0$aProgramming languages (Electronic computers). 615 0$aArtificial intelligence. 615 0$aComputer science?Mathematics. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aArtificial Intelligence. 615 24$aSymbolic and Algebraic Manipulation. 676 $a005.13/1 702 $aBachmair$b Leo$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Rewriting Techniques and Applications$d(11th :$f2000 :$eNorwich, England) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466152503316 996 $aRewriting Techniques and Applications$9774195 997 $aUNISA