FEEDBACK Smiley face
Normal view MARC view ISBD view

Rewriting Techniques and Applications [electronic resource] :11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000. Proceedings /

Contributor(s): Bachmair, Leo [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 1833Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2000.Description: X, 282 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540449805.Subject(s): Computer science | Software engineering | Programming languages (Electronic computers) | Computer logic | Mathematical logic | Computer science -- Mathematics | 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 ManipulationOnline resources: Click here to access online
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in