Simplification Orders for Term Graph Rewriting

Plump, Detlef orcid.org/0000-0002-1148-822X (1997) Simplification Orders for Term Graph Rewriting. In: Proceedings Mathematical Foundations of Computer Science (MFCS 1997). Lecture Notes in Computer Science . Springer , pp. 458-467.

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Dates:
  • Published: 1997
Institution: The University of York
Academic Units: The University of York > Faculty of Sciences (York) > Computer Science (York)
Depositing User: Pure (York)
Date Deposited: 02 Jul 2019 13:20
Last Modified: 04 Feb 2025 00:03
Published Version: https://doi.org/10.1007/BFb0029989
Status: Published
Publisher: Springer
Series Name: Lecture Notes in Computer Science
Identification Number: 10.1007/BFb0029989
Related URLs:
Open Archives Initiative ID (OAI ID):

Download

Accepted Version

Filename: Plump.MFCS.97.pdf

Description: Plump.MFCS.97

CLICK TO DOWNLOAD [thumbnail of Plump.MFCS.97]

Export

Statistics


CORE (COnnecting REpositories)