LEADER 04892nam  22007095  450 
001 996466240303316
005 20230406010333.0
010   $a3-540-70590-2
024 7 $a10.1007/978-3-540-70590-1
035   $a(CKB)1000000000490929
035   $a(SSID)ssj0000355604
035   $a(PQKBManifestationID)11277619
035   $a(PQKBTitleCode)TC0000355604
035   $a(PQKBWorkID)10320803
035   $a(PQKB)11202581
035   $a(DE-He213)978-3-540-70590-1
035   $a(MiAaPQ)EBC3068689
035   $a(PPN)127055002
035   $a(EXLCZ)991000000000490929
100   $a20100301d2008      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aRewriting Techniques and Applications$b[electronic resource] $e19th International Conference, RTA 2008 Hagenberg, Austria, July 15-17, 2008, Proceedings /$fedited by Andrei Voronkov
205   $a1st ed. 2008.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008.
215   $a1 online resource (XIII, 457 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5117
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-70588-0 
320   $aIncludes bibliographical references and index.
327   $aModular Termination of Basic Narrowing -- Linear-algebraic ?-calculus: higher-order, encodings, and confluence. -- Term-Graph Rewriting Via Explicit Paths -- Finer Is Better: Abstraction Refinement for Rewriting Approximations -- A Needed Rewriting Strategy for Data-Structures with Pointers -- Effectively Checking the Finite Variant Property -- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures -- Maximal Termination -- Usable Rules for Context-Sensitive Rewrite Systems -- Combining Equational Tree Automata over AC and ACI Theories -- Closure of Hedge-Automata Languages by Hedge Rewriting -- On Normalisation of Infinitary Combinatory Reduction Systems -- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems -- Arctic Termination ...Below Zero -- Logics and Automata for Totally Ordered Trees -- Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks -- Nominal Unification from a Higher-Order Perspective -- Functional-Logic Graph Parser Combinators -- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations -- Tree Automata for Non-linear Arithmetic -- Confluence by Decreasing Diagrams -- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case -- Root-Labeling -- Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities -- Deciding Innermost Loops -- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations -- Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting -- Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof -- Reduction Under Substitution -- Normalization of Infinite Terms.
330   $aThis book constitutes the refereed proceedings of the 19th International Conference on Rewriting Techniques and Applications, RTA 2008, held in Hagenberg, Austria, July 15-17, in June 2008 as part of the RISC Summer 2008. The 30 revised full papers presented were carefully reviewed and selected from 57 initial submissions. The papers cover current research on all aspects of rewriting including typical areas of interest such as applications, foundational issues, frameworks, implementations, and semantics.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5117
606   $aCompilers (Computer programs)
606   $aMachine theory
606   $aComputer science
606   $aArtificial intelligence
606   $aComputer science?Mathematics
606   $aCompilers and Interpreters
606   $aFormal Languages and Automata Theory
606   $aComputer Science Logic and Foundations of Programming
606   $aArtificial Intelligence
606   $aSymbolic and Algebraic Manipulation
615  0$aCompilers (Computer programs).
615  0$aMachine theory.
615  0$aComputer science.
615  0$aArtificial intelligence.
615  0$aComputer science?Mathematics.
615 14$aCompilers and Interpreters.
615 24$aFormal Languages and Automata Theory.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aArtificial Intelligence.
615 24$aSymbolic and Algebraic Manipulation.
676   $a005.13
702   $aVoronkov$b Andrei$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996466240303316
996   $aRewriting Techniques and Applications$9774195
997   $aUNISA