Amanote Research

Amanote Research

    RegisterSign In

Critical Pairs in Term Graph Rewriting

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-58338-6_102
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1994

Authors
Detlef Plump
Publisher

Springer Berlin Heidelberg


Related search

Simplification Orders for Term Graph Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Term-Graph Rewriting via Explicit Paths

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Foreword: Special Issue on Term and Graph Rewriting

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2018English

Congruences for Contextual Graph-Rewriting

BRICS Report Series
2004English

Critical Pair Analysis in Nominal Rewriting

English

Strategic Port Graph Rewriting: An Interactive Modelling Framework

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2018English

Transfinite Reductions in Orthogonal Term Rewriting Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Confluence of Curried Term-Rewriting Systems

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1995English

Context Term Calculus for Rewriting Systems

PROBLEMS IN PROGRAMMING
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy