#### Filter Results:

#### Publication Year

1987

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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

- 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 \\nitary" subsets, satisfying a closure condition with respect to an orthogonality relation between subsets of the web, and proofs are interpreted by nitary sets. This model seems quite diierent in spirit from… (More)

- 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.
- 2008

- Antonio Bucciarelli, Thomas Ehrhard
- LICS
- 1991

Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as " λ-models " , or as (structures arising from) any reflexive object in a cartesian closed category (ccc, for brevity). These notions are tightly linked in the sense that: given a λ-model A, one may define a ccc in which A (the… (More)

- Thomas Ehrhard
- Mathematical Structures in Computer Science
- 2002

We present a category of locally convex topological vector spaces which is a model of propo-sitional classical linear logic, based on the standard concept of Köthe sequence spaces. In this setting, the " of course " connective of linear logic has a quite simple structure of commutative Hopf algebra. The co-Kleisli category of this linear category is a… (More)

- Thomas Ehrhard, Olivier Laurent
- Inf. Comput.
- 2007

- 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)