Foundations of statistical natural language processing, 2001. ,
Probabilistic reasoning in intelligent systems -networks of plausible inference. Morgan Kaufmann series in representation and reasoning, 1989. ,
Robotic mapping: A survey, In: Exploring Artificial Intelligence in the New Millenium, 2002. ,
Computability by Probabilistic Machines, Automata Studies, vol.34, pp.183-212, 1956. ,
DOI : 10.1515/9781400882618-010
Randomized Algorithms, 1995. ,
Formal certification of code-based cryptographic proofs, pp.90-101, 2009. ,
DOI : 10.1145/1480881.1480894
URL : http://www-sop.inria.fr/everest/personnel/Benjamin.Gregoire/Publi/popl09.pdf
Computer-Aided Security Proofs for the Working Cryptographer, LNCS, vol.6841, pp.71-90, 2011. ,
DOI : 10.1007/978-3-642-22792-9_5
URL : https://hal.archives-ouvertes.fr/hal-01112075
Church: a language for generative models, pp.220-229, 2008. ,
Probabilistic Rewrite Strategies. Applications to ELAN, LNCS, vol.2378, pp.252-266, 2002. ,
DOI : 10.1007/3-540-45610-4_18
URL : https://hal.archives-ouvertes.fr/inria-00100883
Proving Termination of Probabilistic Programs Using Patterns, CAV 2012, pp.123-138, 2012. ,
DOI : 10.1007/978-3-642-31424-7_14
Probabilistic termination: Soundness, completeness, and compositionality, pp.489-501, 2015. ,
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs, pp.327-342, 2016. ,
Termination Analysis of Probabilistic Programs Through Positivstellensatz???s, LNCS, vol.4, issue.1, pp.3-22, 2016. ,
DOI : 10.1007/s11704-009-0074-7
Proving the correctness of reactive systems using sized types, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.410-423, 1996. ,
DOI : 10.1145/237721.240882
A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion, CSL '97, pp.275-294, 1997. ,
DOI : 10.1007/BFb0028020
Proofs and Types, 1989. ,
Realizability models and implicit complexity, Theoretical Computer Science, vol.412, issue.20, pp.2029-2047, 2011. ,
DOI : 10.1016/j.tcs.2010.12.025
Probabilistic termination by monadic affine sized typing (long version). https://arxiv.org/abs, p.4089, 1701. ,
Type-based termination of recursive definitions, Mathematical Structures in Computer Science, vol.14, issue.1, pp.97-141, 2004. ,
DOI : 10.1017/S0960129503004122
A Tutorial on Type-Based Termination, LNCS, vol.15, issue.1, pp.100-152, 2008. ,
DOI : 10.1023/A:1019916231463
URL : http://www-sop.inria.fr/members/Benjamin.Gregoire/Publi/lernet08.pdf
Type-Based Termination with Sized Products, LNCS, vol.5213, pp.493-507, 2008. ,
DOI : 10.1007/978-3-540-87531-4_35
URL : http://perso.ens-lyon.fr/colin.riba/papers/exprod.pdf
Termination checking with types, RAIRO - Theoretical Informatics and Applications, vol.45, issue.4, pp.277-319, 2004. ,
DOI : 10.1093/comjnl/45.4.436
Dependent types for program termination verification, Higher-Order and Symbolic Computation, pp.91-131, 2002. ,
Analysis of a guard condition in type theory, FoSSaCS'98, pp.48-62, 1998. ,
DOI : 10.1007/BFb0053541
URL : https://hal.archives-ouvertes.fr/inria-00073388
Proving Positive Almost-Sure Termination, LNCS, vol.3467, pp.323-337, 2005. ,
DOI : 10.1007/978-3-540-32033-3_24
URL : https://hal.archives-ouvertes.fr/inria-00000522
Probabilistic Program Analysis with Martingales, CAV 2013, pp.511-526, 2013. ,
DOI : 10.1007/978-3-642-39799-8_34
URL : http://pl.cs.colorado.edu/papers/martingales-cav13.pdf
On Equivalences, Metrics, and Polynomial Time, LNCS, vol.9210, pp.311-323, 2015. ,
DOI : 10.1007/978-3-319-22177-9_24
URL : https://hal.archives-ouvertes.fr/hal-01231790
A higher-order characterization of probabilistic polynomial time, Information and Computation, vol.241, pp.114-141, 2015. ,
DOI : 10.1016/j.ic.2014.10.009
URL : https://hal.archives-ouvertes.fr/hal-01231752
A short introduction to implicit computational complexity, pp.89-109, 2011. ,
Probabilistic operational semantics for the lambda calculus . RAIRO -Theor, Inf. and Applic, vol.46, issue.3, pp.413-450, 2012. ,
DOI : 10.1051/ita/2012012
URL : https://hal.archives-ouvertes.fr/hal-00909373
One-Counter Markov Decision Processes, 21st ACM-SIAM Symposium on Discrete Algorithms, 2010. ,
DOI : 10.1137/1.9781611973075.70
The geometry of linear higher-order recursion, LICS 2005, pp.366-375, 2005. ,
DOI : 10.1145/1462179.1462180
Reasoning about programs in continuation-passing style, Lisp and Symbolic Computation, vol.6, pp.3-4, 1993. ,
DOI : 10.1007/bf01019462
URL : http://www.cs.indiana.edu/~sabry/papers/reasoning-lasc.ps
Linear dependent types and relative completeness, LICS 2011, pp.133-142, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00906347