Monoidal Kleisli category structure of classes of information transformers
P.V. Golubtsov
Abstract
P.V. Golubtsov
Abstract
It is proposed to consider any uniform class of information transforming systems as morphisms of a certain category -a category of information transformers (ITs). Composition of ITs corresponds to their consecutive application. The paper introduces an axiomatics for a category of ITs as a monoidal category that contains a subcategory (of deterministic ITs) with finite products and satisfies a certain set of axioms. Besides, it shows that many IT-categories can be constructed as Kleisli categories.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is proposed to consider any uniform class of information transforming systems as morphisms of a certain category -a category of information transformers (ITs). Composition of ITs corresponds to their consecutive application. The paper introduces an axiomatics for a category of ITs as a monoidal category that contains a subcategory (of deterministic ITs) with finite products and satisfies a certain set of axioms. Besides, it shows that many IT-categories can be constructed as Kleisli categories.
Key concepts: Enriched category, Symmetric monoidal category, Higher category theory, Monoidal category, Concrete category, Mathematics, Closed category, Morphism