Premonoidal categories and notions of computation
From MaRDI portal
Publication:4366773
DOI10.1017/S0960129597002375zbMath0897.18002MaRDI QIDQ4366773
Edmund P. Robinson, A. John Power
Publication date: 1 October 1998
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
denotational semantics; fibration; computation; monad; premonoidal category; sequential composition of programs
68Q55: Semantics in the theory of computing
18D30: Fibered categories
18C10: Theories (e.g., algebraic theories), structure, and semantics
18C15: Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads
18C20: Eilenberg-Moore and Kleisli constructions for monads
Related Items
Traced Premonoidal Categories, An abstract monadic semantics for value recursion, Semantics of value recursion for Monadic Input/Output, Applicative programming with effects, Proof theory in the abstract, Generic models for computational effects, A representable approach to finite nondeterminism, Modelling environments in call-by-value programming languages., A representation result for free cocompletions, Dynamic connectors for concurrency, Premonoidal categories as categories with algebraic structure, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, Normal forms for algebras of connections., A functorial semantics for multi-algebras and partial algebras, with applications to syntax., Polarized games, On the call-by-value CPS transform and its semantics, Game-theoretic analysis of call-by-value computation, A game semantics of names and pointers
