Closed felixwellen closed 2 months ago
The path graph consists of the inductive type of composable lists of edges. now the constructors have the same argument order as lists and everything is phrased in diagrammatic order. Some coherences have been added and a 'map' for path-graphs.
The path graph consists of the inductive type of composable lists of edges. now the constructors have the same argument order as lists and everything is phrased in diagrammatic order. Some coherences have been added and a 'map' for path-graphs.