Pages that link to "Item:Q1327384"

The following pages link to Logic programming in a fragment of intuitionistic linear logic (Q1327384):

Displaying 50 items.

• Dynamic spaces in concurrent constraint programming (Q281160) (← links)
• Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax (Q438569) (← links)
• Linearity and iterator types for Gödel's system \(\mathcal T\) (Q656851) (← links)
• Forum: A multiple-conclusion specification logic (Q671512) (← links)
• A framework for proof systems (Q707742) (← links)
• Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
• A logical characterization of forward and backward chaining in the inverse method (Q928660) (← links)
• Phase semantics and Petri net interpretation for resource-sensitive strong negation (Q1006444) (← links)
• On the algebraic structure of declarative programming languages (Q1035699) (← links)
• Focusing and polarization in linear, intuitionistic, and classical logics (Q1035706) (← links)
• Resolution calculus for the first order linear logic (Q1314284) (← links)
• Proof strategies in linear logic (Q1340963) (← links)
• Semantic data modelling using linear logic (Q1349996) (← links)
• A new framework for declarative programming (Q1399960) (← links)
• A linear logical framework (Q1400718) (← links)
• Efficient resource management for linear logic proof search (Q1575929) (← links)
• Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
• From cut-free calculi to automated deduction: the case of bounded contraction (Q1744444) (← links)
• Focussing and proof construction (Q1840461) (← links)
• Linear concurrent constraint programming: Operational and phase semantics (Q1854410) (← links)
• MELL in the calculus of structures (Q1884903) (← links)
• Multimodal linguistic inference (Q1923840) (← links)
• Logical approximation for program analysis (Q1929363) (← links)
• From multiple sequent for additive linear logic to decision procedures for free lattices (Q1960422) (← links)
• The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
• Resourceful program synthesis from graded linear types (Q2119110) (← links)
• Formalization of metatheory of the Quipper quantum programming language in a linear logic (Q2331074) (← links)
• A type system for lock-free processes (Q2497143) (← links)
• Non-commutative proof construction: a constraint-based approach (Q2503402) (← links)
• Reasoning in Abella about Structural Operational Semantics Specifications (Q2804943) (← links)
• A rewriting framework and logic for activities subject to regulations (Q2973251) (← links)
• Functional-Logic Graph Parser Combinators (Q3522023) (← links)
• Focusing in Linear Meta-logic (Q3541726) (← links)
• Abductive Logic Grammars (Q3638282) (← links)
• The Logic of Bunched Implications (Q4262604) (← links)
• (Q4499267) (← links)
• (Q4499269) (← links)
• RASP and ASP as a fragment of linear logic (Q4583307) (← links)
• An Improved Proof-Theoretic Compilation of Logic Programs (Q4911140) (← links)
• Relating State-Based and Process-Based Concurrency through Linear Logic (Q4917995) (← links)
• Encryption as an abstract data-type (Q4924525) (← links)
• Term Sequent Logic (Q4982627) (← links)
• Formalizing Operational Semantic Specifications in Logic (Q4982629) (← links)
• Connection-based proof construction in linear logic (Q5234702) (← links)
• Resource-distribution via Boolean constraints (Q5234703) (← links)
• On the unification of classical, intuitionistic and affine logics (Q5236553) (← links)
• Subexponentials in non-commutative linear logic (Q5236554) (← links)
• Closures and Modules Within Linear Logic Concurrent Constraint Programming (Q5458864) (← links)
• Least and Greatest Fixed Points in Linear Logic (Q5892168) (← links)
• Proofs as computations in linear logic (Q5941199) (← links)