Premonoidal categories and notions of computation

DOI10.1017/S0960129597002375zbMath0897.18002OpenAlexW2101416179MaRDI QIDQ4366773

Edmund P. Robinson, A. John Power

Publication date: 1 October 1998

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129597002375

zbMATH Keywords

denotational semanticsfibrationcomputationmonadpremonoidal categorysequential composition of programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Fibered categories (18D30) Theories (e.g., algebraic theories), structure, and semantics (18C10) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Related Items (58)

Normalization by evaluation and algebraic effects ⋮ Semantics of value recursion for Monadic Input/Output ⋮ Coalgebraic Components in a Many-Sorted Microcosm ⋮ A Semantical Approach to Equilibria and Rationality ⋮ Freyd categories are enriched Lawvere theories ⋮ From global to local state, coalgebraically and compositionally ⋮ Eilenberg-Kelly reloaded ⋮ Polarized games ⋮ On the call-by-value CPS transform and its semantics ⋮ Categorifying Computations into Components via Arrows as Profunctors ⋮ Generic models for computational effects ⋮ Game theoretic analysis of call-by-value computation ⋮ Equilogical spaces and algebras for a double-power monad ⋮ Monad transformers as monoid transformers ⋮ A representable approach to finite nondeterminism ⋮ A survey of categorical properties of \(\mathbb{L}\)-fuzzy relations ⋮ DisCoPy: Monoidal Categories in Python ⋮ Elementary control structures ⋮ LNL polycategories and doctrines of linear logic ⋮ Commutativity ⋮ On the Pre- and Promonoidal Structure of Spacetime ⋮ Promonads and String Diagrams for Effectful Categories ⋮ Duoidally enriched Freyd categories ⋮ Cartesian effect categories are Freyd-categories ⋮ Resource modalities in tensor logic ⋮ On the semantics of parsing actions ⋮ Game-theoretic analysis of call-by-value computation ⋮ Modelling environments in call-by-value programming languages. ⋮ Bayesian strategies: probabilistic programs as generalised graphical models ⋮ A game semantics of names and pointers ⋮ Pseudo-commutative Monads ⋮ An Algebraic Foundation for Graph-based Diagrams in Computing ⋮ What is a Categorical Model of Arrows? ⋮ Elements of a theory of algebraic theories ⋮ An abstract monadic semantics for value recursion ⋮ Partial Recursive Functions and Finality ⋮ Models for the computational λ-calculus ⋮ Applicative programming with effects ⋮ The arrow calculus ⋮ Icons ⋮ Proof theory in the abstract ⋮ Composing dinatural transformations: towards a calculus of substitution ⋮ Von Neumann categories ⋮ Parameterised notions of computation ⋮ Categorical semantics for arrows ⋮ Traced Premonoidal Categories ⋮ Axiomatics for Data Refinement in Call by Value Programming Languages ⋮ On the algebraic structure of declarative programming languages ⋮ GS·Λ Theories ⋮ A Categorical Semantics of Higher Order Store ⋮ A representation result for free cocompletions ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics ⋮ Normal forms for algebras of connections. ⋮ A functorial semantics for multi-algebras and partial algebras, with applications to syntax. ⋮ Dynamic connectors for concurrency ⋮ Premonoidal categories as categories with algebraic structure ⋮ Comonadic Notions of Computation ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic

This page was built for publication: Premonoidal categories and notions of computation