A probabilistic language based upon sampling functions
Open Access
- 12 January 2005
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 40 (1) , 171-182
Abstract
As probabilistic computations play an increasing role in solving various problems, researchers have designed probabilistic languages that treat probability distributions as primitive datatypes. Most probabilistic languages, however, focus only on discrete distributions and have limited expressive power. In this paper, we present a probabilistic language, called λο, which uniformly supports all kinds of probability distributions -- discrete distributions, continuous distributions, and even those belonging to neither group. Its mathematical basis is sampling functions, i.e. , mappings from the unit interval (0.0,1.0] to probability domains.We also briefly describe the implementation of λο as an extension of Objective CAML and demonstrate its practicality with three applications in robotics: robot localization, people tracking, and robotic mapping. All experiments have been carried out with real robots.Keywords
This publication has 15 references indexed in Scilit:
- A calculus for probabilistic languages2003
- Roll: A Language for Specifying Die-RollsLecture Notes in Computer Science, 2002
- Stochastic lambda calculus and monads of probability distributions2002
- A judgmental reconstruction of modal logicMathematical Structures in Computer Science, 2001
- Stochastic processes as concurrent constraint programs1999
- Introduction to Monte Carlo Methods1998
- Notions of computation and monadsInformation and Computation, 1991
- Propagating Uncertainty in Bayesian Networks by Probabilistic Logic Sampling1988
- Semantics of probabilistic programsJournal of Computer and System Sciences, 1981
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977