1 option
Rewriting Techniques and Applications : 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings / edited by Vincent van Oostrom.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 3091.
- Lecture Notes in Computer Science, 0302-9743 ; 3091
- Language:
- English
- Subjects (All):
- Logic, Symbolic and mathematical.
- Programming languages (Electronic computers).
- Computer programming.
- Computer logic.
- Artificial intelligence.
- Computer science--Mathematics.
- Computer science.
- Mathematical Logic and Formal Languages.
- Programming Languages, Compilers, Interpreters.
- Programming Techniques.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Symbolic and Algebraic Manipulation.
- Local Subjects:
- Mathematical Logic and Formal Languages.
- Programming Languages, Compilers, Interpreters.
- Programming Techniques.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Symbolic and Algebraic Manipulation.
- Physical Description:
- 1 online resource (X, 315 pages).
- Edition:
- First edition 2004.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
- System Details:
- text file PDF
- Contents:
- Termination Analysis of the Untyped ?-Calculus
- A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
- Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms
- Monadic Second-Order Unification Is NP-Complete
- A Certified AC Matching Algorithm
- Matchbox: A Tool for Match-Bounded String Rewriting
- TORPA: Termination of Rewriting Proved Automatically
- Querying Unranked Trees with Stepwise Tree Automata
- A Verification Technique Using Term Rewriting Systems and Abstract Interpretation
- Rewriting for Fitch Style Natural Deductions
- Efficient ?-Evaluation with Interaction Nets
- Proving Properties of Term Rewrite Systems via Logic Programs
- On the Modularity of Confluence in Infinitary Term Rewriting
- mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
- Automated Termination Proofs with AProVE
- An Approximation Based Approach to Infinitary Lambda Calculi
- Böhm-Like Trees for Term Rewriting Systems
- Dependency Pairs Revisited
- Inductive Theorems for Higher-Order Rewriting
- The Joinability and Unification Problems for Confluent Semi-constructor TRSs
- A Visual Environment for Developing Context-Sensitive Term Rewriting Systems.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-25979-4
- 9783540259794
- 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.