Subexponentials in non-commutative linear logic
Linear logical frameworks with subexponentials have been used for the specification of,
among other systems, proof systems, concurrent programming languages and linear …
among other systems, proof systems, concurrent programming languages and linear …
A logical framework with commutative and non-commutative subexponentials
Logical frameworks allow the specification of deductive systems using the same logical
machinery. Linear logical frameworks have been successfully used for the specification of a …
machinery. Linear logical frameworks have been successfully used for the specification of a …
Mechanizing focused linear logic in coq
Linear logic has been used as a foundation (and inspiration) for the development of
programming languages, logical frameworks and models for concurrency. Linear logic's cut …
programming languages, logical frameworks and models for concurrency. Linear logic's cut …
[PDF][PDF] A uniform framework for substructural logics with modalities.
It is well known that context dependent logical rules can be problematic both to implement
and reason about. This is one of the factors driving the quest for better behaved, ie, local …
and reason about. This is one of the factors driving the quest for better behaved, ie, local …
[HTML][HTML] Subexponential concurrent constraint programming
In previous works we have shown that linear logic with subexponentials (SELL), a
refinement of linear logic, can be used to specify emergent features of concurrent constraint …
refinement of linear logic, can be used to specify emergent features of concurrent constraint …
[HTML][HTML] A proof theoretic view of spatial and temporal dependencies in biochemical systems
The behavior of biochemical systems such as metabolic and signaling pathways may
depend on either the location of the reactants or on the time needed for a reaction to occur …
depend on either the location of the reactants or on the time needed for a reaction to occur …
[HTML][HTML] On subexponentials, focusing and modalities in concurrent systems
In this work we present the focused proof system SELLF⋒, which extends intuitionistic linear
logic with subexponentials with the ability of quantifying over them, hence allowing for the …
logic with subexponentials with the ability of quantifying over them, hence allowing for the …
Kleene star, subexponentials without contraction, and infinite computations
SL Kuznetsov - Сибирские электронные математические известия, 2021 - mathnet.ru
We present an extension of intuitionistic non-commutative linear logic with Kleene star and
subexponentials which allow permutation and/or weakening, but not contraction …
subexponentials which allow permutation and/or weakening, but not contraction …
A proof theoretic study of soft concurrent constraint programming
Concurrent Constraint Programming (CCP) is a simple and powerful model for concurrency
where agents interact by telling and asking constraints. Since their inception, CCP …
where agents interact by telling and asking constraints. Since their inception, CCP …
Computational logic for biomedicine and neurosciences
188 Symbolic Approaches to Modeling and Analysis of Biological Systems properties. In
biomedicine, the study of multi-omic pathway interactions, together with clinical and …
biomedicine, the study of multi-omic pathway interactions, together with clinical and …