We give a geometry of interaction model for a typed lambda-calculus with operators for sampling and soft conditioning. The calculus can as such be seen as a paradigmatic calculus for higher-order bayesian programming languages, like ANGLICAN or CHURCH. We present the model in two flavors, the former corresponding to an idealized, thus not executable, learning algorithm, the latter allowing to see the learning algorithm as part of the of the environment.