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

9783540568681

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Redundancy criteria for constrained completion

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-56868-9_2 ◽

1993 ◽

pp. 2-16 ◽

Cited By ~ 3

Author(s):

Christopher Lynch ◽

Wayne Snyder

Download Full-text

Simple termination is difficult

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-56868-9_18 ◽

1993 ◽

pp. 228-242 ◽

Cited By ~ 2

Author(s):

Aarl Middeldorp ◽

Bernhard Gramlich

Download Full-text

Relating graph and term rewriting via Böhm models

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-56868-9_15 ◽

1993 ◽

pp. 183-197

Author(s):

Zena M. Ariola

Keyword(s):

Term Rewriting

Download Full-text

Reduce the redex → ReDuX

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-56868-9_35 ◽

1993 ◽

pp. 446-450 ◽

Cited By ~ 12

Author(s):

Reinhard Bündgen

Download Full-text

MERILL: An equational reasoning system in standard ML

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-56868-9_34 ◽

1993 ◽

pp. 441-445 ◽

Cited By ~ 3

Author(s):

Brian Matthews

Keyword(s):

Equational Reasoning ◽

Standard Ml ◽

Reasoning System

Download Full-text

A precedence-based total AC-compatible ordering

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-56868-9_28 ◽

1993 ◽

pp. 374-388 ◽

Cited By ~ 14

Author(s):

Albert Rubio ◽

Robert Nieuwenhuis

Download Full-text

Encompassment properties and automata with constraints

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-56868-9_25 ◽

1993 ◽

pp. 328-342 ◽

Cited By ~ 25

Author(s):

Anne-Cécile Caron ◽

Jean-Luc Coquide ◽

Max Dauchet

Download Full-text

A graph reduction approach to incremental term rewriting

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-56868-9_20 ◽

1993 ◽

pp. 259-273 ◽

Cited By ~ 2

Author(s):

John Field

Keyword(s):

Term Rewriting ◽

Graph Reduction ◽

Reduction Approach

Download Full-text

Total termination of term rewriting

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-56868-9_17 ◽

1993 ◽

pp. 213-227 ◽

Cited By ~ 6

Author(s):

M. C. F. Ferreira ◽

H. Zantema

Keyword(s):

Term Rewriting

Download Full-text

Topics in termination

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-56868-9_16 ◽

1993 ◽

pp. 198-212 ◽

Cited By ~ 18

Author(s):

Nachum Dershowitz ◽

Charles Hoot

Download Full-text

Rewriting Techniques and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Redundancy criteria for constrained completion

Simple termination is difficult

Relating graph and term rewriting via Böhm models

Reduce the redex → ReDuX

MERILL: An equational reasoning system in standard ML

A precedence-based total AC-compatible ordering

Encompassment properties and automata with constraints

A graph reduction approach to incremental term rewriting

Total termination of term rewriting

Topics in termination

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