P. Henk and . Barendregt, The Lambda Calculus, Its Syntax and Semantics. Studies in logic and the foundations of mathematics, 1981.

O. Bournez and F. Garnier, Proving Positive Almost-Sure Termination, Proc. of RTA, pp.323-337, 2005.
DOI : 10.1007/978-3-540-32033-3_24
URL : https://hal.archives-ouvertes.fr/inria-00000522

F. Breuvart, U. D. Lago, and A. Herrou, On probabilistic subrecursion (long version) Available at http://arxiv.org/abs, 1701.
DOI : 10.1007/978-3-662-54458-7_22

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

U. Dal, L. , and P. Parisen-toldin, A higher-order characterization of probabilistic polynomial time, Inf. Comput, vol.241, pp.114-141, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01231752

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

U. Dal-lago, S. Zuppiroli, and M. Gabbrielli, Probabilistic recursion theory and implicit computational complexity, Sci. Ann. Comp. Sci, vol.24, issue.2, pp.177-216, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091595

K. De-leeuw, E. F. Moore, C. E. Shannon, and N. Shapiro, Computability by Probabilistic Machines, Automata studies, vol.34, pp.183-198, 1956.
DOI : 10.1515/9781400882618-010

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

L. María, F. Fioriti, and H. Hermanns, Probabilistic termination: Soundness , completeness, and compositionality, Proc. of POPL, pp.489-501, 2015.

J. Gill, Computational Complexity of Probabilistic Turing Machines, SIAM Journal on Computing, vol.6, issue.4, pp.675-695, 1977.
DOI : 10.1137/0206049

J. Girard, P. Taylor, and Y. Lafont, Proofs and Types, 1989.

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

A. Jung and R. Tix, The Troublesome Probabilistic Powerdomain, Electronic Notes in Theoretical Computer Science, vol.13, pp.70-91, 1998.
DOI : 10.1016/S1571-0661(05)80216-6
URL : https://doi.org/10.1016/s1571-0661(05)80216-6

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

D. Kozen, Semantics of probabilistic programs, Journal of Computer and System Sciences, vol.22, issue.3, pp.328-350, 1981.
DOI : 10.1016/0022-0000(81)90036-2
URL : https://doi.org/10.1016/0022-0000(81)90036-2

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

A. Mciver and C. Morgan, Abstraction, Refinement and Proof for Probabilistic Systems, Monographs in Computer Science, 2005.

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

J. D. Simon and . Prince, Computer Vision: Models, Learning, and Inference

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

M. Heine-sørensen and P. Urzyczyn, Lectures on the Curry-Howard Isomorphism, 2006.

R. Statman, The typed ??-calculus is not elementary recursive, Theoretical Computer Science, vol.9, issue.1, pp.73-81, 1979.
DOI : 10.1016/0304-3975(79)90007-0

S. Staton, H. Yang, C. Heunen, O. Kammar, and F. Wood, Semantics for probabilistic programming, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.525-534, 2016.
DOI : 10.1007/978-3-642-85473-6