A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On Term Graphs as an Adhesive Category
2005
Electronical Notes in Theoretical Computer Science
The recent interest in bisimulation congruences for reduction systems, stimulated by the research on general (often graphical) frameworks for nominal calculi, has brought forward many proposals for categorical formalisms where relevant properties of observational equivalences could be automatically verified. Interestingly, some of these formalisms also identified suitable categories where the standard tools and techniques developed for the double-pushout approach to graph transformation [9]
doi:10.1016/j.entcs.2005.02.014
fatcat:rykwyd5jwzdprpzf3dx6wz4tvi