Chantawibul, Apiwat and Sobocinski, Pawel
(2018)
Monoidal multiplexing.
Fischer, B. and Uustalu, T.
(eds.)
In *Theoretical Aspects of Computing – ICTAC 2018. *
vol. 11187,
Springer.
pp. 116-131
.
(doi:10.1007/978-3-030-02508-3_7).

## Abstract

Given a classical algebraic structure—e.g. a monoid or group—with carrier set X, and given a positive integer n, there is a canonical way of obtaining the same structure on carrier set Xn by defining the required operations “pointwise”. For resource-sensitive algebra (i.e. based on mere symmetric monoidal, not cartesian structure), similar “pointwise” operations are usually defined as a kind of syntactic sugar: for example, given a comonoid structure on X, one obtains a comultiplication on X⊗X by tensoring two comultiplications and composing with an appropriate permutation. This is a specific example of a general construction that we identify and refer to as multiplexing. We obtain a general theorem that guarantees that any equation that holds in the base case will hold also for the multiplexed operations, thus generalising the “pointwise” definitions of classical universal algebra.

**multiplex - Accepted Manuscript**

## More information

## Identifiers

## Catalogue record

## Export record

## Altmetrics

## Contributors

## Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.