Operational semantics with hierarchical abstract syntax graphs

Dan R. Ghica*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

19 Downloads (Pure)


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 languageEnglish
Pages (from-to)1-10
Number of pages10
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Publication statusPublished - 8 Feb 2021
Event11th International Workshop on Computing with Terms and Graphs - Virtual, Online
Duration: 5 Jul 20205 Jul 2020

Bibliographical note

Publisher Copyright:
© Dan R. Ghica

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Operational semantics with hierarchical abstract syntax graphs'. Together they form a unique fingerprint.

Cite this