  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.
