A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation - TLDI '03
As probabilistic computation plays an increasing role in diverse fields in computer science, researchers have designed new languages to facilitate the development of probabilistic programs. In this paper, we develop a probabilistic calculus by extending the traditional lambda calculus. In our calculus, every expression denotes a probability distribution yet evaluates to a regular value. The most notable feature of our calculus is that it is founded upon sampling functions, which map the unitdoi:10.1145/604178.604180 fatcat:nlqb7hxpbjhtfkcmgvdusfycoe