A monad for randomized algorithms
From MaRDI portal
Publication:1744376
DOI10.1016/j.entcs.2016.09.031zbMath1395.68178OpenAlexW2529631934WikidataQ113317641 ScholiaQ113317641MaRDI QIDQ1744376
Publication date: 23 April 2018
Full work available at URL: https://doi.org/10.1016/j.entcs.2016.09.031
Semantics in the theory of computing (68Q55) Randomized algorithms (68W20) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantic domains for combining probability and non-determinism
- Notions of computation and monads
- Probabilistic algorithm for testing primality
- CPO's of measures for nondeterminism
- Topology, domain theory and theoretical computer science
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- PRIMES is in P
- Stochastic \(\lambda\)-calculi: an extended abstract
- Discrete random variables over domains
- Introduction to Categories and Categorical Logic
- A Fast Monte-Carlo Test for Primality
- Computational Complexity of Probabilistic Turing Machines
- Continuous Lattices and Domains
- Anatomy of a Domain of Continuous Random Variables II
- Distributing probability over non-determinism
This page was built for publication: A monad for randomized algorithms
