Rewriting Techniques and Applications : 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings - neues Buch

EAN (ISBN-13): 9783540259794
Erscheinungsjahr: 2004
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-05-10T03:50:12+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-09-22T15:40:00+02:00 (Zurich)
ISBN/EAN: 9783540259794

ISBN - alternative Schreibweisen:
978-3-540-25979-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: van oostrom
Titel des Buches: aachen 1914 1918, aachen 1945 1970

---

Daten vom Verlag:

Autor/in: Vincent van Oostrom
Titel: Lecture Notes in Computer Science; Rewriting Techniques and Applications - 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings
Verlag: Springer; Springer Berlin
315 Seiten
Erscheinungsjahr: 2004-08-24
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
X, 315 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithms; automata; automated deduction; calculus; cut elimination; formal methods; lambda calculus; logic; program calculi; proving; reduction; rewriting; rewriting systems; termination; verification; C; Formal Languages and Automata Theory; Compilers and Interpreters; Programming Techniques; Computer Science Logic and Foundations of Programming; Artificial Intelligence; Symbolic and Algebraic Manipulation; Computer Science; Compiler und Übersetzer; Computerprogrammierung und Softwareentwicklung; Künstliche Intelligenz; Mathematik für Informatiker; BC

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.
Includes supplementary material: sn.pub/extras