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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540421177, 9783540451273

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On Termination of Higher-Order Rewriting

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45127-7_20 ◽

2001 ◽

pp. 261-275 ◽

Cited By ~ 10

Author(s):

Femke van Raamsdonk

Keyword(s):

Higher Order

Download Full-text

Deriving Focused Calculi for Transitive Relations

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45127-7_22 ◽

2001 ◽

pp. 291-305 ◽

Cited By ~ 6

Author(s):

Georg Struth

Download Full-text

Matching with Free Function Symbols — A Simple Extension of Matching?

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45127-7_21 ◽

2001 ◽

pp. 276-290 ◽

Cited By ~ 2

Author(s):

Christophe Ringeissen

Keyword(s):

Simple Extension ◽

Free Function

Download Full-text

Context Unification and Traversal Equations

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45127-7_14 ◽

2001 ◽

pp. 169-184 ◽

Cited By ~ 4

Author(s):

Jordi Levy ◽

Mateu Villaret

Download Full-text

Combining Pattern E-Unification Algorithms

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45127-7_7 ◽

2001 ◽

pp. 63-76

Author(s):

Alexandre Boudet ◽

Evelyne Contejean

Keyword(s):

Unification Algorithms

Download Full-text

Parallel Evaluation of Interaction Nets with MPINE

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45127-7_26 ◽

2001 ◽

pp. 353-356 ◽

Cited By ~ 2

Author(s):

Jorge Sousa Pinto

Keyword(s):

Parallel Evaluation

Download Full-text

A Formalised First-Order Con uence Proof for the λ-Calculus Using One-Sorted Variable Names (Barendregt Was Right after all ... almost)

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45127-7_23 ◽

2001 ◽

pp. 306-321 ◽

Cited By ~ 5

Author(s):

René Vestergaard ◽

James Brotherston

Keyword(s):

First Order

Download Full-text

Uniform Normalisation beyond Orthogonality

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45127-7_11 ◽

2001 ◽

pp. 122-136 ◽

Cited By ~ 7

Author(s):

Zurab Khasidashvili ◽

Mizuhito Ogawa ◽

Vincent van Oostrom

Download Full-text

Termination Proofs by Context-Dependent Interpretations

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45127-7_10 ◽

2001 ◽

pp. 108-121 ◽

Cited By ~ 12

Author(s):

Dieter Hofbauer

Keyword(s):

Context Dependent ◽

Termination Proofs

Download Full-text

Beta Reduction Constraints

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45127-7_5 ◽

2001 ◽

pp. 31-46 ◽

Cited By ~ 3

Author(s):

Manuel Bodirsky ◽

Katrin Erk ◽

Alexander Koller ◽

Joachim Niehren

Download Full-text

Rewriting Techniques and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On Termination of Higher-Order Rewriting

Deriving Focused Calculi for Transitive Relations

Matching with Free Function Symbols — A Simple Extension of Matching?

Context Unification and Traversal Equations

Combining Pattern E-Unification Algorithms

Parallel Evaluation of Interaction Nets with MPINE

A Formalised First-Order Con uence Proof for the λ-Calculus Using One-Sorted Variable Names (Barendregt Was Right after all ... almost)

Uniform Normalisation beyond Orthogonality

Termination Proofs by Context-Dependent Interpretations

Beta Reduction Constraints

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