A monad for randomized algorithms

DOI10.1016/J.ENTCS.2016.09.031MaRDI QIDQ1744376zbMATH OpenOpenAlexWikidataFDO

Authors Tyler Barker

Publication date 23 April 2018

Full work available at URL https://doi.org/10.1016/j.entcs.2016.09.031

zbMATH Keywords

Cartesian closed categorydistributive lawprobabilistic powerdomainrandom variable

Mathematics Subject Classification ID

Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Semantics in the theory of computing (68Q55) Randomized algorithms (68W20)

Recommendations

• Anatomy of a domain of continuous random variables. II
• Automata, Languages and Programming
• Discrete random variables over domains, revisited
• Discrete random variables over domains
• Monoids over domains

Cites work

• A Fast Monte-Carlo Test for Primality
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Anatomy of a domain of continuous random variables. II
• Computational Complexity of Probabilistic Turing Machines
• Continuous Lattices and Domains
• CPO's of measures for nondeterminism
• Discrete random variables over domains
• Distributing probability over non-determinism
• scientific article; zbMATH DE number 48416 (Why is no real title available?)
• scientific article; zbMATH DE number 3597592 (Why is no real title available?)
• scientific article; zbMATH DE number 1469900 (Why is no real title available?)
• scientific article; zbMATH DE number 1759622 (Why is no real title available?)
• Introduction to categories and categorical logic
• Notions of computation and monads
• PRIMES is in P
• Probabilistic algorithm for testing primality
• Semantic domains for combining probability and non-determinism
• Stochastic \(\lambda\)-calculi: an extended abstract
• Topology, domain theory and theoretical computer science

Cited in

(10)

• A mathematical theory of randomized computation. I
• Discrete random variables over domains, revisited
• Probabilistic call by push value
• Characterizations of semantic domains for randomized algorithms
• Anatomy of a domain of continuous random variables. II
• A monad for probabilistic point processes
• A trustful monad for axiomatic reasoning with probability and nondeterminism
• Monoids over domains
• Automata, Languages and Programming
• A Cartesian closed category for random variables

This page was built for publication: A monad for randomized algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744376)