Thomas Ehrhard

Orcid: 0000-0001-5231-5504

According to our database1, Thomas Ehrhard authored at least 75 papers between 1987 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
From Differential Linear Logic to Coherent Differentiation.
CoRR, 2024

2023
Coherent differentiation.
Math. Struct. Comput. Sci., 2023

A coherent differential PCF.
Log. Methods Comput. Sci., 2023

Coherent Taylor expansion as a bimonad.
CoRR, 2023

Cartesian Coherent Differential Categories.
LICS, 2023

The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022
Differentials and distances in probabilistic coherence spaces.
Log. Methods Comput. Sci., 2022

Integration in Cones.
CoRR, 2022

2021
Categorical models of Linear Logic with fixed points of formulas.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020
A calculus of branching processes.
Theor. Comput. Sci., 2020

Upper approximating probabilities of convergence in probabilistic coherence spaces.
CoRR, 2020

Differentials and distances in probabilistic coherence spaces (extended version).
CoRR, 2020

On the linear structure of cones.
CoRR, 2020

Cones as a model of intuitionistic linear logic.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Non-idempotent Intersection Types in Logical Form.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

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

A fully abstract semantics for value-passing CCS for trees.
Frontiers Comput. Sci., 2019

On the denotational semantics of Linear Logic with least and greatest fixed points of formulas.
CoRR, 2019

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

An introduction to differential linear logic: proof-nets, models and antiderivatives.
Math. Struct. Comput. Sci., 2018

Full Abstraction for Probabilistic PCF.
J. ACM, 2018

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

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

Incremental Update for Graph Rewriting.
Proceedings of the Programming Languages and Systems, 2017

2016
The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value.
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016

Call-By-Push-Value from a Linear Logic Point of View.
Proceedings of the Programming Languages and Systems, 2016

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

A new correctness criterion for MLL proof nets.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
CCS for Trees.
CoRR, 2013

2012
The Scott model of linear logic is the extensional collapse of its relational model.
Theor. Comput. Sci., 2012

The stack calculus
Proceedings of the Proceedings Seventh Workshop on Logical and Semantic Frameworks, 2012

Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
Log. Methods Comput. Sci., 2012

A relational semantics for parallelism and non-determinism in a functional setting.
Ann. Pure Appl. Log., 2012

Collapsing non-idempotent intersection types.
Proceedings of the Computer Science Logic (CSL'12), 2012

2011
Probabilistic coherence spaces as a model of higher-order probabilistic computation.
Inf. Comput., 2011

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

Resource Lambda-Calculus: the Differential Viewpoint.
Proceedings of the Computer Science Logic, 2011

Full Abstraction for Resource Calculus with Tests.
Proceedings of the Computer Science Logic, 2011

2010
Interpreting a finitary pi-calculus in differential interaction nets.
Inf. Comput., 2010

Categorical Models for Simply Typed Resource Calculi.
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

Acyclic Solos and Differential Interaction Nets
Log. Methods Comput. Sci., 2010

A convenient differential category
CoRR, 2010

Resource Combinatory Algebras.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

A Finiteness Structure on Resource Terms.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Exponentials with Infinite Multiplicities.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
On Linear Information Systems
Proceedings of the Proceedings First International Workshop on Linearity, 2009

A Relational Model of a Parallel and Non-deterministic lambda-Calculus.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2008
Uniformity and the Taylor expansion of ordinary lambda-terms.
Theor. Comput. Sci., 2008

Differential Linear Logic and Processes.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007
Not Enough Points Is Enough.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Finiteness spaces.
Math. Struct. Comput. Sci., 2005

2004
A completeness theorem for symmetric product phase spaces.
J. Symb. Log., 2004

Differential Interaction Nets.
Proceedings of the 11th Workshop on Logic, Language, Information and Computation, 2004

2003
The differential lambda-calculus.
Theor. Comput. Sci., 2003

2002
On Köthe Sequence Spaces and Linear Logic.
Math. Struct. Comput. Sci., 2002

2001
On phase semantics and denotational semantics: the exponentials.
Ann. Pure Appl. Log., 2001

2000
Parallel and serial hypercoherences.
Theor. Comput. Sci., 2000

On Phase Semantics and Denotational Semantics in Multiplicative-Additive Linear Logic.
Ann. Pure Appl. Log., 2000

1999
Quantitative Semantics Revisited.
Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

1998
Foreword.
Math. Struct. Comput. Sci., 1998

A relative PCF-definability result for strongly stable functions and some corollaries.
Proceedings of the Workshop on Domains IV 1998, 1998

1997
Believe it or not, AJM's Games Model is a Model of Classical Linear Logic.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

Timeless Games.
Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996
Projecting Sequential Algorithms on Strongly Stable Functions.
Ann. Pure Appl. Log., 1996

1994
Sequentiality in an Extensional Framework
Inf. Comput., May, 1994

On Strong Stability and Higher-Order Sequentiality
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1993
A Theory of Sequentiality.
Theor. Comput. Sci., 1993

Hypercoherences: A Strongly Stable Model of Linear Logic.
Math. Struct. Comput. Sci., 1993

1991
Sequentiality and Strong Stability
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Extensional Embedding of a Strongly Stable Model of PCF.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Stone Duality for Stable Functions.
Proceedings of the Category Theory and Computer Science, 1991

1989
Dictoses.
Proceedings of the Category Theory and Computer Science, 1989

1988
A Categorical Semantics of Constructions
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987
An Equational Presentation of Higher Order Logic.
Proceedings of the Category Theory and Computer Science, 1987


  Loading...