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

9783540662013, 9783540486855

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Fast Rewriting of Symmetric Polynomials

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-48685-2_29 ◽

2010 ◽

pp. 371-381

Author(s):

Manfred Göbel

Keyword(s):

Symmetric Polynomials

Download Full-text

Context-Sensitive AC-rewriting

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-48685-2_24 ◽

1999 ◽

pp. 286-300 ◽

Cited By ~ 10

Author(s):

M. C. F. Ferreira ◽

A. L. Ribeiro

Keyword(s):

Context Sensitive

Download Full-text

A Characterisation of Multiply Recursive Functions with Higman’s Lemma

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-48685-2_13 ◽

1999 ◽

pp. 163-174

Author(s):

Héléne Touzet

Keyword(s):

Recursive Functions ◽

Higman's Lemma ◽

Higman’S Lemma

Download Full-text

On Implementation of Tree Synchronized Languages

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-48685-2_30 ◽

1999 ◽

pp. 382-396

Author(s):

Frédéric Saubion ◽

Igor Stéphan

Download Full-text

The Maude System

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-48685-2_18 ◽

1999 ◽

pp. 240-243 ◽

Cited By ~ 37

Author(s):

M. Clavel ◽

F. Durán ◽

S. Eker ◽

P. Lincoln ◽

N. Martí-Oliet ◽

...

Download Full-text

On the Strong Normalization of Natural Deduction with Permutation-Conversions

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-48685-2_4 ◽

1999 ◽

pp. 45-59 ◽

Cited By ~ 6

Author(s):

Philippe de Groote

Keyword(s):

Natural Deduction ◽

Strong Normalization

Download Full-text

Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-48685-2_7 ◽

1999 ◽

pp. 90-91

Author(s):

Bruno Courcelle

Keyword(s):

Graph Decompositions ◽

Hierarchical Graph

Download Full-text

Decidability for Left-Linear Growing Term Rewriting Systems

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-48685-2_22 ◽

1999 ◽

pp. 256-270 ◽

Cited By ~ 14

Author(s):

Takashi Nagaya ◽

Yoshihito Toyama

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Jeopardy

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-48685-2_2 ◽

1999 ◽

pp. 16-29 ◽

Cited By ~ 5

Author(s):

Nachum Dershowitz ◽

Subrata Mitra

Download Full-text

Theory Path Orderings

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-48685-2_12 ◽

1999 ◽

pp. 148-162 ◽

Cited By ~ 1

Author(s):

Jürgen Stuber

Download Full-text

Rewriting Techniques and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Fast Rewriting of Symmetric Polynomials

Context-Sensitive AC-rewriting

A Characterisation of Multiply Recursive Functions with Higman’s Lemma

On Implementation of Tree Synchronized Languages

The Maude System

On the Strong Normalization of Natural Deduction with Permutation-Conversions

Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas

Decidability for Left-Linear Growing Term Rewriting Systems

Jeopardy

Theory Path Orderings

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