Zobrazeno 1 - 10
of 149
pro vyhledávání: '"Laurent Regnier"'
Autor:
Dimitracopoulos, C., Miller, Dale
Publikováno v:
The Journal of Symbolic Logic, 1997 Jun 01. 62(2), 678-680.
Externí odkaz:
https://www.jstor.org/stable/2275558
Autor:
Dale Miller
Publikováno v:
Journal of Symbolic Logic. 62:678-680
Linear logic, introduced in 1986 by J.-Y. Girard, is based upon a fine grain analysis of the main proof-theoretical notions of logic. The subject develops along the lines of denotational semantics, proof nets and the geometry of interaction. Its basi
Autor:
Thomas Ehrhard, Laurent Regnier
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2006, 364 (2), pp.166-195. ⟨10.1016/j.tcs.2006.08.003⟩
Theoretical Computer Science, 2006, 364 (2), pp.166-195. ⟨10.1016/j.tcs.2006.08.003⟩
Theoretical Computer Science, Elsevier, 2006, 364 (2), pp.166-195. ⟨10.1016/j.tcs.2006.08.003⟩
Theoretical Computer Science, 2006, 364 (2), pp.166-195. ⟨10.1016/j.tcs.2006.08.003⟩
30 pages; International audience; 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 not" modalities of linear logic, which is completely
Autor:
Laurent Regnier, Thomas Ehrhard
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 2003, 309 (1-3), pp.1-41. ⟨10.1016/S0304-3975(03)00392-X⟩
Theoretical Computer Science, Elsevier, 2003, 309 (1-3), pp.1-41. ⟨10.1016/S0304-3975(03)00392-X⟩
Theoretical Computer Science, 2003, 309 (1-3), pp.1-41. ⟨10.1016/S0304-3975(03)00392-X⟩
Theoretical Computer Science, Elsevier, 2003, 309 (1-3), pp.1-41. ⟨10.1016/S0304-3975(03)00392-X⟩
41 pages; International audience; We present an extension of the lambda-calculus with differential constructions. We state and prove some basic results (confluence, strong normalization in the typed case), and also a theorem relating the usual Taylor
Autor:
Thomas Ehrhard, Laurent Regnier
Publikováno v:
Logical Approaches to Computational Barriers ISBN: 9783540354666
CiE
CiE
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22da0c66eef80738c2e093219953f14b
https://doi.org/10.1007/11780342_20
https://doi.org/10.1007/11780342_20
Autor:
O. Laurent, Laurent Regnier
Publikováno v:
Logic in Computer Science
LICS
LICS
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 decomposition of classical logic into LLP, the polarized version of Linear Logic. Firstly, we build a c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d22ddda982dc999307344a60a3b2dfde
https://hal.archives-ouvertes.fr/hal-00009139
https://hal.archives-ouvertes.fr/hal-00009139
Autor:
Laurent Regnier, Vincent Danos
Publikováno v:
LICS
The authors build a confluent, local, asynchronous reduction on lambda -terms, using infinite objects (partial injections of Girard's (1988) algebra L*), which is simple (only one move), intelligible (semantic setting of the reduction), and general (
Publikováno v:
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
The interaction processes at work by M. Hyland and L. Ong (1994) (HO) and S. Abramsky et al. (1994) (AJM) new game semantics are two preexisting paradigmatic implementations of linear head reduction: respectively Krivine's abstract machine and Girard
Publikováno v:
Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
Since the rebirth of /spl lambda/-calculus in the late 1960s, three major theoretical investigations of /spl beta/-reduction have been undertaken: (1) Levy's (1978) analysis of families of redexes (and the associated concept of labeled reductions); (