![Rewriting Techniques and Applications [electronic resource] : 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000. Proceedings /](/search/themes/bootstrap3/images/libros.png)
Rewriting Techniques and Applications [electronic resource] : 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000. Proceedings /
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.
| Main Authors: | , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
2000
|
| Subjects: | Computer science., Software engineering., Programming languages (Electronic computers)., Computer logic., Mathematical logic., Computer science, Artificial intelligence., Computer Science., Software Engineering/Programming and Operating Systems., Mathematical Logic and Formal Languages., Logics and Meanings of Programs., Programming Languages, Compilers, Interpreters., Artificial Intelligence (incl. Robotics)., Symbolic and Algebraic Manipulation., |
| Online Access: | http://dx.doi.org/10.1007/10721975 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|