Plump, Detlef orcid.org/0000-0002-1148-822X (2017) From Imperative to Rule-based Graph Programs. Journal of Logical and Algebraic Methods in Programming. pp. 154-173. ISSN 2352-2216
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2017 Elsevier B.V. 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. |
Keywords: | Graph Programs; GP 2; Rule-based Programming; Computational Completeness; Random Access Machines; Graph Transformation |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 17 Jan 2017 12:24 |
Last Modified: | 16 Oct 2024 13:31 |
Published Version: | https://doi.org/10.1016/j.jlamp.2016.12.001 |
Status: | Published |
Refereed: | Yes |
Identification Number: | 10.1016/j.jlamp.2016.12.001 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:110721 |
Download
Filename: 1_s2.0_S2352220816301675_main.pdf
Description: 1-s2.0-S2352220816301675-main
Licence: CC-BY-NC-ND 2.5