Premonoidal categories as categories with algebraic structure

DOI10.1016/S0304-3975(00)00340-6zbMath1002.68089MaRDI QIDQ1605185

A. John Power

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

premonoidal categories

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Categories of machines, automata (18B20)

Related Items (9)

Categorical proof theory of classical propositional calculus ⋮ Generic models for computational effects ⋮ Promonads and String Diagrams for Effectful Categories ⋮ Duoidally enriched Freyd categories ⋮ Enriched categories as a free cocompletion ⋮ Modelling environments in call-by-value programming languages. ⋮ Models for the computational λ-calculus ⋮ Proof theory in the abstract ⋮ Axiomatics for Data Refinement in Call by Value Programming Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
• Variations on algebra: Monadicity and generalisations of equational theories
• Notions of computation and monads
• A universal property of the convolution monoidal structure
• Two-dimensional monad theory
• A representable approach to finite nondeterminism
• Why tricategories?
• Premonoidal categories and notions of computation
• Axiomatic Domain Theory in Categories of Partial Maps
• Game theoretic analysis of call-by-value computation
• Elementary control structures

This page was built for publication: Premonoidal categories as categories with algebraic structure