Rewriting Techniques and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

21

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540221531, 9783540259794

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25979-4_3 ◽

2004 ◽

pp. 40-54 ◽

Author(s):

Yoshihito Toyama

Keyword(s):

Higher Order ◽

Rewriting Systems ◽

Higher Order Terms ◽

Download Full-text

An Approximation Based Approach to Infinitary Lambda Calculi

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25979-4_16 ◽

2004 ◽

pp. 221-232 ◽

Author(s):

Stefan Blom

Download Full-text

A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25979-4_2 ◽

2004 ◽

pp. 24-39 ◽

Author(s):

Frédéric Blanqui

Keyword(s):

Higher Order ◽

Rewrite Systems ◽

Termination Criterion

Download Full-text

Automated Termination Proofs with AProVE

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25979-4_15 ◽

2004 ◽

pp. 210-220 ◽

Author(s):

Jürgen Giesl ◽

René Thiemann ◽

Peter Schneider-Kamp ◽

Stephan Falke

Keyword(s):

Termination Proofs

Download Full-text

On the Modularity of Confluence in Infinitary Term Rewriting

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25979-4_13 ◽

2004 ◽

pp. 185-199

Author(s):

Jakob Grue Simonsen

Keyword(s):

Download Full-text

Inductive Theorems for Higher-Order Rewriting

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25979-4_19 ◽

2004 ◽

pp. 269-284

Author(s):

Takahito Aoto ◽

Toshiyuki Yamada ◽

Yoshihito Toyama

Keyword(s):

Download Full-text

A Verification Technique Using Term Rewriting Systems and Abstract Interpretation

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25979-4_9 ◽

2004 ◽

pp. 119-133 ◽

Author(s):

Toshinori Takai

Keyword(s):

Abstract Interpretation ◽

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Matchbox: A Tool for Match-Bounded String Rewriting

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25979-4_6 ◽

2004 ◽

pp. 85-94 ◽

Author(s):

Johannes Waldmann

Keyword(s):

String Rewriting

Download Full-text

A Certified AC Matching Algorithm

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25979-4_5 ◽

2004 ◽

pp. 70-84 ◽

Author(s):

Evelyne Contejean

Keyword(s):

Matching Algorithm

Download Full-text

Böhm-Like Trees for Term Rewriting Systems

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25979-4_17 ◽

2004 ◽

pp. 233-248 ◽

Author(s):

Jeroen Ketema

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text