| 000 | 03645nam a22004335i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-44881-5 | ||
| 003 | DE-He213 | ||
| 005 | 20160624101954.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2003 gw | s |||| 0|eng d | ||
| 020 |
_a9783540448815 _9978-3-540-44881-5 |
||
| 024 | 7 |
_a10.1007/3-540-44881-0 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUY _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 082 | 0 | 4 |
_a004 _223 |
| 245 | 1 | 0 |
_aRewriting Techniques and Applications _h[electronic resource] : _b14th International Conference, RTA 2003 Valencia, Spain, June 9–11, 2003 Proceedings / _cedited by Robert Nieuwenhuis. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003. |
|
| 300 |
_aXI, 518 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2706 |
|
| 505 | 0 | _aInvited Talk -- Symbolic Systems Biology -- Confluence as a Cut Elimination Property -- Associative-Commutative Rewriting on Large Terms -- A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms -- Efficient Reductions with Director Strings -- Rewriting Logic and Probabilities -- The Maude 2.0 System -- Diagrams for Meaning Preservation -- Expression Reduction Systems with Patterns -- Residuals in Higher-Order Rewriting -- Rewriting UNITY -- New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols -- An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation -- Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties -- Rule-Based Analysis of Dimensional Safety -- Invited Talk -- Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems -- On the Complexity of Higher-Order Matching in the Linear ?-Calculus -- XML Schema, Tree Logic and Sheaves Automata -- Size-Change Termination for Term Rewriting -- Monotonic AC-Compatible Semantic Path Orderings -- Relating Derivation Lengths with the Slow-Growing Hierarchy Directly -- Tsukuba Termination Tool -- Liveness in Rewriting -- Validation of the JavaCard Platform with Implicit Induction Techniques -- “Term Partition” for Mathematical Induction -- Equational Prover of Theorema -- Termination of Simply Typed Term Rewriting by Translation and Labelling -- Rewriting Modulo in Deduction Modulo -- Termination of String Rewriting Rules That Have One Pair of Overlaps -- Environments for Term Rewriting Engines for Free! -- Joint RTA-TLCA Invited Talk -- A Logical Algorithm for ML Type Inference -- A Rewriting Alternative to Reidemeister-Schreier -- Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) -- Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism -- Testing Extended Regular Language Membership Incrementally by Rewriting. | |
| 650 | 0 | _aComputer science. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aComputer Science, general. |
| 700 | 1 |
_aNieuwenhuis, Robert. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540402541 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2706 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-44881-0 |
| 942 |
_2EBK5062 _cEBK |
||
| 999 |
_c34356 _d34356 |
||