Unifying theories of programming with monads
From MaRDI portal
Publication:3455643
DOI10.1007/978-3-642-35705-3_2zbMATH Open1452.68041OpenAlexW2138575529MaRDI QIDQ3455643FDOQ3455643
Publication date: 11 December 2015
Published in: Unifying Theories of Programming (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.260.40
Recommendations
Cites Work
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- Handlers of Algebraic Effects
- Distributing probability over non-determinism
- Every Standard Construction is Induced by a Pair of Adjoint Functors
- FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
- Comprehending monads
- Semantics of probabilistic programs
- Refinement-oriented probability for CSP
- Probabilistic models for the guarded command language
- Remarks on testing probabilistic processes
- A Couple of Novelties in the Propositional Calculus
- Predicative programming Part I
- Towards Automated Proof Support for Probabilistic Distributed Systems
- Refinement algebra for probabilistic programs
- Programs are predicates
- A functional theory of exceptions
- Elementary Probability Theory in the Eindhoven Style
Cited In (5)
- Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
- A functional account of probabilistic programming with possible worlds. Declarative pearl
- Title not available (Why is that?)
- FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
- A trustful monad for axiomatic reasoning with probability and nondeterminism
Uses Software
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)
