|
|
|
|
LEADER |
04077nam a2200505 4500 |
001 |
978-3-540-44881-5 |
003 |
DE-He213 |
005 |
20191023182054.0 |
007 |
cr nn 008mamaa |
008 |
121227s2003 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540448815
|9 978-3-540-44881-5
|
024 |
7 |
|
|a 10.1007/3-540-44881-0
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.7-76.73
|
050 |
|
4 |
|a QA76.76.C65
|
072 |
|
7 |
|a UMX
|2 bicssc
|
072 |
|
7 |
|a COM051010
|2 bisacsh
|
072 |
|
7 |
|a UMX
|2 thema
|
072 |
|
7 |
|a UMC
|2 thema
|
082 |
0 |
4 |
|a 005.13
|2 23
|
245 |
1 |
0 |
|a Rewriting Techniques and Applications
|h [electronic resource] :
|b 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings /
|c edited by Robert Nieuwenhuis.
|
250 |
|
|
|a 1st ed. 2003.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2003.
|
300 |
|
|
|a XI, 518 p.
|b online resource.
|
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
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2706
|
505 |
0 |
|
|a Invited 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 |
|a Programming languages (Electronic computers).
|
650 |
|
0 |
|a Computer science.
|
650 |
1 |
4 |
|a Programming Languages, Compilers, Interpreters.
|0 http://scigraph.springernature.com/things/product-market-codes/I14037
|
650 |
2 |
4 |
|a Computer Science, general.
|0 http://scigraph.springernature.com/things/product-market-codes/I00001
|
700 |
1 |
|
|a Nieuwenhuis, Robert.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662214602
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540402541
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2706
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-44881-0
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|