Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Paolo Pistone"'
Autor:
Paolo Pistone
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 292, Iss Proc. Linearity-TLLA 2018, Pp 148-167 (2019)
Proof nets provide permutation-independent representations of proofs and are used to investigate coherence problems for monoidal categories. We investigate a coherence problem concerning Second Order Multiplicative Linear Logic (MLL2), that is, the o
Externí odkaz:
https://doaj.org/article/ef9c8e029dd1480ea22aacdbefdf20d4
Autor:
Paolo Pistone
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 4 (2019)
We investigate completeness and parametricity for a general class of realizability semantics for System F defined in terms of closure operators over sets of $\lambda$-terms. This class includes most semantics used for normalization theorems, as those
Externí odkaz:
https://doaj.org/article/71c6b704962c4108a5439b8bd992fa82
Publikováno v:
LICS 2022-37th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS 2022-37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haifa, Israel. ⟨10.1145/3531130.3533361⟩
LICS 2022-37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haifa, Israel. ⟨10.1145/3531130.3533361⟩
International audience; We show that an intuitionistic version of counting propositional logic corresponds, in the sense of Curry and Howard, to an expressive type system for the probabilistic event λ-calculus, a vehicle calculus in which both call-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1efc979e003ba98a956408ecce80c241
https://inria.hal.science/hal-03921650/document
https://inria.hal.science/hal-03921650/document
Publikováno v:
Studia Logica. 110:545-592
In a previous paper (of which this is a prosecution) we investigated the extraction of proof-theoretic properties of natural deduction derivations from their impredicative translation into System F. Our key idea was to introduce an extended equationa
Publikováno v:
Proceedings of CIE 2021
Proceedings of CIE 2021, pp.12-24, 2021, ⟨10.1007/978-3-030-80049-9_2⟩
Lecture Notes in Computer Science ISBN: 9783030800482
CiE
Proceedings of CIE 2021, pp.12-24, 2021, ⟨10.1007/978-3-030-80049-9_2⟩
Lecture Notes in Computer Science ISBN: 9783030800482
CiE
International audience; We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b44b3a1c9bc1ef35c3869b32fa9c23e
https://inria.hal.science/hal-03346804/document
https://inria.hal.science/hal-03346804/document
Autor:
Paolo Pistone
Publikováno v:
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2021, Rome, Italy. pp.1-14, ⟨10.1109/LICS52264.2021.9470696⟩
LICS 2021-36th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS 2021-36th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2021, Rome, Italy. pp.1-14, ⟨10.1109/LICS52264.2021.9470696⟩
LICS
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2021, Rome, Italy. pp.1-14, ⟨10.1109/LICS52264.2021.9470696⟩
LICS 2021-36th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS 2021-36th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2021, Rome, Italy. pp.1-14, ⟨10.1109/LICS52264.2021.9470696⟩
LICS
International audience; Generalized metrics, arising from Lawvere's view of metric spaces as enriched categories, have been widely applied in denotational semantics as a way to measure to which extent two programs behave in a similar, although non eq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::481ddd6d3d4c0f0e23e5f986bf17c0b5
https://hal.archives-ouvertes.fr/hal-03346950
https://hal.archives-ouvertes.fr/hal-03346950
Publikováno v:
Proceedings of CIE 2021, 17th Conference on Computability in Europe
Autor:
Paolo Pistone, Tranchini, L.
Publikováno v:
Scopus-Elsevier
In this paper we explore a family of type isomorphisms in System F whose validity corresponds, semantically, to some form of the Yoneda isomorphism from category theory. These isomorphisms hold under theories of equivalence stronger than βη-equival
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::163e6994cf0b3f549ca71ff14df3e6df
Autor:
Paolo Pistone, Mattia Petrolo
Publikováno v:
Topoi. 38:605-617
A proof-theoretic test for paradoxicality was famously proposed by Tennant: a paradox must yield a closed derivation of absurdity with no normal form. Drawing on the remark that all derivations of a given proposition can be transformed into derivatio