000 04506nam a22005895i 4500
001 978-3-540-70590-1
003 DE-He213
005 20240423125748.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540705901
_9978-3-540-70590-1
024 7 _a10.1007/978-3-540-70590-1
_2doi
050 4 _aQA76.76.C65
072 7 _aUMC
_2bicssc
072 7 _aCOM010000
_2bisacsh
072 7 _aUMC
_2thema
082 0 4 _a005.45
_223
245 1 0 _aRewriting Techniques and Applications
_h[electronic resource] :
_b19th International Conference, RTA 2008 Hagenberg, Austria, July 15-17, 2008, Proceedings /
_cedited by Andrei Voronkov.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXIII, 457 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5117
505 0 _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.
520 _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.
650 0 _aCompilers (Computer programs).
650 0 _aMachine theory.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 0 _aComputer science
_xMathematics.
650 1 4 _aCompilers and Interpreters.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aArtificial Intelligence.
650 2 4 _aSymbolic and Algebraic Manipulation.
700 1 _aVoronkov, Andrei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540705888
776 0 8 _iPrinted edition:
_z9783540866671
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5117
856 4 0 _uhttps://doi.org/10.1007/978-3-540-70590-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c181434
_d181434