LEADER 08305nam a2201021Ia 4500
001 e1b65391-c723-4f85-ba68-540336daadc1
005 20240926000000.0
008 081117s2008 gw a ob 101 0 eng d
010 |z  2008930434 
019 |a 246899449  |a 488390932  |a 495284708  |a 646044416  |a 785781875  |a 964916061  |a 1005820420  |a 1035714599  |a 1044223465  |a 1056376072  |a 1075109836  |a 1081196095  |a 1105601567  |a 1112536537  |a 1112971539  |a 1162780374  |a 1170967812  |a 1170999518  |a 1171291030  |a 1172426474  |a 1204005703  |a 1391808246 
019 |a 246899449  |a 488390932  |a 495284708  |a 646044416  |a 785781875  |a 964916061 
020 |a 3540705880 
020 |a 3540705902 
020 |a 9783540705888 
020 |a 9783540705901 
024 7 |a 10.1007/978-3-540-70590-1  |2 doi 
035 |a (OCoLC)272314755  |z (OCoLC)246899449  |z (OCoLC)488390932  |z (OCoLC)495284708  |z (OCoLC)646044416  |z (OCoLC)785781875  |z (OCoLC)964916061  |z (OCoLC)1005820420  |z (OCoLC)1035714599  |z (OCoLC)1044223465  |z (OCoLC)1056376072  |z (OCoLC)1075109836  |z (OCoLC)1081196095  |z (OCoLC)1105601567  |z (OCoLC)1112536537  |z (OCoLC)1112971539  |z (OCoLC)1162780374  |z (OCoLC)1170967812  |z (OCoLC)1170999518  |z (OCoLC)1171291030  |z (OCoLC)1172426474  |z (OCoLC)1204005703  |z (OCoLC)1391808246 
035 |a (OCoLC)272314755  |z (OCoLC)246899449  |z (OCoLC)488390932  |z (OCoLC)495284708  |z (OCoLC)646044416  |z (OCoLC)785781875  |z (OCoLC)964916061 
035 |a spocn272314755 
037 |a 978-3-540-70588-8  |b Springer  |n http://www.springerlink.com 
040 |a GW5XE  |b eng  |e pn  |c GW5XE  |d MNU  |d WAU  |d GZM  |d NUI  |d OCLCQ  |d COO  |d OCLCQ  |d UAB  |d E7B  |d OCLCO  |d OCLCQ  |d OCLCA  |d OCLCF  |d BEDGE  |d OCLCO  |d YDXCP  |d IDEBK  |d OCLCQ  |d OCLCO  |d OCL  |d OCLCO  |d EBLCP  |d OCLCQ  |d OCLCO  |d VT2  |d OCLCQ  |d ESU  |d OCLCQ  |d STF  |d OCLCQ  |d CEF  |d OCLCQ  |d U3W  |d OCLCQ  |d LHU  |d WYU  |d ICG  |d YOU  |d LEAUB  |d AU@  |d OCLCQ  |d AUD  |d ERF  |d OCLCQ  |d OCLCO  |d COM  |d OCLCO  |d OCLCQ  |d UKBTH  |d LUN  |d LIP  |d DCT  |d DKU  |d OCLCO  |d OCLCL  |d CSt 
040 |a GW5XE  |b eng  |e pn  |c GW5XE  |d MNU  |d WAU  |d GZM  |d NUI  |d OCLCQ  |d COO  |d OCLCQ  |d UAB  |d E7B  |d OCLCO  |d OCLCQ  |d OCLCA  |d OCLCF  |d BEDGE  |d OCLCO  |d YDXCP  |d IDEBK  |d OCLCQ  |d OCLCO  |d OCL  |d OCLCO  |d EBLCP  |d OCLCQ  |d OCLCO  |d VT2 
049 |a MAIN 
050 4 |a QA267  |b .I555 2008eb 
072 7 |a COM010000  |2 bisacsh 
072 7 |a COM051010  |2 bisacsh 
072 7 |a UMC  |2 bicssc 
072 7 |a UMX  |2 bicssc 
082 0 4 |a 511.3  |2 22 
111 2 |a International Conference on Rewriting Techniques and Applications  |n (19th :  |d 2008 :  |c Hagenberg im Mü̈hlkreis, Austria) 
245 1 0 |a Rewriting techniques and applications :  |b 19th international conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008 : proceedings /  |c Andrei Voronkov (ed.) 
246 3 0 |a 19th international conference, RTA 2008 
246 3 0 |a RTA 2008 
260 |a Berlin ;  |a New York :  |b Springer,  |c ©2008 
300 |a 1 online resource (xiii, 455 pages) :  |b illustrations 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file 
347 |b PDF 
490 1 |a LNCS sublibrary. SL 1, Theoretical computer science and general issues 
490 1 |a Lecture notes in computer science,  |x 0302-9732 ;  |v 5117 
504 |a Includes bibliographical references and author index 
505 0 |a Modular 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 
506 |a University staff and students only. Requires University Computer Account login off-campus 
520 8 |a Annotation  |b This 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 
546 |a English 
588 0 |a Print version record 
650 0 |a Algorithms  |v Congresses 
650 0 |a Artificial intelligence 
650 0 |a Computer programming  |v Congresses 
650 0 |a Rewriting systems (Computer science)  |v Congresses 
650 2 |a Artificial Intelligence 
650 2 |a Electronic Data Processing 
650 6 |a Algorithmes  |v Congrès 
650 6 |a Informatique 
650 6 |a Intelligence artificielle 
650 6 |a Programmation (Informatique)  |v Congrès 
650 6 |a Systèmes de réécriture (Informatique)  |v Congrès 
650 7 |a Algorithms  |2 fast 
650 7 |a Computer programming  |2 fast 
650 7 |a Informatique  |2 eclas 
650 7 |a Rewriting systems (Computer science)  |2 fast 
650 7 |a artificial intelligence  |2 aat 
650 7 |a computer science  |2 aat 
650 7 |a data processing  |2 aat 
650 1 4 |a Computer Science 
650 2 4 |a Artificial Intelligence (incl. Robotics) 
650 2 4 |a Logics and Meanings of Programs 
650 2 4 |a Mathematical Logic and Formal Languages 
650 2 4 |a Programming Languages, Compilers, Interpreters 
650 2 4 |a Symbolic and Algebraic Manipulation 
655 2 |a Congress 
655 4 |a Electronic books 
655 7 |a Actes de congrès  |2 rvmgf 
655 7 |a Conference papers and proceedings  |2 fast 
655 7 |a Conference papers and proceedings  |2 lcgft 
655 7 |a proceedings (reports)  |2 aat 
700 1 |a Voronkov, Andrei,  |d 1959-  |1 http://viaf.org/viaf/8047455 
700 1 |a Voronkov, Andrei,  |d 1959-  |1 https://id.oclc.org/worldcat/entity/E39PBJcgthTcG6JvmR8d8V6xjC 
773 0 |t Springer eBooks 
776 0 8 |i Print version:  |a International Conference on Rewriting Techniques and Applications (19th : 2008 : Hagenberg im Mü̈hlkreis, Austria)  |t Rewriting techniques and applications.  |d Berlin ; New York : Springer, ©2008  |z 9783540705888  |z 3540705880  |w (OCoLC)233933401 
830 0 |a LNCS sublibrary  |n SL 1,  |p Theoretical computer science and general issues. 
830 0 |a Lecture notes in computer science ;  |v 5117  |x 0302-9732 
999 1 0 |i e1b65391-c723-4f85-ba68-540336daadc1  |l in00000082171  |s US-CST  |m rewriting_techniques_and_applications19th_international_conference_rta_____2008_______sprina________________________________________international_confer_______________e 
999 1 0 |i e1b65391-c723-4f85-ba68-540336daadc1  |l 11069744  |s US-ICU  |m rewriting_techniques_and_applications19th_international_conference_rta_____2008_______sprina________________________________________international_confer_______________e 
999 1 1 |l in00000082171  |s ISIL:US-CST  |t BKS  |b e532f7fe-1ecc-485f-85eb-2b0fed2718aa  |y e532f7fe-1ecc-485f-85eb-2b0fed2718aa  |p UNLOANABLE 
999 1 1 |l in00000082171  |s ISIL:US-CST  |t BKS  |a SUL-ELECTRONIC  |p UNLOANABLE