Pages that link to "Item:Q4018167"

The following pages link to Logic Programming with Focusing Proofs in Linear Logic (Q4018167):

Displaying 50 items.

• Hypersequent rules with restricted contexts for propositional modal logics (Q344801) (← links)
• A game semantics for disjunctive logic programming (Q388214) (← links)
• Figures of dialogue: a view from ludics (Q408341) (← links)
• Algebraic proof theory for substructural logics: cut-elimination and completions (Q409322) (← links)
• Proving concurrent constraint programming correct, revisited (Q530860) (← links)
• Preface to the special volume (Q534064) (← links)
• Resource modalities in tensor logic (Q636303) (← links)
• Proof and refutation in MALL as a game (Q636305) (← links)
• A focused approach to combining logics (Q639671) (← links)
• MacNeille completions of FL-algebras (Q652517) (← links)
• Forum: A multiple-conclusion specification logic (Q671512) (← links)
• Kripke semantics for higher-order type theory applied to constraint logic programming languages (Q683712) (← links)
• A framework for proof systems (Q707742) (← links)
• Algebraic proof theory: hypersequents and hypercompletions (Q730091) (← links)
• Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper) (Q832157) (← links)
• A categorical semantics for polarized MALL (Q866570) (← links)
• Subexponential concurrent constraint programming (Q897936) (← links)
• A logical characterization of forward and backward chaining in the inverse method (Q928660) (← links)
• Resolution is cut-free (Q972424) (← links)
• Focusing and polarization in linear, intuitionistic, and classical logics (Q1035706) (← links)
• On linear logic planning and concurrency (Q1041042) (← links)
• Entailment-based actions for coordination (Q1127518) (← links)
• Linearizing intuitionistic implication (Q1210141) (← links)
• Representing scope in intuitionistic deductions (Q1274448) (← links)
• Permutability of proofs in intuitionistic sequent calculi (Q1275625) (← links)
• Logic programming in a fragment of intuitionistic linear logic (Q1327384) (← links)
• Programs with continuations and linear logic (Q1330460) (← links)
• Proof strategies in linear logic (Q1340963) (← links)
• On proof normalization in linear logic (Q1342248) (← links)
• First-order linear logic without modalities is NEXPTIME-hard (Q1342252) (← links)
• Non-commutative logic. III: Focusing proofs. (Q1427855) (← links)
• Connection methods in linear logic and proof nets construction (Q1575926) (← links)
• Cut-elimination for a logic with definitions and induction (Q1575931) (← links)
• Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
• A semantic framework for proof evidence (Q1701039) (← links)
• Proof certificates for equality reasoning (Q1744408) (← links)
• Multi-focused proofs with different polarity assignments (Q1744415) (← links)
• From cut-free calculi to automated deduction: the case of bounded contraction (Q1744444) (← links)
• Hybrid and subexponential linear logics (Q1744445) (← links)
• The polarized \(\lambda\)-calculus (Q1744450) (← links)
• Modularity of proof-nets. Generating the type of a module. (Q1766921) (← links)
• Focussing and proof construction (Q1840461) (← links)
• Softness of MALL proof-structures and a correctness criterion with Mix (Q1882627) (← links)
• MELL in the calculus of structures (Q1884903) (← links)
• Multimodal linguistic inference (Q1923840) (← links)
• Logical approximation for program analysis (Q1929363) (← links)
• A PSPACE-complete fragment of second-order linear logic (Q1960427) (← links)
• Proof nets for classical logic (Q1982017) (← links)
• The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
• Subformula linking for intuitionistic logic with application to type theory (Q2055855) (← links)