Rewriting techniques and applications : 14th international conference, RTA 2003, Valencia, Spain, June 2003 : proceedings / / edited by Robert Nieuwenhuis

• Pubblicazione: Berlin, Germany ; ; New York, New York : , : Springer, , [2003]
• Edizione: 1st ed. 2003.
• Descrizione fisica: 1 online resource (526 p.)
• Disciplina: 005.131
• Soggetto topico: Rewriting systems (Computer science); Computer programming; Algorithms
• Persona (resp. second.): NieuwenhuisRobert
• Note generali: Description based upon print version of record.
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 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.
• Altri titoli varianti: RTA 2003
• Titolo autorizzato: Rewriting Techniques and Applications
• ISBN: 1-280-80485-8; 9786610804856; 3-540-44881-0
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996466026003316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 2706