Strong functors and monoidal monads
DOI10.1007/BF01304852zbMATH Open0253.18007WikidataQ30053612 ScholiaQ30053612MaRDI QIDQ2557763FDOQ2557763
Authors: Anders Kock
Publication date: 1972
Published in: Archiv der Mathematik (Search for Journal in Brave)
Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects) (18F20) Actions of a monoidal category, tensorial strength (18D25)
Cites Work
Cited In (94)
- A coinductive calculus for asynchronous side-effecting processes
- Finitely presentable algebras for finitary monads
- Unguarded recursion on coinductive resumptions
- Monads on higher monoidal categories
- Restriction categories II: Partial map classification
- Covariant types
- Gabriel-Morita theory for excisive model categories
- Hopf monads: a survey with new examples and applications
- Categories
- Operadic categories and duoidal Deligne's conjecture
- Safe recursion revisited. I: Categorical semantics for lower complexity
- Lifting theorems for Kleisli categories
- The essence of higher-order concurrent separation logic
- Bernays-Gödel type theory
- Notions of computation and monads
- Lax monads. Indexed monoidal monads
- Combinatorial functional and differential equations applied to differential posets
- Monads and monoids on symmetric monoidal closed categories
- D-ultrafilters and their monads
- A presentation of the initial lift-algebra
- Title not available (Why is that?)
- A generalised quantifier theory of natural language in categorical compositional distributional semantics with bialgebras
- Behavioural equivalences for timed systems
- The Giry monad is not strong for the canonical symmetric monoidal closed structure on \textbf {Meas}
- Iris from the ground up: a modular foundation for higher-order concurrent separation logic
- Complete iterativity for algebras with effects
- Coalgebras and monads in the semantics of Java
- ``Keep definition, change category -- a practical approach to state-based system calculi
- Weakest preconditions in fibrations
- Fuzzy generalised quantifiers for natural language in categorical compositional distributional semantics
- From parametric polymorphism to models of polymorphic FPC
- The connected Vietoris powerlocale
- Semantics of weakening and contraction
- Local fibred right adjoints are polynomial
- A coalgebraic perspective on logical interpretations
- Pseudo-commutative monads and pseudo-closed 2-categories
- A calculus for generic, QoS-aware component composition
- Continuity as a computational effect
- Monads generated by monoids
- A categorical setting for lower complexity
- Symmetric monoidal comonads and differential algebra
- Generic weakest precondition semantics from monads enriched with order
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- Quantale-enriched multicategories via actions
- Title not available (Why is that?)
- On the construction of free algebras for equational systems
- Presheaf models of quantum computation: an outline
- Bundle functors and fibrations
- Lifting results for categories of algebras
- Title not available (Why is that?)
- Formal ball monads
- Selection functions, bar recursion and backward induction
- An equational notion of lifting monad
- Pseudo-commutativity of KZ 2-monads
- Monads and algebras in the semantics of partial data types
- Trace semantics via determinization
- The Herbrand functional interpretation of the double negation shift
- Monad as modality
- Bimonoidal structure of probability monads
- Limits in categories of Vietoris coalgebras
- Restriction categories III: colimits, partial limits and extensivity
- Some reasons for generalising domain theory
- Polynomial functors and polynomial monads
- Behavioural equivalences for coalgebras with unobservable moves
- Strong categorical datatypes II: A term logic for categorical programming
- Cartesian monads on toposes
- Reversible monadic computing
- Shades of iteration: from Elgot to Kleene
- When programs have to watch paint dry
- Plethysms and operads
- LNL polycategories and doctrines of linear logic
- Unguarded recursion on coinductive resumptions
- List Objects with Algebraic Structure
- Differential 2-rigs
- Frames and topological algebras for a double-power monad
- Classical mathematics for a constructive world
- Coinduction in Flow: The Later Modality in Fibrations
- Title not available (Why is that?)
- Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics
- Smart Choices and the Selection Monad
- Probability, valuations, hyperspace: three monads on Top and the support as a morphism
- Ambiguity and incomplete information in categorical models of language
- Title not available (Why is that?)
- Fixed-Point Elimination in the Intuitionistic Propositional Calculus
- Title not available (Why is that?)
- From gs-monoidal to oplax cartesian categories: constructions and functorial completeness
- Sum and tensor of quantitative effects
- Coherence for monoidal endofunctors
- Coherence for monoidal monads and comonads
- Title not available (Why is that?)
- A simply typed \(\lambda\)-calculus of forward automatic differentiation
- GENERALISATIONS OF LODAY’S ASSEMBLY MAPS FOR LAWVERE’S ALGEBRAIC THEORIES
- Strong functors on many-sorted sets
- Monoidal Kleisli bicategories and the arithmetic product of coloured symmetric sequences
This page was built for publication: Strong functors and monoidal monads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2557763)