Applications of typed lambda-terms to categorical attributed graph transformations
Abstract
This paper deals with modal transformation based on attributed graph rewriting. Our contribution investigates f single pushout approach for applying the rewrite rules. The computation of graph attributes is obtained through the use of lambda-terms in a 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 the rewrite systen use inductiv types, the expressive power of attribute computations increases and appears to be more efficient than the one based on sigma-algebras. Some examples showing the interest of our computation approach are described in this paper.References
Published
2012-12-01
How to Cite
Baranov, S., Boisvert, B., Soloviev, S., & Feraud, L. (2012). Applications of typed lambda-terms to categorical attributed graph transformations. SPIIRAS Proceedings, 4(23), 296-323. https://doi.org/10.15622/sp.23.15
Section
Articles
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
