Abstract
This is a motivating tutorial introduction to a semantic analysis of programming languages using a graphical language as the representation of terms, and graph rewriting as a representation of reduction rules. We show how the graphical language automatically incorporates desirable features, such as α-equivalence and how it can describe pure computation, imperative store, and control features in a uniform framework. The graph semantics combines some of the best features of structural operational semantics and abstract machines, while offering powerful new methods for reasoning about contextual equivalence. All technical details are available in an extended technical report by Muroya and the author [11] and in Muroya’s doctoral dissertation [21].
Original language | English |
---|---|
Pages (from-to) | 1-10 |
Number of pages | 10 |
Journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
Volume | 334 |
DOIs | |
Publication status | Published - 8 Feb 2021 |
Event | 11th International Workshop on Computing with Terms and Graphs - Virtual, Online Duration: 5 Jul 2020 → 5 Jul 2020 |
Bibliographical note
Publisher Copyright:© Dan R. Ghica
ASJC Scopus subject areas
- Software