The following pages link to Linear logic (Q579249):
Displaying 50 items.
- Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions (Q764331) (← links)
- A trace-based model for multiparty contracts (Q764380) (← links)
- Automated reasoning and nonclassical logics: Introduction (Q805615) (← links)
- A non-deterministic view on non-classical negations (Q813081) (← links)
- Gentzen-type methods for bilattice negation (Q813084) (← links)
- Interactive observability in Ludics: the geometry of tests (Q817844) (← links)
- Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper) (Q832157) (← links)
- From IF to BI. A tale of dependence and separation (Q833040) (← links)
- Prime algebraicity (Q843107) (← links)
- Behavioral interface description of an object-oriented language with futures and promises (Q843206) (← links)
- Cut and pay (Q851192) (← links)
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note (Q853474) (← links)
- A calculus and logic of resources and processes (Q855007) (← links)
- Categorical proof theory of classical propositional calculus (Q860833) (← links)
- Differential interaction nets (Q860836) (← links)
- Remarks on classifications and adjunctions (Q861977) (← links)
- Weak typed Böhm theorem on IMLL (Q866556) (← links)
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- Resources, concurrency, and local reasoning (Q879368) (← links)
- Fuzzy logics based on \([0,1)\)-continuous uninorms (Q884954) (← links)
- Combining behavioural types with security analysis (Q890614) (← links)
- Interaction graphs: additives (Q892169) (← links)
- Proof nets and the call-by-value \(\lambda\)-calculus (Q897928) (← links)
- Subexponential concurrent constraint programming (Q897936) (← links)
- Filters on some classes of quantum B-algebras (Q904489) (← links)
- A typed calculus based on a fragment of linear logic (Q908909) (← links)
- Axioms and models of linear logic (Q915719) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- On formalisms (Q921958) (← links)
- Parametric \(\lambda \)-theories (Q930867) (← links)
- Soft linear set theory (Q941435) (← links)
- Uniformity and the Taylor expansion of ordinary lambda-terms (Q944386) (← links)
- Proof nets sequentialisation in multiplicative linear logic (Q952490) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- Gödel's system \(\mathcal T\) revisited (Q960861) (← links)
- Functional interpretations of linear and intuitionistic logic (Q964504) (← links)
- Girard couples of quantales (Q969691) (← links)
- Resolution is cut-free (Q972424) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- Interpreting a finitary pi-calculus in differential interaction nets (Q979075) (← links)
- On abstract resource semantics and computability logic (Q980944) (← links)
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization (Q983034) (← links)
- Abstract deduction and inferential models for type theory (Q988551) (← links)
- Linearity and bisimulation (Q997996) (← links)
- Constructive logic with strong negation is a substructural logic. II (Q1005940) (← links)
- Many concepts and two logics of algorithmic reduction (Q1005975) (← links)
- Phase semantics and Petri net interpretation for resource-sensitive strong negation (Q1006444) (← links)
- Investigations into a left-structural right-substructural sequent calculus (Q1006458) (← links)
- First-order Glue (Q1006481) (← links)
- Coherence in linear predicate logic (Q1011758) (← links)
