Please use this identifier to cite or link to this item:
Title: Towards an embedding of Graph Transformation in Intuitionistic Linear Logic
Authors: Torrini, Paolo
Heckel, Reiko
First Published: 3-Dec-2009
Presented at: 2nd Interaction and Concurrency Experience, Structured Interactions, CONCUR 2009, affiliated workshop 31st August - Bologna, Italy.
Start Date: 31-Aug-2009
End Date: 31-Aug-2009
Publisher: EPTCS
Citation: Proceedings 2nd Interaction and Concurrency Experience, Structured Interactions, CONCUR 2009 affiliated workshop 31st August - Bologna, Italy, 2009, pp. 99-115
Abstract: Linear logics have been shown to be able to embed both rewriting-based approaches and process calculi in a single, declarative framework. In this paper we are exploring the embedding of double-pushout graph transformations into quantified linear logic, leading to a Curry-Howard style isomorphism between graphs and transformations on one hand, formulas and proof terms on the other. With linear implication representing rules and reachability of graphs, and the tensor modelling parallel composition of graphs and transformations, we obtain a language able to encode graph transformation systems and their computations as well as reason about their properties.
DOI Link: 10.4204/EPTCS.12.7
ISSN: 2075-2180
Version: Publisher Version
Status: Peer-reviewed
Type: Conference Paper
Rights: Copyright © the authors, 2009. This is an open-access article distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Appears in Collections:Conference Papers & Presentations, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
0911.5525v1.pdfPublished (publisher PDF)205.91 kBAdobe PDFView/Open

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.