Computer Science – Logic in Computer Science
Scientific paper
2010-07-22
EPTCS 26, 2010, pp. 169-180
Computer Science
Logic in Computer Science
In Proceedings DCM 2010, arXiv:1006.1937
Scientific paper
10.4204/EPTCS.26.16
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end) and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information.
Dixon Lucas
Duncan Ross
Kissinger Aleks
No associations
LandOfFree
Open Graphs and Computational Reasoning 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 Open Graphs and Computational Reasoning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Open Graphs and Computational Reasoning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-611002