1 option
Rewriting Techniques and Applications : 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings / edited by Leo Bachmair.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1833.
- Lecture Notes in Computer Science, 0302-9743 ; 1833
- Language:
- English
- Subjects (All):
- Software engineering.
- Logic, Symbolic and mathematical.
- Computer logic.
- Programming languages (Electronic computers).
- Artificial intelligence.
- Computer science--Mathematics.
- Computer science.
- Software Engineering/Programming and Operating Systems.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Programming Languages, Compilers, Interpreters.
- Artificial Intelligence.
- Symbolic and Algebraic Manipulation.
- Local Subjects:
- Software Engineering/Programming and Operating Systems.
- 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 (X, 282 pages).
- Edition:
- First edition 2000.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
- System Details:
- text file PDF
- Contents:
- Invited Talk
- Rewriting Logic and Maude: Concepts and Applications
- Invited Tutorial
- Tree Automata and Term Rewrite Systems
- Regular Papers
- Absolute Explicit Unification
- Termination and Confluence of Higher-Order Rewrite Systems
- A de Bruijn Notation for Higher-Order Rewriting
- Rewriting Techniques in Theoretical Physics
- Normal Forms and Reduction for Theories of Binary Relations
- Parallelism Constraints
- Linear Higher-Order Matching Is NP-Complete
- Standardization and Confluence for a Lambda Calculus with Generalized Applications
- Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
- Word Problems and Confluence Problems for Restricted Semi-Thue Systems
- The Explicit Representability of Implicit Generalizations
- On the Word Problem for Combinators
- An Algebra of Resolution
- Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems
- Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
- System Descriptions
- System Description: The Dependency Pair Method
- REM (Reduce Elan Machine): Core of the New ELAN Compiler
- TALP: A Tool for the Termination Analysis of Logic Programs.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-44980-5
- 9783540449805
- 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.