Unifying Theories of Programming with Monads
From MaRDI portal
Publication:3455643
DOI10.1007/978-3-642-35705-3_2zbMath1452.68041OpenAlexW2138575529MaRDI QIDQ3455643
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
Related Items (2)
A functional account of probabilistic programming with possible worlds. Declarative pearl ⋮ A trustful monad for axiomatic reasoning with probability and nondeterminism
Uses Software
Cites Work
- A functional theory of exceptions
- Semantics of probabilistic programs
- Probabilistic models for the guarded command language
- Refinement algebra for probabilistic programs
- Refinement-oriented probability for CSP
- Remarks on Testing Probabilistic Processes
- The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
- Elementary Probability Theory in the Eindhoven Style
- Programs are predicates
- Handlers of Algebraic Effects
- A Couple of Novelties in the Propositional Calculus
- Predicative programming Part I
- Comprehending monads
- Towards Automated Proof Support for Probabilistic Distributed Systems
- Distributing probability over non-determinism
- Every Standard Construction is Induced by a Pair of Adjoint Functors
- FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
This page was built for publication: Unifying Theories of Programming with Monads
