Unifying theories of programming with monads
From MaRDI portal
Publication:3455643
Recommendations
Cites work
- A Couple of Novelties in the Propositional Calculus
- A functional theory of exceptions
- Comprehending monads
- Distributing probability over non-determinism
- Elementary probability theory in the Eindhoven style
- Every Standard Construction is Induced by a Pair of Adjoint Functors
- FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
- Handlers of Algebraic Effects
- Predicative programming Part I
- Probabilistic models for the guarded command language
- Programs are predicates
- Refinement algebra for probabilistic programs
- Refinement-oriented probability for CSP
- Remarks on testing probabilistic processes
- Semantics of probabilistic programs
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- Towards Automated Proof Support for Probabilistic Distributed Systems
Cited in
(7)- A divertimento on MonadPlus and nondeterminism
- FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
- A trustful monad for axiomatic reasoning with probability and nondeterminism
- scientific article; zbMATH DE number 5598380 (Why is no real title available?)
- Lightweight monadic programming in ML
- A functional account of probabilistic programming with possible worlds. Declarative pearl
- Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
This page was built for publication: Unifying theories of programming with monads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455643)
