default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Ehrhard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j31]Thomas Ehrhard, Guillaume Geoffroy:
Integration in Cones. Log. Methods Comput. Sci. 21(1) (2025)- [i23]Thomas Ehrhard, Claudia Faggian, Michele Pagani:
Variable Elimination as Rewriting in a Linear Lambda Calculus. CoRR abs/2501.15439 (2025) - 2024
- [i22]Thomas Ehrhard:
From Differential Linear Logic to Coherent Differentiation. CoRR abs/2401.14834 (2024) - [i21]Thomas Ehrhard, Claudia Faggian, Michele Pagani:
Bayesian Networks and Proof-Nets: a proof-theoretical account of Bayesian Inference. CoRR abs/2412.20540 (2024) - 2023
- [j30]Thomas Ehrhard:
A coherent differential PCF. Log. Methods Comput. Sci. 19(4) (2023) - [j29]Thomas Ehrhard
:
Coherent differentiation. Math. Struct. Comput. Sci. 33(4-5): 259-310 (2023) - [c39]Thomas Ehrhard, Claudia Faggian, Michele Pagani:
The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic. FSCD 2023: 8:1-8:18 - [c38]Thomas Ehrhard, Aymeric Walch:
Cartesian Coherent Differential Categories. LICS 2023: 1-13 - [i20]Thomas Ehrhard, Aymeric Walch:
Cartesian Coherent Differential Categories. CoRR abs/2303.06952 (2023) - [i19]Thomas Ehrhard, Aymeric Walch:
Coherent Taylor expansion as a bimonad. CoRR abs/2310.01907 (2023) - 2022
- [j28]Thomas Ehrhard:
Differentials and distances in probabilistic coherence spaces. Log. Methods Comput. Sci. 18(3) (2022) - [i18]Thomas Ehrhard:
A coherent differential PCF. CoRR abs/2205.04109 (2022) - [i17]Thomas Ehrhard, Guillaume Geoffroy:
Integration in Cones. CoRR abs/2212.02371 (2022) - 2021
- [c37]Thomas Ehrhard, Farzad Jafarrahmani:
Categorical models of Linear Logic with fixed points of formulas. LICS 2021: 1-13 - [i16]Thomas Ehrhard:
Coherent differentiation. CoRR abs/2107.05261 (2021) - 2020
- [j27]Thomas Ehrhard, Jean Krivine, Ying Jiang:
A calculus of branching processes. Theor. Comput. Sci. 807: 169-184 (2020) - [c36]Thomas Ehrhard:
Non-idempotent Intersection Types in Logical Form. FoSSaCS 2020: 198-216 - [c35]Thomas Ehrhard:
Cones as a model of intuitionistic linear logic. LICS 2020: 370-383 - [i15]Thomas Ehrhard:
On the linear structure of cones. CoRR abs/2001.04284 (2020) - [i14]Thomas Ehrhard:
Differentials and distances in probabilistic coherence spaces (extended version). CoRR abs/2005.12582 (2020) - [i13]Thomas Ehrhard:
Upper approximating probabilities of convergence in probabilistic coherence spaces. CoRR abs/2008.04534 (2020) - [i12]Thomas Ehrhard, Farzad Jafarrahmani:
Categorical models of Linear Logic with fixed points of formulas. CoRR abs/2011.10209 (2020)
2010 – 2019
- 2019
- [j26]Ying Jiang, Shichao Liu, Thomas Ehrhard:
A fully abstract semantics for value-passing CCS for trees. Frontiers Comput. Sci. 13(4): 828-849 (2019) - [j25]Thomas Ehrhard, Christine Tasson:
Probabilistic call by push value. Log. Methods Comput. Sci. 15(1) (2019) - [c34]Thomas Ehrhard:
Differentials and Distances in Probabilistic Coherence Spaces. FSCD 2019: 17:1-17:17 - [e1]Thomas Ehrhard, Maribel Fernández, Valeria de Paiva, Lorenzo Tortora de Falco:
Proceedings Joint International Workshop on Linearity & Trends in Linear Logic and Applications, Linearity-TLLA@FLoC 2018, Oxford, UK, 7-8 July 2018. EPTCS 292, 2019 [contents] - [i11]Thomas Ehrhard:
Differentials and distances in probabilistic coherence spaces. CoRR abs/1902.04836 (2019) - [i10]Thomas Ehrhard, Farzad Jafar-Rahmani:
On the denotational semantics of Linear Logic with least and greatest fixed points of formulas. CoRR abs/1906.05593 (2019) - [i9]Thomas Ehrhard:
Non-idempotent intersection types in logical form. CoRR abs/1911.01899 (2019) - 2018
- [j24]Thomas Ehrhard, Michele Pagani, Christine Tasson:
Full Abstraction for Probabilistic PCF. J. ACM 65(4): 23:1-23:44 (2018) - [j23]Thomas Ehrhard:
An introduction to differential linear logic: proof-nets, models and antiderivatives. Math. Struct. Comput. Sci. 28(7): 995-1060 (2018) - [j22]Thomas Ehrhard, Michele Pagani, Christine Tasson:
Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming. Proc. ACM Program. Lang. 2(POPL): 59:1-59:28 (2018) - 2017
- [c33]Pierre Boutillier, Thomas Ehrhard, Jean Krivine:
Incremental Update for Graph Rewriting. ESOP 2017: 201-228 - [c32]Raphaëlle Crubillé, Thomas Ehrhard, Michele Pagani, Christine Tasson:
The Free Exponential Modality of Probabilistic Coherence Spaces. FoSSaCS 2017: 20-35 - [i8]Thomas Ehrhard, Michele Pagani, Christine Tasson:
Measurable Cones and Stable, Measurable Functions. CoRR abs/1711.09640 (2017) - 2016
- [c31]Thomas Ehrhard:
Call-By-Push-Value from a Linear Logic Point of View. ESOP 2016: 202-228 - [c30]Thomas Ehrhard, Giulio Guerrieri:
The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value. PPDP 2016: 174-187 - [i7]Thomas Ehrhard:
An introduction to Differential Linear Logic: proof-nets, models and antiderivatives. CoRR abs/1606.01642 (2016) - [i6]Shichao Liu, Thomas Ehrhard, Ying Jiang:
A Fully Abstract Semantics for Value-passing CCS for Trees. CoRR abs/1607.00141 (2016) - [i5]Thomas Ehrhard, Christine Tasson:
Probabilistic call by push value. CoRR abs/1607.04690 (2016) - 2015
- [i4]Thomas Ehrhard, Michele Pagani, Christine Tasson:
Full abstraction for probabilistic PCF. CoRR abs/1511.01272 (2015) - 2014
- [c29]Thomas Ehrhard:
A new correctness criterion for MLL proof nets. CSL-LICS 2014: 38:1-38:10 - [c28]Thomas Ehrhard, Christine Tasson, Michele Pagani:
Probabilistic coherence spaces are fully abstract for probabilistic PCF. POPL 2014: 309-320 - 2013
- [i3]Thomas Ehrhard, Ying Jiang:
CCS for Trees. CoRR abs/1306.1714 (2013) - 2012
- [j21]Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto:
A relational semantics for parallelism and non-determinism in a functional setting. Ann. Pure Appl. Log. 163(7): 918-934 (2012) - [j20]Antonio Bucciarelli, Alberto Carraro, Thomas Ehrhard, Giulio Manzonetto:
Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion. Log. Methods Comput. Sci. 8(4) (2012) - [j19]Thomas Ehrhard:
The Scott model of linear logic is the extensional collapse of its relational model. Theor. Comput. Sci. 424: 20-45 (2012) - [c27]Thomas Ehrhard:
Collapsing non-idempotent intersection types. CSL 2012: 259-273 - [c26]Alberto Carraro, Thomas Ehrhard, Antonino Salibra:
The stack calculus. LSFA 2012: 93-108 - 2011
- [j18]Vincent Danos, Thomas Ehrhard:
Probabilistic coherence spaces as a model of higher-order probabilistic computation. Inf. Comput. 209(6): 966-991 (2011) - [c25]Thomas Ehrhard:
Resource Lambda-Calculus: the Differential Viewpoint. CSL 2011: 1 - [c24]Antonio Bucciarelli, Alberto Carraro, Thomas Ehrhard, Giulio Manzonetto:
Full Abstraction for Resource Calculus with Tests. CSL 2011: 97-111 - [c23]Thomas Ehrhard, Michele Pagani, Christine Tasson:
The Computational Meaning of Probabilistic Coherence Spaces. LICS 2011: 87-96 - 2010
- [j17]Thomas Ehrhard, Olivier Laurent:
Acyclic Solos and Differential Interaction Nets. Log. Methods Comput. Sci. 6(3) (2010) - [j16]Thomas Ehrhard, Olivier Laurent:
Interpreting a finitary pi-calculus in differential interaction nets. Inf. Comput. 208(6): 606-633 (2010) - [c22]Alberto Carraro, Thomas Ehrhard, Antonino Salibra:
Exponentials with Infinite Multiplicities. CSL 2010: 170-184 - [c21]Thomas Ehrhard:
A Finiteness Structure on Resource Terms. LICS 2010: 402-410 - [c20]Alberto Carraro, Thomas Ehrhard, Antonino Salibra:
Resource Combinatory Algebras. MFCS 2010: 233-245 - [c19]Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto:
Categorical Models for Simply Typed Resource Calculi. MFPS 2010: 213-230 - [i2]Thomas Ehrhard:
A finiteness structure on resource terms. CoRR abs/1001.3219 (2010) - [i1]Richard Blute, Thomas Ehrhard, Christine Tasson:
A convenient differential category. CoRR abs/1006.3140 (2010)
2000 – 2009
- 2009
- [c18]Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto:
A Relational Model of a Parallel and Non-deterministic lambda-Calculus. LFCS 2009: 107-121 - [c17]Antonio Bucciarelli, Alberto Carraro, Thomas Ehrhard, Antonino Salibra:
On Linear Information Systems. LINEARITY 2009: 38-48 - 2008
- [j15]Thomas Ehrhard, Laurent Regnier:
Uniformity and the Taylor expansion of ordinary lambda-terms. Theor. Comput. Sci. 403(2-3): 347-372 (2008) - [c16]Thomas Ehrhard:
Differential Linear Logic and Processes. IFIP TCS 2008: 283 - 2007
- [c15]Thomas Ehrhard, Olivier Laurent:
Interpreting a Finitary Pi-calculus in Differential Interaction Nets. CONCUR 2007: 333-348 - [c14]Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto:
Not Enough Points Is Enough. CSL 2007: 298-312 - 2006
- [j14]Thomas Ehrhard, Laurent Regnier:
Differential interaction nets. Theor. Comput. Sci. 364(2): 166-195 (2006) - [c13]Thomas Ehrhard, Laurent Regnier:
Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms. CiE 2006: 186-197 - 2005
- [j13]Thomas Ehrhard:
Finiteness spaces. Math. Struct. Comput. Sci. 15(4): 615-646 (2005) - 2004
- [j12]Thomas Ehrhard:
A completeness theorem for symmetric product phase spaces. J. Symb. Log. 69(2): 340-370 (2004) - [c12]Thomas Ehrhard, Laurent Regnier:
Differential Interaction Nets. WoLLIC 2004: 35-74 - 2003
- [j11]Thomas Ehrhard, Laurent Regnier:
The differential lambda-calculus. Theor. Comput. Sci. 309(1-3): 1-41 (2003) - 2002
- [j10]Thomas Ehrhard:
On Köthe Sequence Spaces and Linear Logic. Math. Struct. Comput. Sci. 12(5): 579-623 (2002) - 2001
- [j9]Antonio Bucciarelli, Thomas Ehrhard:
On phase semantics and denotational semantics: the exponentials. Ann. Pure Appl. Log. 109(3): 205-241 (2001) - 2000
- [j8]Antonio Bucciarelli, Thomas Ehrhard:
On Phase Semantics and Denotational Semantics in Multiplicative-Additive Linear Logic. Ann. Pure Appl. Log. 102(3): 247-282 (2000) - [j7]Thomas Ehrhard:
Parallel and serial hypercoherences. Theor. Comput. Sci. 247(1-2): 39-81 (2000)
1990 – 1999
- 1999
- [j6]Thomas Ehrhard:
A Relative PCF-Definability Result for Strongly Stable Functions and some Corollaries. Inf. Comput. 152(1): 111-137 (1999) - [c11]Nuno Barreiro, Thomas Ehrhard:
Quantitative Semantics Revisited. TLCA 1999: 40-53 - 1998
- [j5]Thomas Ehrhard, Yves Lafont, Laurent Regnier:
Foreword. Math. Struct. Comput. Sci. 8(6): 541 (1998) - [c10]Thomas Ehrhard:
A relative PCF-definability result for strongly stable functions and some corollaries. Workshop on Domains 1998: 64-83 - 1997
- [c9]Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier:
Timeless Games. CSL 1997: 56-77 - [c8]Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier:
Believe it or not, AJM's Games Model is a Model of Classical Linear Logic. LICS 1997: 68-75 - 1996
- [j4]Thomas Ehrhard:
Projecting Sequential Algorithms on Strongly Stable Functions. Ann. Pure Appl. Log. 77(3): 201-244 (1996) - 1994
- [j3]Antonio Bucciarelli, Thomas Ehrhard:
Sequentiality in an Extensional Framework. Inf. Comput. 110(2): 265-296 (1994) - [c7]Loïc Colson, Thomas Ehrhard:
On Strong Stability and Higher-Order Sequentiality. LICS 1994: 103-108 - 1993
- [j2]Thomas Ehrhard:
Hypercoherences: A Strongly Stable Model of Linear Logic. Math. Struct. Comput. Sci. 3(4): 365-385 (1993) - [j1]Antonio Bucciarelli, Thomas Ehrhard:
A Theory of Sequentiality. Theor. Comput. Sci. 113(2): 273-291 (1993) - 1991
- [c6]Thomas Ehrhard, Pasquale Malacaria:
Stone Duality for Stable Functions. Category Theory and Computer Science 1991: 1-15 - [c5]Antonio Bucciarelli, Thomas Ehrhard:
Extensional Embedding of a Strongly Stable Model of PCF. ICALP 1991: 35-46 - [c4]Antonio Bucciarelli, Thomas Ehrhard:
Sequentiality and Strong Stability. LICS 1991: 138-145
1980 – 1989
- 1989
- [c3]Thomas Ehrhard:
Dictoses. Category Theory and Computer Science 1989: 213-223 - 1988
- [c2]Thomas Ehrhard:
A Categorical Semantics of Constructions. LICS 1988: 264-273 - 1987
- [c1]Thierry Coquand, Thomas Ehrhard:
An Equational Presentation of Higher Order Logic. Category Theory and Computer Science 1987: 40-56
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-27 22:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
