Currently, the implementation of occurrence graph grammars and doubly-typed graphs is made based on a pair of (simply-)typed graphs. We should create the category of doubly-typed graphs and isolate its implementation, to proper represent and handle the problem domain.
Currently, the implementation of occurrence graph grammars and doubly-typed graphs is made based on a pair of (simply-)typed graphs. We should create the category of doubly-typed graphs and isolate its implementation, to proper represent and handle the problem domain.