We present a categorical characterization of term graphs (i.e., finite, directed acyclic graphs labeled over a signature) that parallels the well-known characterization of terms as arrows of the algebraic theory of a given signature (i.e., the free Cartesian category generated by it). In particular, we show that term graphs over a signature Σ are one-to-one with the arrows of the free gs-monoidal category generated by Σ. Such a category satisfies all the axioms for Cartesian categories but for the naturality of two transformations (the discharger ! and the duplicator ▽), providing in this way an abstract and clear relationship between terms and term graphs. In particular, the absence of the naturality of ▽ and ! has a precise interpretation...
We propose a sound and complete axiomatisation of a class of graphs with nesting and either locally ...
The notion of term graph encodes a refinement of inductively generated syntax in which regard is pai...
We propose a modal logic tailored to describe graph transformations and discuss some of its properti...
It is well-known that a term rewriting system can be faithfully described by a cartesian 2-category,...
The article surveys a recent series of papers by the authors investigating the categorical foundatio...
AbstractThe article surveys a recent series of papers by the authors investigating the categorical f...
The article surveys a recent series of papers by the authors investigating the categorical foundatio...
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as...
AbstractThis paper introduces coalgebraic monads as a unified model of term algebras covering fundam...
Graphs and term graphs have proved strikingly flexible and expressive in modeling and specifying dis...
The recent interest in bisimulation congruences for reduction systems, stimulated by the research on...
Earlier papers argued that term graphs play for the specification of relation-based algebras the sam...
AbstractGraphs and term graphs have proved strikingly flexible and expressive in modeling and specif...
In this paper we propose an axiomatization of ‘partially abstract graphs’, i.e., of suitable classes...
We propose a sound and complete axiomatisation of a class of graphs with nesting and either locally ...
We propose a sound and complete axiomatisation of a class of graphs with nesting and either locally ...
The notion of term graph encodes a refinement of inductively generated syntax in which regard is pai...
We propose a modal logic tailored to describe graph transformations and discuss some of its properti...
It is well-known that a term rewriting system can be faithfully described by a cartesian 2-category,...
The article surveys a recent series of papers by the authors investigating the categorical foundatio...
AbstractThe article surveys a recent series of papers by the authors investigating the categorical f...
The article surveys a recent series of papers by the authors investigating the categorical foundatio...
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as...
AbstractThis paper introduces coalgebraic monads as a unified model of term algebras covering fundam...
Graphs and term graphs have proved strikingly flexible and expressive in modeling and specifying dis...
The recent interest in bisimulation congruences for reduction systems, stimulated by the research on...
Earlier papers argued that term graphs play for the specification of relation-based algebras the sam...
AbstractGraphs and term graphs have proved strikingly flexible and expressive in modeling and specif...
In this paper we propose an axiomatization of ‘partially abstract graphs’, i.e., of suitable classes...
We propose a sound and complete axiomatisation of a class of graphs with nesting and either locally ...
We propose a sound and complete axiomatisation of a class of graphs with nesting and either locally ...
The notion of term graph encodes a refinement of inductively generated syntax in which regard is pai...
We propose a modal logic tailored to describe graph transformations and discuss some of its properti...