Christine Tasson

Orcid: 0000-0001-8098-9944

According to our database1, Christine Tasson authored at least 30 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Density-Based Semantics for Reactive Probabilistic Programming.
CoRR, 2023

2020
The linear-non-linear substitution 2-monad.
Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, 2020

Taylor expansion for Call-By-Push-Value.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019
Probabilistic call by push value.
Log. Methods Comput. Sci., 2019

PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

2018
Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming.
Proc. ACM Program. Lang., 2018

Transport of finiteness structures and applications.
Math. Struct. Comput. Sci., 2018

An explicit formula for the free exponential modality of linear logic.
Math. Struct. Comput. Sci., 2018

Mackey-complete spaces and power series - a topological model of differential linear logic.
Math. Struct. Comput. Sci., 2018

Full Abstraction for Probabilistic PCF.
J. ACM, 2018

Geometric and combinatorial views on asynchronous computability.
Distributed Comput., 2018

Local Validity for Circular Proofs in Linear Logic with Fixed Points.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

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

2017
Measurable Cones and Stable, Measurable Functions.
CoRR, 2017

Quantitative Semantics for Probabilistic Programming (Invited Talk).
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

The Free Exponential Modality of Probabilistic Coherence Spaces.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ-terms.
CoRR, 2016

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015
Iterated Chromatic Subdivisions are Collapsible.
Appl. Categorical Struct., 2015

From Geometric Semantics to Asynchronous Computability.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

2014
Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus
Log. Methods Comput. Sci., 2014

Distributed computability in Byzantine asynchronous systems.
Proceedings of the Symposium on Theory of Computing, 2014

Probabilistic coherence spaces are fully abstract for probabilistic PCF.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013
The Topology of Asynchronous Byzantine Colorless Tasks
CoRR, 2013

2011
The Computational Meaning of Probabilistic Coherence Spaces.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
A convenient differential category
CoRR, 2010

2009
SéMantiques et Syntaxes vectorielles de la logique LinéAIRE. (Vectorial Semantics and Syntax of Linear Logic).
PhD thesis, 2009

Algebraic Totality, towards Completeness.
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

The Inverse Taylor Expansion Problem in Linear Logic.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2005
Nominal Techniques in Isabelle/HOL.
Proceedings of the Automated Deduction, 2005


  Loading...