Typed lambda-terms in categorical attributed graph transformation

Details Typed lambda-terms in categorical attributed graph transformation Typed lambda-terms in categorical attributed graph transformation

Publishing date

2011-06-30

URL

arxiv.org/abs/1107.0065v1

Journals

EPTCS 56, 2011, pp. 33-47

Science

Computer Science

Field

Logic in Computer Science

Additional info

In Proceedings AMMSE 2011, arXiv:1106.5962

Type

Scientific paper

Digital Object Identifier

10.4204/EPTCS.56.3

Abstract

This paper deals with model transformation based on attributed graph rewriting. Our contribution investigates a single pushout approach for applying the rewrite rules. The computation of graph attributes is obtained through the use of typed lambda-calculus with inductive types. In this paper we present solutions to cope with single pushout construction for the graph structure and the computations functions. As this rewrite system uses inductive types, the expressiveness of attribute computations is facilitated and appears more efficient than the one based on Sigma-algebras. Some examples showing the interest of our computation approach are described in this paper.

Affiliated with

Also associated with

No associations

Rating

Typed lambda-terms in categorical attributed graph transformation 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 Typed lambda-terms in categorical attributed graph transformation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Typed lambda-terms in categorical attributed graph transformation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-480162