Nominal Techniques in Isabelle/HOL. - Christian Urban; Christine Tasson (CADE, 2005)

The Inverse Taylor Expansion Problem in Linear Logic. - Michele Pagani; Christine Tasson (LICS, 2009)

Algebraic Totality, towards Completeness. - Christine Tasson (TLCA, 2009)

SéMantiques et Syntaxes vectorielles de la logique LinéAIRE. (Vectorial Semantics and Syntax of Linear Logic). - Christine Tasson (2009)

A convenient differential category - Richard Blute; Thomas Ehrhard; Christine Tasson (CoRR, 2010)

The Computational Meaning of Probabilistic Coherence Spaces. - Thomas Ehrhard; Michele Pagani; Christine Tasson (LICS, 2011)

The Topology of Asynchronous Byzantine Colorless Tasks - Hammurabi Mendes; Christine Tasson; Maurice Herlihy (CoRR, 2013)

Probabilistic coherence spaces are fully abstract for probabilistic PCF. - Thomas Ehrhard; Christine Tasson; Michele Pagani (POPL, 2014)

Distributed computability in Byzantine asynchronous systems. - Hammurabi Mendes; Christine Tasson; Maurice Herlihy (STOC, 2014)

Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus - Ali Assaf 002; Alejandro Díaz-Caro; Simon Perdrix; Christine Tasson; Benoît Valiron (Log. Methods Comput. Sci., 2014)

From Geometric Semantics to Asynchronous Computability. - Eric Goubault; Samuel Mimram; Christine Tasson (DISC, 2015)

Iterated Chromatic Subdivisions are Collapsible. - Eric Goubault; Samuel Mimram; Christine Tasson (Appl. Categorical Struct., 2015)

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda λ -terms. - Michele Pagani; Christine Tasson; Lionel Vaux (FoSSaCS, 2016)

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ-terms. - Michele Pagani; Christine Tasson; Lionel Vaux (CoRR, 2016)

The Free Exponential Modality of Probabilistic Coherence Spaces. - Raphaëlle Crubillé; Thomas Ehrhard; Michele Pagani; Christine Tasson (FoSSaCS, 2017)

Quantitative Semantics for Probabilistic Programming (Invited Talk). - Christine Tasson (FSCD, 2017)

Measurable Cones and Stable, Measurable Functions. - Thomas Ehrhard; Michele Pagani; Christine Tasson (CoRR, 2017)

Models of Distributed, Differential and Probabilistic Computation. (Sémantiques des calculs distribués, différentiels et probabilistes). - Christine Tasson (2018)

Local Validity for Circular Proofs in Linear Logic with Fixed Points. - Rémi Nollet; Alexis Saurin; Christine Tasson (CSL, 2018)

Geometric and combinatorial views on asynchronous computability. - Éric Goubault; Samuel Mimram; Christine Tasson (Distributed Comput., 2018)

Full Abstraction for Probabilistic PCF. - Thomas Ehrhard; Michele Pagani; Christine Tasson (J. ACM, 2018)

Mackey-complete spaces and power series - a topological model of differential linear logic. - Marie Kerjean; Christine Tasson (Math. Struct. Comput. Sci., 2018)

An explicit formula for the free exponential modality of linear logic. - Paul-André Melliès; Nicolas Tabareau; Christine Tasson (Math. Struct. Comput. Sci., 2018)

Transport of finiteness structures and applications. - Christine Tasson; Lionel Vaux (Math. Struct. Comput. Sci., 2018)

Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming. - Thomas Ehrhard; Michele Pagani; Christine Tasson (Proc. ACM Program. Lang., 2018)

PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points. - Rémi Nollet; Alexis Saurin; Christine Tasson (TABLEAUX, 2019)

Probabilistic call by push value. - Thomas Ehrhard; Christine Tasson (Log. Methods Comput. Sci., 2019)

Taylor expansion for Call-By-Push-Value. - Jules Chouquet; Christine Tasson (CSL, 2020)

The linear-non-linear substitution 2-monad. - Martin Hyland; Christine Tasson (ACT, 2020)

Density-Based Semantics for Reactive Probabilistic Programming. - Guillaume Baudart; Louis Mandel; Christine Tasson (CoRR, 2023)

GRust: A Programming Language for Automotive Engineering. - Émilie Thomé; Xavier Denis; Christine Tasson (FMICS, 2025)