04643nam 22007935 450 99646615250331620200701234148.03-540-44980-910.1007/10721975(CKB)1000000000548887(SSID)ssj0000326344(PQKBManifestationID)11232896(PQKBTitleCode)TC0000326344(PQKBWorkID)10296784(PQKB)11001626(DE-He213)978-3-540-44980-5(MiAaPQ)EBC3088248(PPN)155217909(EXLCZ)99100000000054888720121227d2000 u| 0engurnn|008mamaatxtccrRewriting Techniques and Applications[electronic resource] 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings /edited by Leo Bachmair1st ed. 2000.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2000.1 online resource (X, 282 p.) Lecture Notes in Computer Science,0302-9743 ;1833Bibliographic Level Mode of Issuance: Monograph3-540-67778-X Includes bibliographical references.Invited 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.Lecture Notes in Computer Science,0302-9743 ;1833Software engineeringMathematical logicComputer logicProgramming languages (Electronic computers)Artificial intelligenceComputer science—MathematicsSoftware Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XProgramming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Artificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Symbolic and Algebraic Manipulationhttps://scigraph.springernature.com/ontologies/product-market-codes/I17052Software engineering.Mathematical logic.Computer logic.Programming languages (Electronic computers).Artificial intelligence.Computer science—Mathematics.Software Engineering/Programming and Operating Systems.Mathematical Logic and Formal Languages.Logics and Meanings of Programs.Programming Languages, Compilers, Interpreters.Artificial Intelligence.Symbolic and Algebraic Manipulation.005.13/1Bachmair Leoedthttp://id.loc.gov/vocabulary/relators/edtInternational Conference on Rewriting Techniques and Applications(11th :2000 :Norwich, England)MiAaPQMiAaPQMiAaPQBOOK996466152503316Rewriting Techniques and Applications774195UNISA