Foundations of statistical natural language processing, 2001. ,
Probabilistic reasoning in intelligent systems -networks of plausible inference, ser. Morgan Kaufmann series in representation and reasoning, 1989. ,
Exploring artificial intelligence in the new millennium, vol.1, p.1, 2002. ,
Computability by probabilistic machines, Automata Studies, vol.34, pp.183-198, 1956. ,
, Randomized algorithms, 1995.
Formal certification of code-based cryptographic proofs, Proc. of 36 th POPL, pp.90-101, 2009. ,
Computeraided security proofs for the working cryptographer, Proc. of 31 st CRYPTO, ser. LNCS, vol.6841, pp.71-90, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-01112075
Church: A language for generative models, Proc. of 24 th UAI, pp.220-229, 2008. ,
Probabilistic programming in Anglican, Machine Learning and Knowledge Discovery in Databases, ser. LNCS, vol.9286, pp.308-311, 2015. ,
Probabilistic algorithm for testing primality, Journal of Number Theory, vol.12, issue.1, pp.128-138, 1980. ,
, Annals of Mathematics, vol.160, issue.2, pp.781-793, 2004.
Stochastic invariants for probabilistic termination, Proc. of 44 th POPL, pp.145-160, 2017. ,
Weakest precondition reasoning for expected run-times of probabilistic programs, Proc. of 25 th ESOP, ser. LNCS, vol.9632, pp.364-389, 2016. ,
Static determination of quantitative resource usage for higher-order programs, Proc. of 37 th POPL, pp.223-236, 2010. ,
On probabilistic term rewriting, Proc. of 14 th FLOPS, ser. LNCS, vol.10818, pp.132-148, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01926502
Type-based amortised heap-space analysis, Proc. of 15 th ESOP, ser. LNCS, vol.3924, pp.22-37, 2006. ,
Linear dependent types and relative completeness, LMCS, vol.8, issue.4, pp.1-44, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00906347
Probabilistic termination by monadic affine sized typing, Proc. of 26 th ESOP, ser. LNCS, vol.10201, pp.393-419, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01635077
On intersection types and probabilistic lambda calculi, Proc. of 20 th PPDP, vol.8, pp.1-8, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01926420
, Fifty challenging problems in probability with solutions. Courier Corporation, 1987.
Probability and computing: Randomized algorithms and probabilistic analysis, 2005. ,
Proving the correctness of reactive systems using sized types, Proc. of 23 rd POPL, pp.410-423, 1996. ,
A filter lambda model and the completeness of type assignment, The Journal of Symbolic Logic, vol.48, issue.4, pp.931-940, 1983. ,
Execution time of lambda-terms via denotational semantics and intersection types, Mathematical Structures in Computer Science, vol.28, issue.7, pp.1169-1203, 2018. ,
URL : https://hal.archives-ouvertes.fr/inria-00319822
A higher-order characterization of probabilistic polynomial time, Revised Selected Papers of 2 nd FOPARA, ser. LNCS, vol.7177, pp.1-18, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00909376
Probabilistic Rewrite Strategies. Applications to ELAN, Proc. of 13 th RTA, ser. LNCS, vol.2378, pp.252-266, 2002. ,
URL : https://hal.archives-ouvertes.fr/inria-00100883
Proving termination of probabilistic programs using patterns, Proc. of 24 th CAV, ser. LNCS, vol.7358, pp.123-138, 2012. ,
Probabilistic termination: Soundness, completeness, and compositionality, Proc. of 42 nd POPL, pp.489-501, 2015. ,
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs, Proc. of 43 rd POPL, pp.327-342, 2016. ,
Termination analysis of probabilistic programs through Positivstellensatz's, Proc. of 28 th CAV, ser. LNCS, vol.9779, pp.3-22, 2016. ,
Automated recurrence analysis for almost-linear expected-runtime bounds, Proc. of 29 th CAV, ser. LNCS, vol.10426, pp.118-139, 2017. ,
Bounded expectations: Resource analysis for probabilistic programs, Proc. of 39 th PLDI, pp.496-512, 2018. ,
Refinement types for ML, Proc. of 12 th PLDI, pp.268-277, 1991. ,
Higher-order approximate relational refinement types for mechanism design and differential privacy, Proc. of 42 nd POPL, vol.50, pp.55-68, 2015. ,
Quicksort, The Computer Journal, vol.5, issue.1, pp.10-16, 1962. ,
Lectures on the Coupling Method, ser, 2002. ,
Probabilistic Program Analysis with Martingales, Proc. of 25 th CAV, ser. LNCS, vol.8044, pp.511-526, 2013. ,
LCF Considered as a Programming Language, TCS, vol.5, issue.3, pp.223-255, 1977. ,
Reasoning about programs in continuationpassing style, Lisp and symbolic computation, vol.6, pp.289-360, 1993. ,
Type-Based Complexity Analysis of Probabilistic Functional Programs, Tech. Rep, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02103943
Coupling proofs are probabilistic product programs, Proc. of 44 th POPL, pp.161-174, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01649028