# Graph processing and representation (Graep)

### From HaskellWiki

(Difference between revisions)

BrettGiles (Talk | contribs) m (Category) |
BrettGiles (Talk | contribs) m (link, spelling) |
||

Line 1: | Line 1: | ||

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

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

− | Graep tries to unite Topology, Category | + | Graep tries to unite Topology, [[Category theory]], Graph Theory and functional programming. |

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

Thus you can use all the arrow operations on them. Since the Graphs are topologies you | 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. | can use topological glues to build up your program in a CW simplex like way. |

## Latest revision as of 03:54, 20 December 2006

Graep means Graph processing and representation. Graep tries to unite Topology, Category theory, Graph Theory and functional programming. The basic idea is that you have a coloured typed petri net whose 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.