@inbook{b818cbe969e0453a85afd91fbbc20010,
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.",
author = "Maribel Fern{\'a}ndez and Ian Mackie and Pinto, {Jorge S.}",
year = "2002",
doi = "10.1016/j.entcs.2002.09.005",
language = "English",
volume = "N/A",
series = "Electronic Notes in Theoretical Computer Science, Vol. 72 (1)",
publisher = "Elsevier",
editor = "D. Plump",
booktitle = "Proceedings of the First International Workshop on Term Graph Rewriting",
edition = "N/A",
}