S. Abramsky, Abstract interpretation, logical relations and kan extensions, Journal of Logic and Computation, vol.1, issue.1, pp.5-40, 1990.

H. Barendregt, M. Coppo, and M. Dezani-ciancaglini, A filter lambda model and the completeness of type assignment, Journal of Symbolic Logic, vol.48, issue.4, pp.931-940, 1983.

P. Henk and . Barendregt, The Lambda Calculus, Its Syntax and Semantics, 1984.

G. Barthe, B. Grégoire, J. Hsu, and P. Strub, Coupling proofs are probabilistic product programs, Proc. of POPL 2017, pp.161-174, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01649028

A. Bucciarelli, D. Kesner, and D. Ventura, Non-idempotent intersection types for the lambda-calculus, Logic Journal of the IGPL, vol.25, issue.4, pp.431-464, 2017.

M. Coppo and M. Dezani-ciancaglini, A new type assignment for ?-terms. Archiv für mathematische Logik und Grundlagenforschung, vol.19, pp.139-156, 1978.

M. Coppo and M. Dezani-ciancaglini, An extension of the basic functionality theory for the ?-calculus, Notre Dame Journal of Formal Logic, vol.21, issue.4, pp.685-693, 1980.

U. Dal-lago and M. Zorzi, Probabilistic operational semantics for the lambda calculus, RAIRO-Theor. Inf. and Applic, vol.46, issue.3, pp.413-450, 2012.

V. Danos and R. Harmer, Probabilistic game semantics, ACM Trans. Comput. Log, vol.3, issue.3, pp.359-382, 2002.

V. Danos and T. Ehrhard, Probabilistic coherence spaces as a model of higherorder probabilistic computation. Information and Computation, vol.209, pp.966-991, 2011.

C. Daniel-de, Execution time of lambda-terms via denotational semantics and intersection types, 2009.

K. De-leeuw, C. E. Edward-f-moore, N. Shannon, and . Shapiro, Computability by probabilistic machines, Automata studies, vol.34, pp.183-198, 1956.

A. Dudenhefner and J. Rehof, Intersection type calculi of bounded dimension, Proc. of POPL, pp.653-665, 2017.

T. Ehrhard, M. Pagani, and C. Tasson, Probabilistic Coherence Spaces are Fully Abstract for Probabilistic PCF, Proc. of POPL, 2014.

J. Gill, Computational complexity of probabilistic Turing machines, SIAM Journal on Computing, vol.6, issue.4, pp.675-695, 1977.

J. Girard, Linear logic, Theorical Computer Science, vol.50, pp.1-102, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00075966

S. Goldwasser and S. Micali, Probabilistic encryption, Journal of computer and system sciences, vol.28, issue.2, pp.270-299, 1984.

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

J. Goubault-larrecq, Full abstraction for non-deterministic and probabilistic extensions of PCF I: the angelic cases, Journal of Logic and Algebraic Methods in Programming, vol.84, pp.155-184, 2015.

J. Goubault, -. , and D. Varacca, Continuous random variables, Proc. of LICS 2011, pp.97-106, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00629723

C. Heunen, O. Kammar, S. Staton, and H. Yang, A convenient category for higher-order probability theory, Proc. of LICS 2017, pp.1-12, 2017.

J. Hughes, L. Pareto, and A. Sabry, Proving the correctness of reactive systems using sized types, Proc. of POPL, pp.410-423, 1996.

C. Jones and G. D. Plotkin, A probabilistic powerdomain of evaluations, Proc. of LICS 1989, pp.186-195, 1989.

D. Neil, N. Jones, and . Bohr, Call-by-value termination in the untyped lambda-calculus, Logical Methods in Computer Science, vol.4, issue.1, 2008.

L. Benjamin, J. Kaminski, and . Katoen, On the hardness of almost-sure termination, Proc. of MFCS 2015, vol.9234, pp.307-318, 2015.

N. Kobayashi and C. Ong, A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes, Proc. of LICS, pp.179-188, 2009.

J. Krivine, Lambda-calculus, types and models. Ellis Horwood series in computers and their applications, 1993.
URL : https://hal.archives-ouvertes.fr/cel-00574575

U. Dal-lago and C. Grellois, Probabilistic termination by monadic affine sized typing, Proc. of ESOP 2017, vol.10201, pp.393-419, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01635077

U. Dal-lago, D. Sangiorgi, and M. Alberti, On coinductive equivalences for higherorder probabilistic functional programs, Proc. of POPL, pp.297-308, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091573

J. Maraist, M. Odersky, D. N. Turner, and P. Wadler, Call-by-name, callby-value, call-by-need and the linear lambda calculus, Theorical Computer Science, vol.228, issue.12, pp.175-210, 1999.

, Eugenio Moggi. Notions of computation and monads. Information and computation, vol.93, issue.1, pp.55-92, 1991.

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

. Michael-o-rabin, Probabilistic automata, Information and control, vol.6, issue.3, pp.230-245, 1963.

N. Saheb-djahromi, Probabilistic LCF, Proc. of MFCS 1978, vol.64, pp.442-451, 1978.

S. Eugene and . Santos, Probabilistic Turing machines and computability, Proceedings of the American Mathematical Society, vol.22, issue.3, pp.704-710, 1969.

T. Tsukada and N. Kobayashi, An intersection type system for deterministic pushdown automata, Proc. of TCS 2012, pp.357-371, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01556213

D. Varacca and G. Winskel, Distributing probability over non-determinism, Mathematical Structures in Computer Science, vol.16, issue.1, pp.87-113, 2006.