1 option
Rewriting Techniques and Applications : 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009 Proceedings / edited by Ralf Treinen.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 5595.
- Theoretical Computer Science and General Issues ; 5595
- Language:
- English
- Subjects (All):
- Logic, Symbolic and mathematical.
- Computer logic.
- Programming languages (Electronic computers).
- Computer science--Mathematics.
- Computer science.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Programming Languages, Compilers, Interpreters.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Mathematical Logic and Foundations.
- Local Subjects:
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Programming Languages, Compilers, Interpreters.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Mathematical Logic and Foundations.
- Physical Description:
- 1 online resource (XII, 391 pages).
- Edition:
- First edition 2009.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
- System Details:
- text file PDF
- Contents:
- Automatic Termination
- Loops under Strategies
- Proving Termination of Integer Term Rewriting
- Dependency Pairs and Polynomial Path Orders
- Unique Normalization for Shallow TRS
- The Existential Fragment of the One-Step Parallel Rewriting Theory
- Proving Confluence of Term Rewriting Systems Automatically
- A Proof Theoretic Analysis of Intruder Theories
- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
- YAPA: A Generic Tool for Computing Intruder Knowledge
- Well-Definedness of Streams by Termination
- Modularity of Convergence in Infinitary Rewriting
- A Heterogeneous Pushout Approach to Term-Graph Transformation
- An Explicit Framework for Interaction Nets
- Dual Calculus with Inductive and Coinductive Types
- Comparing Böhm-Like Trees
- The Derivational Complexity Induced by the Dependency Pair Method
- Local Termination
- VMTL-A Modular Termination Laboratory
- Tyrolean Termination Tool 2
- From Outermost to Context-Sensitive Rewriting
- A Fully Abstract Semantics for Constructor Systems
- The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
- Unification in the Description Logic
- Unification with Singleton Tree Grammars
- Unification and Narrowing in Maude 2.4.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-02348-4
- 9783642023484
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.