Abstract
This talk is a preliminary report about on-going joint work with Radu Mardare and Prakash Panangaden. In 2013 Scott realized that it was easy to add random variables to a topological model for the type-free lambda calculus. That suggested it would be possible to give a denotational semantics to a probabilistic programming language. Two problems are being worked on: (1) How can access to random oracles be controlled? (2) How can typing information be added to the semantics? Progress on both questions will be outlined.