05070nam 22007575 450 99646616690331620200704050756.03-540-45127-710.1007/3-540-45127-7(CKB)1000000000211405(SSID)ssj0000326345(PQKBManifestationID)11255385(PQKBTitleCode)TC0000326345(PQKBWorkID)10284082(PQKB)10713125(DE-He213)978-3-540-45127-3(MiAaPQ)EBC3072507(PPN)15521120X(EXLCZ)99100000000021140520121227d2001 u| 0engurnn|008mamaatxtccrRewriting Techniques and Applications[electronic resource] 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001. Proceedings /edited by Aart Middeldorp1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (XII, 368 p.) Lecture Notes in Computer Science,0302-9743 ;2051Bibliographic Level Mode of Issuance: Monograph3-540-42117-3 Includes bibliographical references at the end of each chapters and index.Invited Talks -- Computing and Proving -- Rewriting for Deduction and Verification -- Regular Papers -- Universal Interaction Systems with Only Two Agents -- General Recursion on Second Order Term Algebras -- Beta Reduction Constraints -- From Higher-Order to First-Order Rewriting -- Combining Pattern E-Unification Algorithms -- Matching Power -- Dependency Pairs for Equational Rewriting -- Termination Proofs by Context-Dependent Interpretations -- Uniform Normalisation beyond Orthogonality -- Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order -- Relating Accumulative and Non-accumulative Functional Programs -- Context Unification and Traversal Equations -- Weakly Regular Relations and Applications -- On the Parallel Complexity of Tree Automata -- Transfinite Rewriting Semantics for Term Rewriting Systems -- Goal-Directed E-Unification -- The Unification Problem for Confluent Right-Ground Term Rewriting Systems -- On Termination of Higher-Order Rewriting -- Matching with Free Function Symbols — A Simple Extension of Matching? -- Deriving Focused Calculi for Transitive Relations -- A Formalised First-Order Con uence Proof for the ?-Calculus Using One-Sorted Variable Names (Barendregt Was Right after all ... almost) -- A Normal Form for Church-Rosser Language Systems -- Confluence and Termination of Simply Typed Term Rewriting Systems -- Parallel Evaluation of Interaction Nets with MPINE -- Stratego: A Language for Program Transformation Based on Rewriting Strategies System Description of Stratego 0.5.This book constitutes the refereed proceedings of the 12th International Conference on Rewriting Techniques and Applications, RTA 2001, held in Utrecht, The Netherlands, in May 2001. The 23 revised full papers presented together with two system descriptions were carefully reviewed and selected from 55 submissions. All current aspects of rewriting are addressed.Lecture Notes in Computer Science,0302-9743 ;2051Programming languages (Electronic computers)Mathematical logicComputer logicArtificial intelligenceComputer science—MathematicsProgramming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XArtificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Symbolic and Algebraic Manipulationhttps://scigraph.springernature.com/ontologies/product-market-codes/I17052Programming languages (Electronic computers).Mathematical logic.Computer logic.Artificial intelligence.Computer science—Mathematics.Programming Languages, Compilers, Interpreters.Mathematical Logic and Formal Languages.Logics and Meanings of Programs.Artificial Intelligence.Symbolic and Algebraic Manipulation.005.131Middeldorp Aartedthttp://id.loc.gov/vocabulary/relators/edtInternational Conference on Rewriting Techniques and ApplicationsMiAaPQMiAaPQMiAaPQBOOK996466166903316Rewriting Techniques and Applications774195UNISA