The category of open graphs is a subcategory of the slice category Graph/2G, where 2G is the typing graph:
It is a subcategory because it imposes the additional restriction that morphisms must be full on vertices. We need to define this structure in Elm.
The category of open graphs is a subcategory of the slice category Graph/2G, where 2G is the typing graph:
It is a subcategory because it imposes the additional restriction that morphisms must be full on vertices. We need to define this structure in Elm.