Monads for behaviour
From MaRDI portal
Publication:265824
DOI10.1016/j.entcs.2013.09.019zbMath1334.68050OpenAlexW1974390662WikidataQ113317953 ScholiaQ113317953MaRDI QIDQ265824
Publication date: 12 April 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2013.09.019
Functional programming and lambda calculus (68N18) Theories (e.g., algebraic theories), structure, and semantics (18C10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)
Related Items
The coinductive resumption monad ⋮ Unnamed Item ⋮ Unguarded recursion on coinductive resumptions ⋮ Unifying Guarded and Unguarded Iteration ⋮ Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot ⋮ Unnamed Item
Uses Software
Cites Work
- Notions of computation and monads
- The category-theoretic solution of recursive program schemes
- Infinite trees and completely iterative theories: A coalgebraic view
- Completely iterative algebras and completely iterative monads
- Combining effects: sum and tensor
- On Rational Monads and Free Iterative Theories
- Fibrational Induction Meets Effects
- Trace-Based Coinductive Operational Semantics for While
- The Category-Theoretic Solution of Recursive Domain Equations
- Coproducts of Ideal Monads
- A note on Coinduction and Weak Bisimilarity for While Programs
- Categorical fixed point calculus
- Inductive reasoning about effectful data types
- General Recursion via Coinductive Types
- Elgot Algebras
- Generic Trace Semantics via Coinduction
- Lifting theorems for Kleisli categories
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item