Rewriting Techniques and Applications 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings /
Rewriting Techniques and Applications 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings / [electronic resource] :
edited by Leo Bachmair.
- 1st ed. 2000.
- X, 282 p. online resource.
- Lecture Notes in Computer Science, 1833 1611-3349 ; .
- Lecture Notes in Computer Science, 1833 .
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.
9783540449805
10.1007/10721975 doi
Software engineering.
Machine theory.
Computer science.
Compilers (Computer programs).
Artificial intelligence.
Computer science--Mathematics.
Software Engineering.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Compilers and Interpreters.
Artificial Intelligence.
Symbolic and Algebraic Manipulation.
QA76.758
005.1
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.
9783540449805
10.1007/10721975 doi
Software engineering.
Machine theory.
Computer science.
Compilers (Computer programs).
Artificial intelligence.
Computer science--Mathematics.
Software Engineering.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Compilers and Interpreters.
Artificial Intelligence.
Symbolic and Algebraic Manipulation.
QA76.758
005.1