Computer Science – Logic in Computer Science
Scientific paper
2009-11-29
EPTCS 12, 2009, pp. 99-115
Computer Science
Logic in Computer Science
Scientific paper
10.4204/EPTCS.12.7
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.
Heckel Reiko
Torrini Paolo
No associations
LandOfFree
Towards an embedding of Graph Transformation in Intuitionistic Linear Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Towards an embedding of Graph Transformation in Intuitionistic Linear Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards an embedding of Graph Transformation in Intuitionistic Linear Logic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-148572