Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Theory of computation ��� Linear logic"'
Autor:
Guardia, Rémi, Laurent, Olivier
Publikováno v:
Leibniz International Proceedings in Informatics (LIPIcs)
8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023)
8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), Jul 2023, Rome, Italy. pp.2, ⟨10.4230/LIPIcs.FSCD.2023.26⟩
8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), Jul 2023, Rome, Italy. ⟨10.4230/LIPIcs.FSCD.2023.22⟩
8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023)
8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), Jul 2023, Rome, Italy. pp.2, ⟨10.4230/LIPIcs.FSCD.2023.26⟩
8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), Jul 2023, Rome, Italy. ⟨10.4230/LIPIcs.FSCD.2023.22⟩
We characterize type isomorphisms in the multiplicative-additive fragment of linear logic (MALL), and thus for ⋆-autonomous categories with finite products, extending a result for the multiplicative fragment by Balat and Di Cosmo [Vincent Balat and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::011c9e45ade7a3d0b39903a773340938
https://hal.science/hal-04082204v2/document
https://hal.science/hal-04082204v2/document
Publikováno v:
FSCD 2023-8th International Conference on Formal Structures for Computation and Deduction
FSCD 2023-8th International Conference on Formal Structures for Computation and Deduction, Jul 2023, Rome, Italy
FSCD 2023-8th International Conference on Formal Structures for Computation and Deduction, Jul 2023, Rome, Italy
This work aims at exploring the algebraic structure of concurrent processes and their behavior independently of a particular formalism used to define them. We propose a new algebraic structure called conjunctive involutive monoidal algebra (CIMA) as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::913b4fa960593c990e1ee32beab9f347
https://inria.hal.science/hal-04083002v1/document
https://inria.hal.science/hal-04083002v1/document
In this paper, we present a linear and reversible programming language with inductives types and recursion. The semantics of the languages is based on pattern-matching; we show how ensuring syntactical exhaustivity and non-overlapping of clauses is e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3da2a93a80c6a990d1a6db977a6586a3
http://arxiv.org/abs/2302.11887
http://arxiv.org/abs/2302.11887
Linear Logic refines Classical Logic by taking into account the resources used during the proof and program computation. In the past decades, it has been extended to various frameworks. The most famous are indexed linear logics which can describe the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e644f5831d557a878b66fd9cae9615c
In embedded systems, applications frequently have to meet non-functional requirements regarding, e.g., real-time or energy consumption constraints, when executing on a given MPSoC target platform. Feedback-based controllers have been proposed that re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::029c7de60a7c7e2efa6a38000b55c94d
Autor:
Tanaka, Hiromi
We investigate the non-elementary computational complexity of a family of substructural logics without contraction. With the aid of the technique pioneered by Lazi\'c and Schmitz (2015), we show that the deducibility problem for full Lambek calculus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d23434899936304caef9ea47d8c06f7
We consider an extension of multiplicative linear logic which encompasses bayesian networks and expresses samples sharing and marginalisation with the polarised rules of contraction and weakening. We introduce the necessary formalism to import exact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::575d27e346b30c05f0908971159953bc
Publikováno v:
FSTTCS 2022-42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
FSTTCS 2022-42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2022, Chennai, India. pp.35:1--35:23, ⟨10.4230/LIPIcs.FSTTCS.2022.35⟩
FSTTCS 2022-42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2022, Chennai, India. pp.35:1--35:23, ⟨10.4230/LIPIcs.FSTTCS.2022.35⟩
The truth semantics of linear logic (i.e. phase semantics) is often overlooked despite having a wide range of applications and deep connections with several denotational semantics. In phase semantics, one is concerned about the provability of formula
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16de1d38ebbb5a6dae1e386be7718d27
https://hal.science/hal-04061582/document
https://hal.science/hal-04061582/document
Publikováno v:
CSL 2022-30th EACSL Annual Conference on Computer Science Logic
CSL 2022-30th EACSL Annual Conference on Computer Science Logic, Feb 2022, Göttingen, Germany. ⟨10.4230/LIPIcs.CSL.2022.32⟩
30th EACSL Annual Conference on Computer Science Logic, CSL 2022
30th EACSL Annual Conference on Computer Science Logic, CSL 2022, Feb 2022, Göttingen, Germany. ⟨10.4230/LIPIcs.CSL.2022.32⟩
CSL 2022-30th EACSL Annual Conference on Computer Science Logic, Feb 2022, Göttingen, Germany. ⟨10.4230/LIPIcs.CSL.2022.32⟩
30th EACSL Annual Conference on Computer Science Logic, CSL 2022
30th EACSL Annual Conference on Computer Science Logic, CSL 2022, Feb 2022, Göttingen, Germany. ⟨10.4230/LIPIcs.CSL.2022.32⟩
BV and pomset logic are two logics that both conservatively extend unit-free multiplicative linear logic by a third binary connective, which (i) is non-commutative, (ii) is self-dual, and (iii) lies between the "par" and the "tensor". It was conjectu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69b8b69b7325b4780fc01da78013afcb
https://inria.hal.science/hal-03909463
https://inria.hal.science/hal-03909463
Publikováno v:
7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)
7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022), Aug 2022, Haifa, Israel. ⟨10.4230/LIPIcs.FSCD.2022.22⟩
7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022), Aug 2022, Haifa, Israel. ⟨10.4230/LIPIcs.FSCD.2022.22⟩
Logical time is a partial order over events in distributed systems, constraining which events precede others. Special interest has been given to series-parallel orders since they correspond to formulas constructed via the two operations for "series"
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6843df260e83a69cffc697ec4fbdf69