Difference between revisions of "Publications:The Semantics of Graphical Languages"
From CERES
(Created page with "<div style='display: none'> == Do not edit this section == </div> {{PublicationSetupTemplate|Author=Stephan Ellner, Walid Taha |PID=588265 |Name=Ellner, Stephan (Google Inc, M...") |
(No difference)
|
Latest revision as of 04:44, 26 June 2014
Title | The Semantics of Graphical Languages |
---|---|
Author | Stephan Ellner and Walid Taha |
Year | 2007 |
PublicationType | Conference Paper |
Journal | |
HostPublication | PEPM 2007 : proceedings of the Workshop on Partial Evaluation and Program Manipulation : Nice, France, January 15-16, 2007 |
DOI | http://dx.doi.org/10.1145/1244381.1244402 |
Conference | PEPM'07. 2007 ACM SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation, Nice, France, January 15-16 |
Diva url | http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:588265 |
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. Copyright © 2007 ACM. |