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

9783540159766, 9783540396796

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Fast many-to-one matching algorithms

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-15976-2_21 ◽

1985 ◽

pp. 407-416 ◽

Cited By ~ 9

Author(s):

Paul Walton Purdom ◽

Cynthia A. Brown

Download Full-text

Basic features and development of the critical-pair/completion procedure

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-15976-2_1 ◽

1985 ◽

pp. 1-45 ◽

Cited By ~ 11

Author(s):

Bruno Buchberger

Keyword(s):

Critical Pair ◽

Basic Features

Download Full-text

An experiment in partial evaluation: The generation of a compiler generator

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-15976-2_6 ◽

1985 ◽

pp. 124-140 ◽

Cited By ~ 70

Author(s):

Neil D. Jones ◽

Peter Sestoft ◽

Harald Søndergaard

Keyword(s):

Partial Evaluation

Download Full-text

Combining unification algorithms for confined regular equational theories

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-15976-2_18 ◽

1985 ◽

pp. 365-380 ◽

Cited By ~ 11

Author(s):

Kathy Yelick

Keyword(s):

Equational Theories ◽

Unification Algorithms

Download Full-text

An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-15976-2_17 ◽

1985 ◽

pp. 345-364 ◽

Cited By ~ 7

Author(s):

Abdelilah Kandri-Rody ◽

Deepak Kapur ◽

Paliath Narendran

Keyword(s):

Word Problems ◽

Theoretic Approach ◽

Commutative Algebras ◽

Finitely Presented

Download Full-text

Deciding algebraic properties of monoids presented by finite church-rosser Thue systems

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-15976-2_4 ◽

1985 ◽

pp. 95-106 ◽

Cited By ~ 2

Author(s):

Friedrich Otto

Keyword(s):

Algebraic Properties

Download Full-text

NARROWER: a new algorithm for unification and its application to Logic Programming

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-15976-2_7 ◽

1985 ◽

pp. 141-157 ◽

Cited By ~ 34

Author(s):

Pierre Rety ◽

Claude Kirchner ◽

Hélène Kirchner ◽

Pierre Lescanne

Keyword(s):

Logic Programming

Download Full-text

Equational systems for category theory and intuitionistic logic

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-15976-2_24 ◽

1985 ◽

pp. 441-441

Author(s):

Gérard Huet

Keyword(s):

Intuitionistic Logic ◽

Category Theory

Download Full-text

Termination

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-15976-2_9 ◽

1985 ◽

pp. 180-224 ◽

Cited By ~ 44

Author(s):

Nachum Dershowitz

Download Full-text

Handling function definitions through innermost superposition and rewriting

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-15976-2_16 ◽

1985 ◽

pp. 325-344 ◽

Cited By ~ 9

Author(s):

Laurent Fribourg

Download Full-text

Rewriting Techniques and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Fast many-to-one matching algorithms

Basic features and development of the critical-pair/completion procedure

An experiment in partial evaluation: The generation of a compiler generator

Combining unification algorithms for confined regular equational theories

An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras

Deciding algebraic properties of monoids presented by finite church-rosser Thue systems

NARROWER: a new algorithm for unification and its application to Logic Programming

Equational systems for category theory and intuitionistic logic

Termination

Handling function definitions through innermost superposition and rewriting

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