)
(the appropriate term algebra).
)
(single-coloured flow graphs up to bisimulation).
, we need
a category with chosen finite products, and an interpretation
for .
For example:
)
(the appropriate term algebra).
)
(single-coloured flow graphs up to bisimulation).
.
Proposition
Graph()
is the initial strict cartesian category
over .
As a corollary, giving a flow graph semantics for a language
uniquely defines a semantics in any other strict cartesian category
over .