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

TOTAL DOCUMENTS

37

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540614647, 9783540685968

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

EPIC: An equational language Abstract machine and supporting tools

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-61464-8_72 ◽

1996 ◽

pp. 424-427 ◽

Author(s):

H. R. Walters ◽

Juris F. Th.Kamperman

Keyword(s):

Abstract Machine

Download Full-text

Higher-order narrowing with definitional trees

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-61464-8_48 ◽

1996 ◽

pp. 138-152 ◽

Author(s):

Michael Hanus ◽

Christian Prehofer

Keyword(s):

Download Full-text

Rewrite-based automated reasoning: Challenges ahead

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-61464-8_38 ◽

1996 ◽

pp. 1-2

Author(s):

Deepak Kapur

Keyword(s):

Automated Reasoning

Download Full-text

Coherence for sharing proof nets

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-61464-8_54 ◽

1996 ◽

pp. 215-229 ◽

Author(s):

S. Guerrini ◽

S. Martini ◽

A. Masini

Keyword(s):

Download Full-text

An algorithm for distributive unification

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-61464-8_60 ◽

1996 ◽

pp. 287-301 ◽

Author(s):

Manfred Schmidt-Schauß

Download Full-text

On the termination problem for one-rule semi-Thue system

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-61464-8_61 ◽

1996 ◽

pp. 302-316 ◽

Author(s):

Géraud Sénizergues

Keyword(s):

Thue System ◽

Termination Problem

Download Full-text

The first-order theory of one-step rewriting is undecidable

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-61464-8_59 ◽

1996 ◽

pp. 276-286 ◽

Author(s):

Ralf Treinen

Keyword(s):

Order Theory ◽

First Order ◽

First Order Theory ◽

Download Full-text

Applications of rewrite techniques in monoids and rings

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-61464-8_57 ◽

1996 ◽

pp. 260-260

Author(s):

Klaus Madlener

Download Full-text

Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract)

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-61464-8_52 ◽

1996 ◽

pp. 184-199 ◽

Author(s):

Delia Kesner

Keyword(s):

Explicit Substitutions

Download Full-text

On proving termination by innermost termination

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-61464-8_45 ◽

1996 ◽

pp. 93-107 ◽

Author(s):

Bernhard Gramlich

Download Full-text