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

J. Pearl, Probabilistic reasoning in intelligent systems -networks of plausible inference. Morgan Kaufmann series in representation and reasoning, 1989.

S. Thrun, Robotic mapping: A survey, Exploring Artificial Intelligence in the New Millenium, 2002.

K. De-leeuw, E. F. Moore, C. E. Shannon, and N. Shapiro, Computability by probabilistic machines, Automata Studies, vol.34, pp.183-212, 1956.

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

G. Barthe, B. Grégoire, and S. Z. Béguelin, Formal certification of code-based cryptographic proofs, POPL 2009, pp.90-101, 2009.

G. Barthe, B. Grégoire, S. Heraud, and S. Z. Béguelin, Computer-aided security proofs for the working cryptographer, CRYPTO 2011, vol.6841, pp.71-90, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01112075

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.

O. Bournez and C. Kirchner, Probabilistic rewrite strategies. applications to ELAN, RTA 2002, vol.2378, pp.252-266, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00100883

J. Esparza, A. Gaiser, and S. Kiefer, Proving termination of probabilistic programs using patterns, CAV 2012, vol.7358, pp.123-138, 2012.

L. M. Fioriti and H. Hermanns, Probabilistic termination: Soundness, completeness, and compositionality, POPL 2015, pp.489-501, 2015.

K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs, POPL 2016, pp.327-342, 2016.

K. Chatterjee, H. Fu, and A. K. Goharshady, Termination analysis of probabilistic programs through positivstellensatz's, CAV 2016, vol.9779, pp.3-22, 2016.

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

M. Hofmann, A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion, CSL '97, vol.1414, pp.275-294, 1997.

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

U. Dal-lago and M. Hofmann, Realizability models and implicit complexity, Theor. Comput. Sci, vol.412, issue.20, pp.2029-2047, 2011.

G. Barthe, M. J. Frade, E. Giménez, L. Pinto, and T. Uustalu, Type-based termination of recursive definitions, MSCS, vol.14, issue.1, pp.97-141, 2004.

G. Barthe, B. Grégoire, and C. Riba, A tutorial on type-based termination, ALFA Summer School, vol.5520, pp.100-152, 2008.

G. Barthe, B. Grégoire, and C. Riba, Type-based termination with sized products, CSL 2008, vol.5213, pp.493-507, 2008.

A. Abel, Termination checking with types, ITA, vol.38, issue.4, pp.277-319, 2004.

H. Xi, Dependent types for program termination verification, Higher-Order and Symbolic Computation, vol.15, issue.1, pp.91-131, 2002.

R. M. Amadio and S. Coupet-grimal, Analysis of a guard condition in type theory, FoSSaCS'98, vol.1378, pp.48-62, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00073388

O. Bournez and F. Garnier, Proving positive almost-sure termination, RTA 2005, vol.3467, pp.323-337, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00099867

A. Chakarov and S. Sankaranarayanan, Probabilistic program analysis with martingales, CAV 2013, vol.8044, pp.511-526, 2013.

A. Cappai and U. Dal-lago, On equivalences, metrics, and polynomial time, FCT 2015, vol.9210, pp.311-323, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01231790

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

T. Brázdil, V. Bro?ek, K. Etessami, A. Ku?era, and D. Wojtczak, One-counter markov decision processes, 21st ACM-SIAM Symposium on Discrete Algorithms

U. Dal-lago, The geometry of linear higher-order recursion, LICS 2005, pp.366-375, 2005.

A. Sabry and M. Felleisen, Reasoning about programs in continuation-passing style, Lisp and Symbolic Computation, vol.6, issue.3-4, pp.289-360, 1993.

A. Schrijver, Theory of Linear and Integer Programming, 1986.

U. Dal-lago and C. Grellois, Probabilistic termination by monadic affine sized typing, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01635077

U. Dal-lago and M. Gaboardi, Linear dependent types and relative completeness, LICS 2011, pp.133-142, 2011.