|
|
|
|
| LEADER |
03175nmm a2200313 u 4500 |
| 001 |
EB001884244 |
| 003 |
EBX01000000000000001047611 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
191115 ||| eng |
| 020 |
|
|
|a 9783540448815
|
| 100 |
1 |
|
|a Nieuwenhuis, Robert
|e [editor]
|
| 245 |
0 |
0 |
|a Rewriting Techniques and Applications
|h Elektronische Ressource
|b 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings
|c edited by Robert Nieuwenhuis
|
| 250 |
|
|
|a 1st ed. 2003
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2003, 2003
|
| 300 |
|
|
|a XI, 518 p
|b online resource
|
| 505 |
0 |
|
|a 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 Semanticsof Conflict-Free Rewrite Systems (Partial Orders with Duplication) --
|
| 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 --
|
| 505 |
0 |
|
|a Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism -- Testing Extended Regular Language Membership Incrementally by Rewriting
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer Science
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/3-540-44881-0
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-44881-0?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.45
|