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.
Highlights
This paper deals with model transformation based on attributed graph rewriting
Íàø îïûò ñ ïîäõîäîì DPoPb [9,10,12] è èñïîëüçîâàíèåì λ-òåðìîâ äëÿ àòðèáóòîâ îêàçàëñÿ ïåðñïåêòèâíûì, íî ïîñòðîåíèå äâîéíîãî óíèâåðñàëüíîãî êâàäðàòà ïîâëåêëî ðÿä îãðàíè÷åíèé, ñâÿçàííûõ ñ èñïîëüçîâàíèåì âñþäó îïðåäåëåííûõ îòîáðàæåíèé è âûíóæäåííûì ðàçáèåíèåì âû÷èñëåíèé íà äâà ýòàïà
In both examples computation of attributes is benchmarked against classical DPo approach and the substantial reduction of the number of steps is demonstrated
Summary
Áàðàíîâ Ñ.Í., Áóàâåð Á., Ñîëîâüåâ Ñ.Â., Ôåðî Ë. Íåêîòîðûå ïðèëîæåíèÿ λ-èñ÷èñëåíèÿ ñ òèïàìè ê àòðèáóòíûì âû÷èñëåíèÿì â ñèñòåìàõ êàòåãîðíûõ ïðåîáðàçîâàíèé ãðàôîâ. Ðàññìàòðèâàþòñÿ ïðåîáðàçîâàíèÿ ìîäåëåé íà îñíîâå ïðåîáðàçîâàíèé àòðèáóòíûõ ãðàôîâ. Èññëåäóåòñÿ ïîäõîä îäèíàðíîãî óíèâåðñàëüíîãî êâàäðàòà (single pushout) äëÿ ïðèìåíåíèÿ ïðàâèë ïðåîáðàçîâàíèÿ â êàòåãîðèè àòðèáóòíûõ ãðàôîâ. Ïðåîáðàçîâàíèÿ àòðèáóòîâ çàäàþòñÿ ïðè ïîìîùè λòåðìîâ â λ-èñ÷èñëåíèè ñ èíäóêòèâíûìè òèïàìè. Ïðåäëàãàþòñÿ ðåøåíèÿ, ïîçâîëÿþùèå ðàáîòàòü ñ êîíñòðóêöèåé îäèíàðíîãî óíèâåðñàëüíîãî êâàäðàòà äëÿ ïðåîáðàçîâàíèÿ ñòðóêòóðû ãðàôà è àòðèáóòíûõ âû÷èñëèòåëüíûõ ôóíêöèé. Èñïîëüçîâàíèå èíäóêòèâíûõ òèïîâ ïîâûøàåò âûðàçèòåëüíîñòü è ýôôåêòèâíîñòü àòðèáóòíûõ âû÷èñëåíèé ïî ñðàâíåíèþ ñ èçâåñòíûì ïîäõîäîì íà îñíîâå. Ïðèâîäèòñÿ ðÿä ïðèìåðîâ, äåìîíñòðèðóþùèõ îñîáåííîñòè ïðåäëàãàåìîãî ïîäõîäà. Êëþ÷åâûå ñëîâà: òåîðèÿ êàòåãîðèé, óíèâåðñàëüíûé êâàäðàò, λ-èñ÷èñëåíèå, ïåðåïèñûâàíèå àòðèáóòíûõ ãðàôîâ. Baranov S., Boisvert B., Soloviev S., Feraud L. Applications of typed λ-terms to categorical attributed graph transformations
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
