LEADER 05070nam  22007575  450 
001 996466166903316
005 20200704050756.0
010   $a3-540-45127-7
024 7 $a10.1007/3-540-45127-7
035   $a(CKB)1000000000211405
035   $a(SSID)ssj0000326345
035   $a(PQKBManifestationID)11255385
035   $a(PQKBTitleCode)TC0000326345
035   $a(PQKBWorkID)10284082
035   $a(PQKB)10713125
035   $a(DE-He213)978-3-540-45127-3
035   $a(MiAaPQ)EBC3072507
035   $a(PPN)15521120X
035   $a(EXLCZ)991000000000211405
100   $a20121227d2001      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aRewriting Techniques and Applications$b[electronic resource] $e12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001. Proceedings /$fedited by Aart Middeldorp
205   $a1st ed. 2001.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001.
215   $a1 online resource (XII, 368 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2051
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-42117-3 
320   $aIncludes bibliographical references at the end of each chapters and index.
327   $aInvited 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.
330   $aThis 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v2051
606   $aProgramming languages (Electronic computers)
606   $aMathematical logic
606   $aComputer logic
606   $aArtificial intelligence
606   $aComputer science?Mathematics
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
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   $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$aProgramming languages (Electronic computers).
615  0$aMathematical logic.
615  0$aComputer logic.
615  0$aArtificial intelligence.
615  0$aComputer science?Mathematics.
615 14$aProgramming Languages, Compilers, Interpreters.
615 24$aMathematical Logic and Formal Languages.
615 24$aLogics and Meanings of Programs.
615 24$aArtificial Intelligence.
615 24$aSymbolic and Algebraic Manipulation.
676   $a005.131
702   $aMiddeldorp$b Aart$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   $a996466166903316
996   $aRewriting Techniques and Applications$9774195
997   $aUNISA