Languages for monoidal categories (Q584380): Difference between revisions

As the title suggests, the author introduces typed languages for monoidal categories, in analogy with what has been done for toposes and cartesian closed categories (for example). As more and more examples of non-strict monoidal categories arise - quantum groups come to mind - such languages should become more widely used and useful. To quote the author, ``The power of this language is that it manipulates not only the formal monoidal structure, which the coherence theorem also does, but the data specific to [the monoidal category].'' The language depends both on the theory of a monoidal category and the specific model with which one wants to work.