#### Filter Results:

- Full text PDF available (62)

#### Publication Year

1987

2017

- This year (2)
- Last 5 years (23)
- Last 10 years (46)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Thomas Ehrhard, Laurent Regnier
- Theor. Comput. Sci.
- 2003

- Thomas Ehrhard
- Mathematical Structures in Computer Science
- 1993

We present a model of classical linear logic based on the notion of strong stability that was introduced in BE], a work about sequentiality written jointly with Antonio Bucciarelli.

- Thomas Ehrhard, Laurent Regnier
- Theor. Comput. Sci.
- 2005

- Thomas Ehrhard
- Mathematical Structures in Computer Science
- 2005

We investigate a new denotational model of linear logic based on the purely relational model. In this semantics, webs are equipped with a notion of “finitary” subsets satisfying a closure condition and proofs are interpreted as finitary sets. In spite of a formal similarity, this model is quite different from the usual models of linear logic (coherence… (More)

- Thomas Ehrhard, Laurent Regnier
- Theor. Comput. Sci.
- 2008

- Antonio Bucciarelli, Thomas Ehrhard
- LICS
- 1991

- Thomas Ehrhard, Laurent Regnier
- CiE
- 2006

We introduce and study a version of Krivine’s machine which provides a precise information about how much of its argument is needed for performing a computation. This information is expressed as a term of a resource lambda-calculus introduced by the authors in a recent article; this calculus can be seen as a fragment of the differential lambda-calculus. We… (More)

- Thomas Ehrhard, Christine Tasson, Michele Pagani
- POPL
- 2014

Probabilistic coherence spaces (PCoh) yield a semantics of higher-order probabilistic computation, interpreting types as convex sets and programs as power series. We prove that the equality of interpretations in Pcoh characterizes the operational indistinguishability of programs in PCF with a random primitive.
This is the first result of full abstraction… (More)

- Thomas Ehrhard
- Ann. Pure Appl. Logic
- 1996

We relate two sequential models of PCF: the sequential algorithm model due to Berry and Curien and the strongly stable model due to Bucciarelli and the author. More precisely, we show that all the morphisms araising in the strongly stable model of PCF are sequential in the sense that they are the \extensional projections" of some sequential algorithms. We… (More)

- Vincent Danos, Thomas Ehrhard
- Inf. Comput.
- 2011

We study a probabilistic version of coherence spaces and show that these objects provide a model of Linear Logic. We build a model of the pure lambda-calculus in this setting and show how to interpret a probabilistic version of the functional language PCF. We give a probabilistic interpretation of the semantics of probabilistic PCF closed terms of ground… (More)