Typed lambda-terms in categorical attributed graph transformation 英文论文文献.docVIP

Typed lambda-terms in categorical attributed graph transformation Bertrand Boisvert, Louis F′eraud, Sergei Soloviev IRIT Universit′e Paul Sabatier Toulouse, France {boisvert,feraud,soloviev}@irit.fr 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 at- tributes is obtained through the use of typed λ -calculus with inductive types. In this paper we present solutions to cope with single pushout construction for the graph structure and the computations