A monad for randomized algorithms
type: Item
instance of: scholarly article
title: A monad for randomized algorithms
zbMATH Open document ID: 1395.68178
author: Tyler Barker
publication date: 2018-04-23T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 18C15
Mathematics Subject Classification ID: 18D15
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6862922
zbMATH Keywords: probabilistic powerdomain
zbMATH Keywords: Cartesian closed category
zbMATH Keywords: random variable
zbMATH Keywords: distributive law
Wikidata QID: Q113317641
MaRDI profile type: Publication
full work available at URL: j.entcs.2016.09.031
OpenAlex ID: W2529631934
cites work: Introduction to Categories and Categorical Logic
cites work: PRIMES is in P
cites work: Q4164569
cites work: Continuous Lattices and Domains
cites work: Computational Complexity of Probabilistic Turing Machines
cites work: Q3997287
cites work: Q4536613
cites work: Discrete random variables over domains
cites work: Anatomy of a Domain of Continuous Random Variables II
cites work: Topology, domain theory and theoretical computer science
cites work: Notions of computation and monads
cites work: Probabilistic algorithm for testing primality
cites work: CPO's of measures for nondeterminism
cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY
cites work: Stochastic \(\lambda\)-calculi: an extended abstract
cites work: A Fast Monte-Carlo Test for Primality
cites work: Q4488202
cites work: Semantic domains for combining probability and non-determinism
cites work: Distributing probability over non-determinism
DOI: 10.1016/J.ENTCS.2016.09.031
description: scientific article; zbMATH DE number 6862922