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

Maribel Fernandez, Ian MacKie

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

1 Citation (Scopus)

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 HoP-rewriting 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 publicationProceedings of the 26th International Symposium on Principles and Practice of Declarative Programming, PPDP 2024, Co-located with the 26th International Symposium on Formal Methods
PublisherAssociation for Computing Machinery
ISBN (Electronic)9798400709692
DOIs
Publication statusPublished - 9 Sept 2024
Event26th International Symposium on Principles and Practice of Declarative Programming, PPDP 2024, 26th International Symposium on Formal Methods and held in conjunction with LOPSTR 2024 - Milan, Italy
Duration: 10 Sept 202411 Sept 2024

Publication series

NameACM International Conference Proceeding Series

Conference

Conference26th International Symposium on Principles and Practice of Declarative Programming, PPDP 2024, 26th International Symposium on Formal Methods and held in conjunction with LOPSTR 2024
Country/TerritoryItaly
CityMilan
Period10/09/202411/09/2024

Keywords

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

Fingerprint

Dive into the research topics of 'Hierarchical Higher-Order Port-Graphs: A Rewriting-Based Modelling Language'. Together they form a unique fingerprint.

Cite this