Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation

Details Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation

2011-01-18

arxiv.org/abs/1101.3417v3

Computer Science

Logic in Computer Science

Scientific paper

Rewriting systems are often defined as binary relations over a given set of objects. This simple definition is used to describe various properties of rewriting such as termination, confluence, normal forms etc. In this paper, we introduce a new notion of abstract rewriting in the framework of categories. Then, we define the functoriality property of rewriting systems. This property is sometimes called vertical composition. We show that most of graph transformation systems are functorial and provide a counter-example of graph transformation systems which is not functorial.

Affiliated with

Also associated with

No associations

Rating

Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286736