Rewriting Techniques and Applications 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004. Proceedings / [electronic resource] :
edited by Vincent Oostrom.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
- X, 315 p. online resource.
- Lecture Notes in Computer Science, 3091 0302-9743 ; .
- Lecture Notes in Computer Science, 3091 .
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.
9783540259794
10.1007/b98160 doi
Computer science.
Logic design.
Algebra--Data processing.
Artificial intelligence.
Computer Science.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Programming Languages, Compilers, Interpreters.
Artificial Intelligence (incl. Robotics).
Symbolic and Algebraic Manipulation.
QA8.9-QA10.3
005.131
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.
9783540259794
10.1007/b98160 doi
Computer science.
Logic design.
Algebra--Data processing.
Artificial intelligence.
Computer Science.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Programming Languages, Compilers, Interpreters.
Artificial Intelligence (incl. Robotics).
Symbolic and Algebraic Manipulation.
QA8.9-QA10.3
005.131