S. Abramsky, The Lazy ?-Calculus, Research Topics in Functional Programming, pp.65-117, 1990.

A. Asperti and L. Roversi, Intuitionistic Light Affine Logic, ACM Transactions on Computational Logic, vol.3, issue.1, pp.137-175, 2002.
DOI : 10.1145/504077.504081

A. Bizjak and L. Birkedal, Step-Indexed Logical Relations for Probability, FoSSaCS, pp.279-294, 2015.
DOI : 10.1007/978-3-662-46678-0_18

R. Crubillé and U. Dal-lago, On Probabilistic Applicative Bisimulation and Call-by-Value ??-Calculi, ESOP, pp.209-228, 2014.
DOI : 10.1007/978-3-642-54833-8_12

R. Crubillé and U. Dal-lago, Metric reasoning about ?-terms: the affine case (long version) Available at http://arxiv, 2015.

U. Dal-lago, D. Sangiorgi, and M. Alberti, On coinductive equivalences for higher-order probabilistic functional programs, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.297-308, 2014.
DOI : 10.1145/2535838.2535872
URL : https://hal.archives-ouvertes.fr/hal-01091573

V. Danos and T. Ehrhard, Probabilistic coherence spaces as a model of higher-order probabilistic computation, Information and Computation, vol.209, issue.6, pp.966-991, 2011.
DOI : 10.1016/j.ic.2011.02.001
URL : https://hal.archives-ouvertes.fr/hal-00640435

Y. Deng and Y. Zhang, Program equivalence in linear contexts, Theoretical Computer Science, vol.585, 2014.
DOI : 10.1016/j.tcs.2015.03.006

J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden, Metrics for Labeled Markov Systems, In CONCUR, 1999.
DOI : 10.1007/3-540-48320-9_19

J. Desharnais, R. Jagadeesan, V. Gupta, and P. Panangaden, The metric analogue of weak bisimulation for probabilistic processes, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.413-422, 2002.
DOI : 10.1109/LICS.2002.1029849

T. Ehrhard, C. Tasson, and M. Pagani, Probabilistic coherence spaces are fully abstract for probabilistic PCF, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.309-320, 2014.
DOI : 10.1145/2535838.2535865

D. Gebler and S. Tini, Fixed-point Characterization of Compositionality Properties of Probabilistic Processes Combinators, EXPRESS-SOS, pp.63-78, 2014.
DOI : 10.4204/EPTCS.160.7

O. Goldreich, Modern Cryptography, Probabilistic Proofs and Pseudorandomness, Algorithms and Combinatorics, vol.17, 1998.
DOI : 10.1007/978-3-662-12521-2

S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer and System Sciences, vol.28, issue.2, pp.270-299, 1984.
DOI : 10.1016/0022-0000(84)90070-9

N. D. Goodman, V. K. Mansinghka, D. M. Roy, K. Bonawitz, and J. B. Tenenbaum, Church: a language for generative models, UAI 2008, pp.220-229, 2008.

D. J. Howe, Proving Congruence of Bisimulation in Functional Programming Languages, Information and Computation, vol.124, issue.2, pp.103-112, 1996.
DOI : 10.1006/inco.1996.0008

C. Jones and G. D. Plotkin, A probabilistic powerdomain of evaluations, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.186-195, 1989.
DOI : 10.1109/LICS.1989.39173

L. V. Kantorovich, On the transfer of masses, In Dokl. Akad. Nauk. SSSR, vol.37, pp.227-229, 1942.

S. B. Lassen, Relational Reasoning about Contexts, Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, pp.91-135, 1998.
DOI : 10.7146/brics.v4i24.18950
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.5332

H. G. Mairson, FUNCTIONAL PEARL Linear lambda calculus and PTIME-completeness, Journal of Functional Programming, vol.14, issue.6, pp.623-633, 2004.
DOI : 10.1017/S0956796804005131

C. D. Manning and H. Schütze, Foundations of statistical natural language processing, 1999.

J. C. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague, A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, Theoretical Computer Science, vol.353, issue.1-3, pp.1-3118, 2006.
DOI : 10.1016/j.tcs.2005.10.044

S. Park, F. Pfenning, and S. Thrun, A probabilistic language based on sampling functions, ACM Transactions on Programming Languages and Systems, vol.31, issue.1, 2008.
DOI : 10.1145/1452044.1452048

J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference, 1988.

A. M. Pitts, Operationally-Based Theories of Program Equivalence, Semantics and Logics of Computation, pp.241-298, 1997.
DOI : 10.1017/CBO9780511526619.007

N. Ramsey and A. Pfeffer, Stochastic lambda calculus and monads of probability distributions, POPL, pp.154-165, 2002.

S. Thrun, Robotic mapping: A survey Exploring artificial intelligence in the new millennium, pp.1-35, 2002.

F. Van-breugel and J. Worrell, A behavioural pseudometric for probabilistic transition systems, Theoretical Computer Science, vol.331, issue.1, pp.115-142, 2005.
DOI : 10.1016/j.tcs.2004.09.035

P. Wadler, A syntax for linear logic, MFPS, pp.513-529, 1993.
DOI : 10.1007/3-540-58027-1_24