0911.5525v1.pdf (205.91 kB)
Download file

Towards an embedding of Graph Transformation in Intuitionistic Linear Logic

Download (205.91 kB)
conference contribution
posted on 01.10.2015, 10:46 by Paolo Torrini, Reiko Heckel
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.

History

Citation

Proceedings 2nd Interaction and Concurrency Experience, Structured Interactions, CONCUR 2009 affiliated workshop 31st August - Bologna, Italy, 2009, pp. 99-115

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Source

2nd Interaction and Concurrency Experience, Structured Interactions, CONCUR 2009, affiliated workshop 31st August - Bologna, Italy.

Version

VoR (Version of Record)

Published in

Proceedings 2nd Interaction and Concurrency Experience

Publisher

EPTCS

issn

2075-2180

Copyright date

2009

Available date

01/10/2015

Publisher version

http://eptcs.web.cse.unsw.edu.au/content.cgi?ICE2009 http://arxiv.org/abs/0911.5525v1

Temporal coverage: start date

31/08/2009

Temporal coverage: end date

31/08/2009

Language

en

Usage metrics

Categories

Keywords

Exports