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

被引：1
作者：
Fernandez, Maribel [1 ]
Mackie, Ian [2 ]
机构：
[1] Kings Coll London, Dept Informat, London, England
[2] London South Bank Univ, London, England
来源：
26TH INTERNATIONAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING, PPDP 2024 | 2024年
关键词：
graph rewriting systems; port graphs; hierarchical graphs; SPO semantics; strategy languages; lambda-calculus; CALCULUS; BIGRAPHS;
D O I：
10.1145/3678232.3678238
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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 Lowe's notion of graph structure. We also discuss simple extensions of strategy languages to take into account the hierarchical structure of HoP.
引用
收藏
页数：14
相关论文
共 46 条
  • [1] Proof nets and the call-by-value λ-calculus
    Accattoli, Beniamino
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 606 : 2 - 24
  • [2] Alvarez-picallo Mario., 2022, LIPIcs, V228, p29:1
  • [3] A new graphical calculus of proofs
    Alves, Sandra
    Fernandez, Maribel
    Mackie, Ian
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (48): : 69 - 84
  • [4] A Rewriting Calculus for Multigraphs with Ports
    Andrei, Oana
    Kirchner, Helene
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 219 : 67 - 82
  • [5] Auber David, 2018, Encyclopedia of Social Network Analysis and Mining, P3185, DOI [10.1007/978-1-4939-7131-2315, DOI 10.1007/978-1-4939-7131-2315]
  • [6] Barendregt H.P., 1984, Studies in Logic and the Foundations of Mathematics
  • [7] Matching of Bigraphs
    Birkedal, Lars
    Damgaard, Troels Christoffer
    Glenstrup, Arne John
    Milner, Robin
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 175 (04) : 3 - 19
  • [8] Extensional and Intensional Strategies
    Bourdier, Tony
    Cirstea, Horatiu
    Dougherty, Daniel J.
    Kirchner, Helene
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (15): : 1 - 19
  • [9] On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs
    Bruni, Roberto
    Montanari, Ugo
    Plotkin, Gordon
    Terreni, Daniele
    [J]. FUNDAMENTA INFORMATICAE, 2014, 134 (3-4) : 287 - 317
  • [10] Hierarchical graph transformation
    Drewes, F
    Hoffmann, B
    Plump, D
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 64 (02) : 249 - 283
12345