Monoidal indeterminates and categories of possible worlds

• Authors: C. Hermida;R. D. Tennent
• Venue: Theoretical Computer Science
• Year: 2012

Given any symmetric monoidal category C, a small symmetric monoidal category @S and a strong monoidal functor j:@S-C, we construct C[x:j@S], the polynomial category with a system of (freely adjoined) monoidal indeterminates x:I-j(w), natural in w@?@S. As a special case, we construct the free co-affine category (symmetric monoidal category with initial unit) on a given small symmetric monoidal category. We then exhibit all the known categories of ''possible worlds'' used to treat languages that allow for dynamic creation of ''new'' variables, locations, or names as instances of this construction and explicate their associated universality properties. As an application of the resulting characterization of O(W), Oles's category of possible worlds, we present an O(W)-indexed Lawvere theory of many-sorted storage, generalizing the single-sorted one introduced by J. Power, and we describe explicitly an associated monad of (typed) block algebras for local storage.