1 option
Rewriting Techniques and Applications : 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002 Proceedings / edited by Sophie Tison.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2378.
- Lecture Notes in Computer Science, 0302-9743 ; 2378
- Language:
- English
- Subjects (All):
- Computer programming.
- Logic, Symbolic and mathematical.
- Computer logic.
- Programming languages (Electronic computers).
- Artificial intelligence.
- Computer science--Mathematics.
- Computer science.
- Programming Techniques.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Programming Languages, Compilers, Interpreters.
- Artificial Intelligence.
- Symbolic and Algebraic Manipulation.
- Local Subjects:
- Programming Techniques.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Programming Languages, Compilers, Interpreters.
- Artificial Intelligence.
- Symbolic and Algebraic Manipulation.
- Physical Description:
- 1 online resource (XII, 392 pages).
- Edition:
- First edition 2002.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
- System Details:
- text file PDF
- Contents:
- Invited Talks
- Combining Shostak Theories
- Multiset Rewriting and Security Protocol Analysis
- Engineering of Logics for the Content-Based Representation of Information
- Regular Papers, Application Papers
- Axiomatic Rewriting Theory VI: Residual Theory Revisited
- Static Analysis of Modularity of ?-Reduction in the Hyperbalanced ?-Calculus
- Exceptions in the Rewriting Calculus
- Deriving Focused Lattice Calculi
- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
- Decidability and Closure Properties of Equational Tree Languages
- Regular Sets of Descendants by Some Rewrite Strategies
- Rewrite Games
- An Extensional Böhm Model
- A Weak Calculus with Explicit Operators for Pattern Matching and Substitution
- Tradeoffs in the Intensional Representation of Lambda Terms
- Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae
- Conditions for Efficiency Improvement by Tree Transducer Composition
- Rewriting Strategies for Instruction Selection
- Probabilistic Rewrite Strategies. Applications to ELAN
- Loops of Superexponential Lengths in One-Rule String Rewriting
- Recursive Derivational Length Bounds for Confluent Term Rewrite Systems Research Paper
- Termination of (Canonical) Context-Sensitive Rewriting
- Atomic Set Constraints with Projection
- Currying Second-Order Unification Problems
- A Decidable Variant of Higher Order Matching
- Combining Decision Procedures for Positive Theories Sharing Constructors
- System Descriptions
- JITty: A Rewriter with Strategy Annotations
- Autowrite: A Tool for Checking Properties of Term Rewriting Systems
- TTSLI: An Implementation of Tree-Tuple Synchronized Languages
- in2: A Graphical Interpreter for Interaction Nets.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45610-0
- 9783540456100
- 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.