The semantics of graphical languages Export

@inproceedings{citeulike:1873678, abstract = {Visual notations are pervasive in circuit design, control systems, and increasingly in mainstream programming environments. Yet many of the foundational advances in programming language theory are taking place in the context of textual notations. In order to map such advances to the graphical world, and to take the concerns of the graphical world into account when working with textual formalisms, there is a need for rigorous connections between textual and graphical expressions of computation. To this end, this paper presents a graphical calculus called Uccello. Our key insight is that Ariola and Blom's work on sharing in the cyclic lambda calculus provides an excellent foundation for formalizing the semantics of graphical languages. As an example of what can be done with this foundation, we use it to extend a graphical language with staging constructs. In doing so, we provide the first formal account of sharing in a multi-stage calculus.}, address = {New York, NY, USA}, author = {Ellner, Stephan and Taha, Walid}, booktitle = {PEPM '07: Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation}, citeulike-article-id = {1873678}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1244402}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1244381.1244402}, doi = {10.1145/1244381.1244402}, isbn = {9781595936202}, keywords = {computing, design, vpl}, pages = {122--133}, posted-at = {2008-09-04 07:44:31}, priority = {0}, publisher = {ACM}, title = {The semantics of graphical languages}, url = {http://dx.doi.org/10.1145/1244381.1244402}, year = {2007} }

TY - CONF ID - citeulike:1873678 L3 - citeulike-article-id:1873678 N2 - Visual notations are pervasive in circuit design, control systems, and increasingly in mainstream programming environments. Yet many of the foundational advances in programming language theory are taking place in the context of textual notations. In order to map such advances to the graphical world, and to take the concerns of the graphical world into account when working with textual formalisms, there is a need for rigorous connections between textual and graphical expressions of computation. To this end, this paper presents a graphical calculus called Uccello. Our key insight is that Ariola and Blom's work on sharing in the cyclic lambda calculus provides an excellent foundation for formalizing the semantics of graphical languages. As an example of what can be done with this foundation, we use it to extend a graphical language with staging constructs. In doing so, we provide the first formal account of sharing in a multi-stage calculus. SN - 9781595936202 AD - New York, NY, USA EP - 133 TI - The semantics of graphical languages PB - ACM T2 - PEPM '07: Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation SP - 122 KW - computing KW - design KW - vpl AU - Ellner, Stephan AU - Taha, Walid PY - 2007/// UR - http://dx.doi.org/10.1145/1244381.1244402 ER -