Boolean restriction categories and taut monads

DOI10.1016/j.tcs.2006.02.014zbMath1097.68071OpenAlexW2074491733MaRDI QIDQ2503320

Ernie Manes

Publication date: 14 September 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.02.014

zbMATH Keywords

dynamic logicrestriction categoriesBoolean categoriesmonads in programming

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)

Related Items

\(\mathcal{M}\)-coextensive objects and the strict refinement property, Boolean and classical restriction categories, Taut Monads, Dynamic Logic and Determinism

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• Partial morphisms in categories of effective objects
• Categories of partial maps
• Partiality, cartesian closedness, and toposes
• Monads and algebras in the semantics of partial data types
• Taut monads and \(T0\)-spaces.
• Guarded and banded semigroups.
• Predicate Transformer Semantics
• Dominical categories: recursion theory without elements
• Implementing collection classes with monads
• Comprehending monads
• Programming as a Discipline of Mathematical Nature
• Every Standard Construction is Induced by a Pair of Adjoint Functors
• Restriction categories. I: Categories of partial maps