Nominal techniques in Isabelle/HOL C Urban, C Tasson International Conference on Automated Deduction, 38-53, 2005 | 141 | 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 | 82 | 2014 |

A convenient differential category R Blute, T Ehrhard, C Tasson arXiv preprint arXiv:1006.3140, 2010 | 67 | 2010 |

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 | 51 | 2009 |

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 | 48 | 2011 |

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 | 42 | 2017 |

Equivalence of algebraic λ-calculi A Díaz-Caro, S Perdrix, C Tasson, B Valiron Informal proceedings of HOR, 6-11, 2010 | 37* | 2010 |

The taylor expansion inverse problem in linear logic M Pagani, C Tasson Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science …, 2009 | 36* | 2009 |

Full abstraction for probabilistic PCF T Ehrhard, M Pagani, C Tasson Journal of the ACM (JACM) 65 (4), 1-44, 2018 | 33 | 2018 |

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 | 27* | 2014 |

Algebraic totality, towards completeness C Tasson International Conference on Typed Lambda Calculi and Applications, 325-340, 2009 | 25 | 2009 |

Sémantiques et syntaxes vectorielles de la logique linéaire C Tasson Université Paris-Diderot-Paris VII, 2009 | 24 | 2009 |

Probabilistic call by push value T Ehrhard, C Tasson arXiv preprint arXiv:1607.04690, 2016 | 22 | 2016 |

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 |

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 | 13 | 2017 |

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 | 12 | 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 | 12 | 2018 |

Transport of finiteness structures and applications C Tasson, L Vaux Mathematical Structures in Computer Science 28 (7), 1061-1096, 2018 | 9 | 2018 |

Iterated chromatic subdivisions are collapsible É Goubault, S Mimram, C Tasson Applied Categorical Structures 23 (6), 777-818, 2015 | 9 | 2015 |

Geometric and combinatorial views on asynchronous computability É Goubault, S Mimram, C Tasson Distributed Computing 31 (4), 289-316, 2018 | 8 | 2018 |