Zobrazeno 1 - 10
of 261
pro vyhledávání: '"Yves Lafont"'
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f22478896d32f2d761f383515c555820
https://doi.org/10.2307/2275558
https://doi.org/10.2307/2275558
Autor:
Howard, W. A.
Publikováno v:
The Journal of Symbolic Logic, 1991 Jun 01. 56(2), 760-761.
Externí odkaz:
https://www.jstor.org/stable/2274726
Autor:
W. A. Howard
Publikováno v:
Journal of Symbolic Logic. 56:760-761
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e44d56bb344d3fb7400ec8e6b77a44ff
https://doi.org/10.2307/2274726
https://doi.org/10.2307/2274726
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:
Yves Lafont
Publikováno v:
Applied Categorical Structures. 15:415-437
We present various results of the last 20 years converging towards a homotopical theory of computation. This new theory is based on two crucial notions: polygraphs (introduced by Albert Burroni) and polygraphic resolutions (introduced by Francois Met
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20ba56d8a023fb72671662018156236e
https://doi.org/10.1007/s10485-007-9083-6
https://doi.org/10.1007/s10485-007-9083-6
Autor:
Yves Lafont
Publikováno v:
Theoretical Computer Science. 318:163-180
We present a subsystem of second-order linear logic with restricted rules for exponentials so that proofs correspond to polynomial time algorithms, and vice versa.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d945882e39fa2690a82b43122c6e3a74
https://doi.org/10.1016/j.tcs.2003.10.018
https://doi.org/10.1016/j.tcs.2003.10.018
Autor:
Yves Lafont
Publikováno v:
Journal of Pure and Applied Algebra. 184:257-310
Boolean circuits are used to represent programs on finite data. Reversible Boolean circuits and quantum Boolean circuits have been introduced to modelize some physical aspects of computation. Those notions are essential in complexity theory, but we c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c6db4d221c9b5efdced960b122dc40e
https://doi.org/10.1016/s0022-4049(03)00069-0
https://doi.org/10.1016/s0022-4049(03)00069-0
Autor:
Yves Lafont
Publikováno v:
Journal of Symbolic Logic. 61:541-548
Recently, Lincoln, Scedrov and Shankar showed that the multiplicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::572cfcc45b7605a068aca3b2c6dd4334
https://doi.org/10.2307/2275674
https://doi.org/10.2307/2275674
Autor:
Andre Scedrov, Yves Lafont
Publikováno v:
Information and Computation. 125(1):46-51
The multiplicative fragment of second order propositional linear logic is shown to be undecidable.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7d52f50cfbbf3d6b65727d6178691aa