1 option
Term Rewriting and Applications : 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings / edited by Franz Baader.
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, 4533.
- Theoretical Computer Science and General Issues ; 4533
- Language:
- English
- Subjects (All):
- Programming languages (Electronic computers).
- Logic, Symbolic and mathematical.
- Computer logic.
- Artificial intelligence.
- Computer science--Mathematics.
- Computer science.
- Programming Languages, Compilers, Interpreters.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Symbolic and Algebraic Manipulation.
- Local Subjects:
- Programming Languages, Compilers, Interpreters.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Symbolic and Algebraic Manipulation.
- Physical Description:
- 1 online resource (XII, 422 pages).
- Edition:
- First edition 2007.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
- System Details:
- text file PDF
- Contents:
- Formal Verification of an Optimizing Compiler
- Challenges in Satisfiability Modulo Theories
- On a Logical Foundation for Explicit Substitutions
- Intruders with Caps
- Tom: Piggybacking Rewriting on Java
- Rewriting Approximations for Fast Prototyping of Static Analyzers
- Determining Unify-Stable Presentations
- Confluence of Pattern-Based Calculi
- A Simple Proof That Super-Consistency Implies Cut Elimination
- Bottom-Up Rewriting Is Inverse Recognizability Preserving
- Adjunction for Garbage Collection with Application to Graph Rewriting
- Non Strict Confluent Rewrite Systems for Data-Structures with Pointers
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- Delayed Substitutions
- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems
- Termination of Rewriting with Right-Flat Rules
- Abstract Critical Pairs and Confluence of Arbitrary Binary Relations
- On the Completeness of Context-Sensitive Order-Sorted Specifications
- KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis
- Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
- Proving Termination of Rewrite Systems Using Bounds
- Sequence Unification Through Currying
- The Termination Competition
- Random Descent
- Correctness of Copy in Calculi with Letrec
- A Characterization of Medial as Rewriting Rule
- The Maximum Length of Mu-Reduction in Lambda Mu-Calculus
- On Linear Combinations of ?-Terms
- Satisfying KBO Constraints
- Termination by Quasi-periodic Interpretations.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-73449-9
- 9783540734499
- 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.