The following pages link to Linear logic (Q579249):
Displaying 50 items.
- Plans, actions and dialogues using linear logic (Q1016033) (← links)
- Typed lambda calculi and applications. 9th international conference, TLCA 2009, Brasilia, Brazil, July 1--3, 2009. Proceedings (Q1027645) (← links)
- A note on Trillas' CHC models (Q1028906) (← links)
- On the algebraic structure of declarative programming languages (Q1035699) (← links)
- Focusing and polarization in linear, intuitionistic, and classical logics (Q1035706) (← links)
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata (Q1037929) (← links)
- The quantic conuclei on quantales (Q1040655) (← links)
- Automata theory based on complete residuated lattice-valued logic: a categorical approach (Q1040923) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- Strong normalization property for second order linear logic (Q1044837) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- The linear abstract machine (Q1105351) (← links)
- The semantics and proof theory of linear logic (Q1106836) (← links)
- BCK-combinators and linear \(\lambda\)-terms have types (Q1119620) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Natural deduction and coherence for weakly distributive categories (Q1126244) (← links)
- Algebraic structures in categorial grammar (Q1129119) (← links)
- Domain theory in logical form (Q1174593) (← links)
- Inheritance as implicit coercion (Q1175335) (← links)
- The undecidability of \(k\)-provability (Q1176199) (← links)
- A characterization of nuclei in orthomodular and quantic lattices (Q1176707) (← links)
- Language in action (Q1177646) (← links)
- A bridge between constructive logic and computer programming (Q1179711) (← links)
- Relevant logic programming (Q1181715) (← links)
- Implementing the `Fool's model' of combinatory logic (Q1181718) (← links)
- Quantaloidal nuclei, the syntactic congruence and tree automata (Q1184038) (← links)
- Binary logic is rich enough (Q1184053) (← links)
- Stable neighbourhoods (Q1185012) (← links)
- Quantitative domains and infinitary algebras (Q1185015) (← links)
- Algebraic logic for classical conjunction and disjunction (Q1189892) (← links)
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\) (Q1190479) (← links)
- A game semantics for linear logic (Q1192350) (← links)
- Decision problems for propositional linear logic (Q1192352) (← links)
- Nonmodal classical linear predicate logic is a fragment of intuitionistic linear logic (Q1193657) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- Modal companions of intermediate propositional logics (Q1194106) (← links)
- The logic of structures (Q1196790) (← links)
- Modal translations in substructural logics (Q1198409) (← links)
- The first axiomatization of relevant logic (Q1206805) (← links)
- A representation theorem for quantales (Q1208239) (← links)
- Principal types of BCK-lambda-terms (Q1208417) (← links)
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
- Linearizing intuitionistic implication (Q1210141) (← links)
- Displaying and deciding substructural logics. I: Logics with contraposition (Q1267081) (← links)
- Light linear logic (Q1271560) (← links)
- \(\supset\)E is admissible in ``true'' relevant arithmetic (Q1272826) (← links)
- Reaction graph (Q1273068) (← links)
- Representing scope in intuitionistic deductions (Q1274448) (← links)
- Let's plan it deductively! (Q1274761) (← links)
- Usage counting analysis for lazy functional languages (Q1275747) (← links)
