Rewriting Techniques and Applications (Record no. 181434)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04506nam a22005895i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-540-70590-1 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240423125748.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 100301s2008 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783540705901 |
| -- | 978-3-540-70590-1 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-540-70590-1 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA76.76.C65 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UMC |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM010000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UMC |
| Source | thema |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.45 |
| Edition number | 23 |
| 245 10 - TITLE STATEMENT | |
| Title | Rewriting Techniques and Applications |
| Medium | [electronic resource] : |
| Remainder of title | 19th International Conference, RTA 2008 Hagenberg, Austria, July 15-17, 2008, Proceedings / |
| Statement of responsibility, etc | edited by Andrei Voronkov. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2008. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| -- | 2008. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XIII, 457 p. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Theoretical Computer Science and General Issues, |
| International Standard Serial Number | 2512-2029 ; |
| Volume number/sequential designation | 5117 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 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. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Compilers (Computer programs). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Machine theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Artificial intelligence. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science |
| General subdivision | Mathematics. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Compilers and Interpreters. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Formal Languages and Automata Theory. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Science Logic and Foundations of Programming. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Artificial Intelligence. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Symbolic and Algebraic Manipulation. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Voronkov, Andrei. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer Nature eBook |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783540705888 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783540866671 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Theoretical Computer Science and General Issues, |
| -- | 2512-2029 ; |
| Volume number/sequential designation | 5117 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/978-3-540-70590-1">https://doi.org/10.1007/978-3-540-70590-1</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-SXCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks-CSE-Springer |
No items available.