形状分层图变换

Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587) Pub Date : 2001-09-05 DOI:10.1109/HCC.2001.995230

B. Hoffmann

{"title":"形状分层图变换","authors":"B. Hoffmann","doi":"10.1109/HCC.2001.995230","DOIUrl":null,"url":null,"abstract":"Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs: /spl middot/ We extend graphs by a notion of hierarchy that supports value composition, and define hierarchical graph transformation in an intuitive way that resembles term rewriting. /spl middot/ We require that admissable shapes for hierarchical graphs are specified by context free graph grammars, in order to set up a type discipline for shapely hierarchical graph transformation. The resulting computational model shall be the basis of the visual language DIAPLAN for programming with graphs that represent diagrams.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Shapely hierarchical graph transformation\",\"authors\":\"B. Hoffmann\",\"doi\":\"10.1109/HCC.2001.995230\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs: /spl middot/ We extend graphs by a notion of hierarchy that supports value composition, and define hierarchical graph transformation in an intuitive way that resembles term rewriting. /spl middot/ We require that admissable shapes for hierarchical graphs are specified by context free graph grammars, in order to set up a type discipline for shapely hierarchical graph transformation. The resulting computational model shall be the basis of the visual language DIAPLAN for programming with graphs that represent diagrams.\",\"PeriodicalId\":438014,\"journal\":{\"name\":\"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HCC.2001.995230\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HCC.2001.995230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 22

摘要

图可以用图形表示，图的动画和转换可以用图形转换建模。本文研究了图的扩展和图的转换，这对图的编程是很重要的:/spl middot/我们通过支持值组合的层次概念扩展图，并以一种类似于术语重写的直观方式定义了层次图的转换。/spl middot/我们要求通过上下文无关的图语法指定分层图的可允许形状，以便为有形状的分层图转换建立类型规则。由此产生的计算模型应作为视觉语言DIAPLAN的基础，用于用表示图表的图形进行编程。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Shapely hierarchical graph transformation

Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs: /spl middot/ We extend graphs by a notion of hierarchy that supports value composition, and define hierarchical graph transformation in an intuitive way that resembles term rewriting. /spl middot/ We require that admissable shapes for hierarchical graphs are specified by context free graph grammars, in order to set up a type discipline for shapely hierarchical graph transformation. The resulting computational model shall be the basis of the visual language DIAPLAN for programming with graphs that represent diagrams.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)

自引率

0.00%

发文量