Graph processing and representation (Graep)
Revision as of 19:19, 8 October 2006 by BrettGiles (talk | contribs) (Graep moved to Graph processing and representation (Graep))
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
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.
