Hierarchical Higher-Order Port-Graphs: A Rewriting-Based Modelling Language

Maribel Fernandez, Ian Mackie

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present hierarchical higher-order port graphs (HoP) and a notion of strategic HoP-rewriting, as a foundation for modelling tools. To illustrate the methodology we provide a specification of the lambda-calculus, the computation model underlying the functional programming paradigm. We give a categorical semantics for HoPrewriting following the Single Pushout approach, by generalising Löwe’s notion of graph structure. We also discuss simple extensions of strategy languages to take into account the hierarchical structure of HoP.
Original languageEnglish
Title of host publicationPPDP '24: Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming
EditorsAlessandro Bruni, Alberto Momigliano
PublisherAssociation for Computing Machinery
Pages1-14
Number of pages14
ISBN (Electronic)979-8-4007-0969-2
DOIs
Publication statusPublished - 9 Sept 2024
Externally publishedYes

Publication series

NameACM International Conference Proceeding Series

Keywords

  • SPO semantics
  • graph rewriting systems
  • hierarchical graphs
  • lambda-calculus
  • port graphs
  • strategy languages

Cite this