文章基本信息

标题：Typed lambda-terms in categorical attributed graph transformation
本地全文：下载
作者：Bertrand Boisvert ; Louis Féraud ; Sergei Soloviev 等
期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2011
卷号：56
页码：33-47
DOI：10.4204/EPTCS.56.3
出版社：Open Publishing Association
摘要：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.