Plump, DETLEF orcid.org/0000-0002-1148-822X (1991) Graph-Reducible Term Rewriting Systems. In: Proc. Graph Grammars and Their Application to Computer Science. Lecture Notes in Computer Science. Springer, pp. 622-636.
Metadata
| Item Type: | Proceedings Paper |
|---|---|
| Authors/Creators: |
|
| Copyright, Publisher and Additional Information: | This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details. |
| Dates: |
|
| Institution: | The University of York |
| Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
| Date Deposited: | 30 Jul 2026 14:00 |
| Last Modified: | 30 Jul 2026 14:00 |
| Published Version: | https://doi.org/10.1007/BFB0017417 |
| Status: | Published |
| Publisher: | Springer |
| Series Name: | Lecture Notes in Computer Science |
| Identification Number: | 10.1007/BFB0017417 |
| Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:243836 |

CORE (COnnecting REpositories)
CORE (COnnecting REpositories)