Graph-grammar semantics of a higher-order programming language for distributed systems

DOI10.1007/3-540-57787-4_5zbMath1494.68037OpenAlexW1678192330MaRDI QIDQ5096275

Klaus Barthelmann, Georg Schied

Publication date: 16 August 2022

Published in: Graph Transformations in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57787-4_5

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (1)

Generating irregular partitionable data structures

Cites Work

• On categorical graph grammars integrating structural transformations and operations on labels
• Graph rewriting for a partial ordering semantics of concurrent constraints programming
• Equivalence of computations in actor grammars
• The programming language ADA. Reference manual. American National Standards Institute, Inc. ANSI/MIL-STD-1815A-1983. Approved 17 February 1983
• Algebra of communicating processes with abstraction
• Petri nets, event structures and domains. I
• A calculus of mobile processes. II
• Plain CHOCS. A second generation calculus for higher order processes
• Amalgamation of graph transformations: a synchronization mechanism
• The denotational semantics of dynamic networks of processes
• Graph expressions and graph rewritings
• π-Calculus semantics of object-oriented programming languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph-grammar semantics of a higher-order programming language for distributed systems