Paper Info
Title
A Higher-Order Calculus for Graph Transformation
Abstract
This paper presents a formalism for defining higher-order systems based on the notion of graph transformation (by rewriting or interaction). The syntax is inspired by the Combinatory Reduction Systems of Klop. The rewrite rules can be used to define first-order systems, such as graph or term-graph rewriting systems, Lafont's interaction nets, the interaction systems of Asperti and Laneve, the non-deterministic nets of Alexiev, or a process calculus. They can also be used to specify higher-order systems such as hierarchical graphs and proof nets of Linear Logic, or to specify the operational semantics of graph-based languages.
Year
DOI
Venue
2007
10.1016/j.entcs.2002.09.005
Electronic Notes in Theoretical Computer Science
Keywords
Field
DocType
Higher-order system,graph transformation,Combinatory Reduction System,graph rewriting system
Discrete mathematics,Interaction nets,Graph property,Computer science,Theoretical computer science,Null graph,Wait-for graph,Graph rewriting,Abstract semantic graph,Process calculus,Graph (abstract data type)
Journal
Volume
Issue
ISSN
72
1
1571-0661
Citations 
PageRank 
References 
7
0.54
11
Authors
3
Name
Order
Citations
PageRank
Maribel Fernández1141.02
Ian Mackie2262.43
Jorge Sousa Pinto316023.19