Pages that link to "Item:Q1035706"

The following pages link to Focusing and polarization in linear, intuitionistic, and classical logics (Q1035706):

Displaying 48 items.

• Intuitionistic games: determinacy, completeness, and normalization (Q332080) (← links)
• Proving concurrent constraint programming correct, revisited (Q530860) (← links)
• A focused approach to combining logics (Q639671) (← links)
• Kripke semantics for higher-order type theory applied to constraint logic programming languages (Q683712) (← links)
• A framework for proof systems (Q707742) (← links)
• A semantic framework for proof evidence (Q1701039) (← links)
• Goal-oriented proof-search in natural deduction for intuitionistic propositional logic (Q1725847) (← links)
• Proof certificates for equality reasoning (Q1744408) (← links)
• Multi-focused proofs with different polarity assignments (Q1744415) (← links)
• The polarized \(\lambda\)-calculus (Q1744450) (← links)
• Proof nets for classical logic (Q1982017) (← links)
• Subformula linking for intuitionistic logic with application to type theory (Q2055855) (← links)
• Proof search and certificates for evidential transactions (Q2055859) (← links)
• A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems (Q2095424) (← links)
• Resourceful program synthesis from graded linear types (Q2119110) (← links)
• From axioms to synthetic inference rules via focusing (Q2120974) (← links)
• From QBFs to \textsf{MALL} and back via focussing (Q2209553) (← links)
• A coinductive approach to proof search through typed lambda-calculi (Q2231698) (← links)
• Focused proof-search in the logic of bunched implications (Q2233409) (← links)
• A proof theory for model checking (Q2331070) (← links)
• On subexponentials, focusing and modalities in concurrent systems (Q2404074) (← links)
• Proof checking and logic programming (Q2628296) (← links)
• Focused and Synthetic Nested Sequents (Q2811354) (← links)
• Proofs, Upside Down (Q2937799) (← links)
• Structural Focalization (Q2946730) (← links)
• A Proposal for Broad Spectrum Proof Certificates (Q3100201) (← links)
• Disproving Using the Inverse Method by Iterative Refinement of Finite Approximations (Q3455767) (← links)
• The Proof Certifier Checkers (Q3455771) (← links)
• Proof-Search in Natural Deduction Calculus for Classical Propositional Logic (Q3455774) (← links)
• Multi-focused cut elimination (Q4637625) (← links)
• Expressing additives using multiplicatives and subexponentials (Q4637626) (← links)
• On geometry of interaction for polarized linear logic (Q4961719) (← links)
• COCHIS: Stable and coherent implicits (Q4972074) (← links)
• (Q5005105) (← links)
• (Q5015208) (← links)
• (Q5015283) (← links)
• (Q5018490) (← links)
• A focused linear logical framework and its application to metatheory of object logics (Q5022931) (← links)
• Connecting Sequent Calculi with Lorenzen-Style Dialogue Games (Q5024728) (← links)
• Specifying Proof Systems in Linear Logic with Subexponentials (Q5179015) (← links)
• Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search (Q5236550) (← links)
• A general proof certification framework for modal logic (Q5236558) (← links)
• Imaginary groups: lazy monoids and reversible computation (Q5400854) (← links)
• Proof Checking and Logic Programming (Q5743582) (← links)
• A linear logic framework for multimodal logics (Q5889307) (← links)
• A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
• Focusing Gentzen's LK proof system (Q6612872) (← links)
• Partial proof terms in the study of idealized proof search (Q6648177) (← links)