Nominal techniques in Isabelle/HOL C Urban, C Tasson
Automated Deduction–CADE-20: 20th International Conference on Automated …, 2005
154 2005 Probabilistic coherence spaces are fully abstract for probabilistic PCF T Ehrhard, C Tasson, M Pagani
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of …, 2014
105 2014 Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming T Ehrhard, M Pagani, C Tasson
Proceedings of the ACM on Programming Languages 2 (POPL), 1-28, 2017
88 2017 A convenient differential category R Blute, T Ehrhard, C Tasson
arXiv preprint arXiv:1006.3140, 2010
84 2010 Full abstraction for probabilistic PCF T Ehrhard, M Pagani, C Tasson
Journal of the ACM (JACM) 65 (4), 1-44, 2018
59 2018 The computational meaning of probabilistic coherence spaces T Ehrhard, M Pagani, C Tasson
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 87-96, 2011
53 2011 An explicit formula for the free exponential modality of linear logic PA Melliès, N Tabareau, C Tasson
International Colloquium on Automata, Languages, and Programming, 247-260, 2009
53 2009 Probabilistic call by push value T Ehrhard, C Tasson
Logical Methods in Computer Science 15, 2019
44 * 2019 Distributed computability in Byzantine asynchronous systems H Mendes, C Tasson, M Herlihy
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
41 * 2014 Equivalence of algebraic λ-calculi A Díaz-Caro, S Perdrix, C Tasson, B Valiron
Informal proceedings of HOR, 6-11, 2010
41 * 2010 The taylor expansion inverse problem in linear logic M Pagani, C Tasson
Proceedings of the Twenty-Fourth Annual IEEE Symposium on Logic in Computer …, 2009
37 * 2009 Sémantiques et syntaxes vectorielles de la logique linéaire C Tasson
Université Paris-Diderot-Paris VII, 2009
25 2009 The free exponential modality of probabilistic coherence spaces R Crubillé, T Ehrhard, M Pagani, C Tasson
International Conference on Foundations of Software Science and Computation …, 2017
23 2017 Algebraic totality, towards completeness C Tasson
International Conference on Typed Lambda Calculi and Applications, 325-340, 2009
22 2009 An explicit formula for the free exponential modality of linear logic PA Melliès, N Tabareau, C Tasson
Mathematical Structures in Computer Science 28 (7), 1253-1286, 2018
21 2018 Mackey-complete spaces and power series–a topological model of differential linear logic M Kerjean, C Tasson
Mathematical Structures in Computer Science 28 (4), 472-507, 2018
21 2018 Strong Normalizability as a Finiteness Structure via the Taylor Expansion of -terms M Pagani, C Tasson, L Vaux
International Conference on Foundations of Software Science and Computation …, 2016
21 2016 Taylor expansion for call-by-push-value J Chouquet, C Tasson
CSL, 2020
13 2020 Geometric and combinatorial views on asynchronous computability É Goubault, S Mimram, C Tasson
Distributed Computing 31 (4), 289-316, 2018
13 2018 PSPACE-Completeness of a Thread Criterion for Cyclic Proofs in Linear Logic with Least and Greatest Fixed Points R Nollet, A Saurin, C Tasson
TABLEAUX 2019-28th International Conference on Automated Reasoning with …, 2019
12 2019