Iterated covariant powerset is not a monad
From MaRDI portal
Publication:2134821
DOI10.1016/j.entcs.2018.11.013OpenAlexW2905459795WikidataQ113317483 ScholiaQ113317483MaRDI QIDQ2134821
Publication date: 3 May 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2018.11.013
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (8)
Convexity via Weak Distributive Laws ⋮ Preservation and reflection of bisimilarity via invertible steps ⋮ Lattices do not distribute over powerset ⋮ Unnamed Item ⋮ Combining semilattices and semimodules ⋮ Unnamed Item ⋮ The Vietoris monad and weak distributive laws ⋮ Algebraic presentation of semifree monads
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of computation and monads
- A propositional dynamic logic for instantial neighborhood models
- Steps and traces
- Taut monads and \(T0\)-spaces.
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Trace semantics via determinization
- Monads of regular theories
- Types and coalgebraic structure
- Complete Iterativity for Algebras with Effects
- Coalgebraic Trace Semantics via Forgetful Logics
- Coalgebraic trace semantics via forgetful logics
- Recognisable Languages over Monads
- Monad compositions II: Kleisli strength
- Neighbourhood Structures: Bisimilarity and Basic Model Theory
- Alternation
- Implementing collection classes with monads
- Comprehending monads
- Generalizing determinization from automata to coalgebras
- Bialgebraic Semantics for Logic Programming
- Simplified Coalgebraic Trace Equivalence
- Canonical coalgebraic linear time logics
- Generic Trace Semantics via Coinduction
- Distributing probability over non-determinism
This page was built for publication: Iterated covariant powerset is not a monad
