# Difference between revisions of "Graph processing and representation (Graep)"

From HaskellWiki

BrettGiles (talk | contribs) m (Graep moved to Graph processing and representation (Graep)) |
BrettGiles (talk | contribs) m (Category) |
||

Line 1: | Line 1: | ||

Graep means Graph processing and representation. |
Graep means Graph processing and representation. |
||

− | |||

+ | [[Category:Research]] |
||

Graep tries to unite Topology, Category Theory, Graph Theory and functonal programming. |
Graep tries to unite Topology, Category Theory, Graph Theory and functonal programming. |
||

The basic idea is that you have a coloured typed petri net whos edges are arrows. |
The basic idea is that you have a coloured typed petri net whos edges are arrows. |

## Revision as of 19:21, 8 October 2006

Graep means Graph processing and representation. Graep tries to unite Topology, Category Theory, Graph Theory and functonal programming. The basic idea is that you have a coloured typed petri net whos edges are arrows. Thus you can use all the arrow operations on them. Since the Graphs are topologies you can use topological glues to build up your program in a CW simplex like way. Graph Theory will help you to determine ie. wheather the graph is cycle free, which tells you if you can fold the whole program to a single arrow.

The idea of this page is that everyone can help in pushing this idea forward and to keep track of the progress.