Search Results - "Regnier, Laurent"
-
1
Uniformity and the Taylor expansion of ordinary lambda-terms
Published in Theoretical computer science (28-08-2008)“…We define the complete Taylor expansion of an ordinary lambda-term as an infinite linear combination–with rational coefficients–of terms of a resource calculus…”
Get full text
Journal Article -
2
The differential lambda-calculus
Published in Theoretical computer science (02-12-2003)“…We present an extension of the lambda-calculus with differential constructions. We state and prove some basic results (confluence, strong normalization in the…”
Get full text
Journal Article -
3
Differential interaction nets
Published in Theoretical computer science (06-11-2006)“…We introduce interaction nets for a fragment of the differential lambda-calculus and exhibit in this framework a new symmetry between the of course and the why…”
Get full text
Journal Article Conference Proceeding -
4
Reversible, irreversible and optimal λ-machines
Published in Theoretical computer science (28-09-1999)“…Lambda-calculus is the core of functional programming, and many different ways to evaluate lambda-terms have been considered. One of the nicest, from the…”
Get full text
Journal Article Conference Proceeding -
5
The structure of multiplicatives
Published in Archive for mathematical logic (01-10-1989)Get full text
Journal Article -
6
About translations of classical logic into polarized linear logic
Published in 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings (2003)“…We show that the decomposition of intuitionistic logic into linear logic along the equation A /spl rarr/ B = !A /spl rarr/ B may be adapted into a…”
Get full text
Conference Proceeding
-
7
Differential Interaction Nets
Published in Electronic notes in theoretical computer science (01-03-2005)“…We introduce interaction nets for the differential lambda-calculus and exhibit in this framework a new symmetry between the of course and the why not…”
Get full text
Journal Article -
8
Retractions of Types with Many Atoms
Published 05-12-2002“…We define a sound and complete proof system for affine beta-eta-retractions in simple types built over many atoms, and we state simple necessary conditions for…”
Get full text
Journal Article -
9
Reversible, Irreversible and Optimal λ-machines: Extended abstract
Published in Electronic notes in theoretical computer science (1996)“…There are two quite different possibilities for implementing linear head reduction in λ-calculus. Two ways which we are going to explain briefly here in the…”
Get full text
Journal Article -
10
Believe it or not, AJM's games model is a model of classical linear logic
Published in Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science (1997)“…A general category of games is constructed. A subcategory of saturated strategies, closed under all possible codings in copy games, is shown to model reduction…”
Get full text
Conference Proceeding -
11
Reversible, Irreversible and Optimal λ-machines
Published in Electronic notes in theoretical computer science (1996)Get full text
Journal Article -
12
Some results on the interpretation of lambda -calculus in operator algebras
Published in [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science (1991)“…J.-Y. Girard (Proc. ASL Meeting, 1988) proposed an interpretation of second order lambda -calculus in a C algebra and showed that the interpretation of a term…”
Get full text
Conference Proceeding