Pages that link to "Item:Q2640596"

The following pages link to Uniform proofs as a foundation for logic programming (Q2640596):

Displaying 50 items.

• A game semantics for disjunctive logic programming (Q388214) (← links)
• Temporal BI: proof system, semantics and translations (Q391122) (← links)
• Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax (Q438569) (← links)
• Constraint logic programming with a relational machine (Q511023) (← links)
• Nominal abstraction (Q617715) (← links)
• A focused approach to combining logics (Q639671) (← 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)
• Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
• The \(\lambda \)-calculus and the unity of structural proof theory (Q733755) (← links)
• Bounded linear-time temporal logic: a proof-theoretic investigation (Q764266) (← links)
• Translating propositional extended conjunctions of Horn clauses into Boolean circuits (Q964389) (← links)
• Abstract deduction and inferential models for type theory (Q988551) (← links)
• On the algebraic structure of declarative programming languages (Q1035699) (← links)
• Focusing and polarization in linear, intuitionistic, and classical logics (Q1035706) (← links)
• Programming in metric temporal logic (Q1128978) (← links)
• Linearizing intuitionistic implication (Q1210141) (← links)
• Representing scope in intuitionistic deductions (Q1274448) (← links)
• Permutability of proofs in intuitionistic sequent calculi (Q1275625) (← links)
• Implementing tactics and tacticals in a higher-order logic programming language (Q1311396) (← links)
• A proof procedure for the logic of hereditary Harrop formulas (Q1311397) (← links)
• Resolution calculus for the first order linear logic (Q1314284) (← links)
• A semantics for \(\lambda \)Prolog (Q1349686) (← links)
• A logical semantics for depth-first Prolog with ground negation (Q1390936) (← links)
• A new framework for declarative programming (Q1399960) (← links)
• Non-commutative logic. III: Focusing proofs. (Q1427855) (← links)
• On the intuitionistic force of classical search (Q1575923) (← links)
• Correspondences between classical, intuitionistic and uniform provability (Q1575924) (← links)
• The calculus of constructions as a framework for proof search with set variable instantiation (Q1575927) (← links)
• Efficient resource management for linear logic proof search (Q1575929) (← 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)
• 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)
• Possible worlds and resources: The semantics of \(\mathbf{BI}\) (Q1826634) (← links)
• Focussing and proof construction (Q1840461) (← links)
• Structural cut elimination. I: Intuitionistic and classical logic (Q1854335) (← links)
• Higher-order substitutions (Q1854398) (← links)
• Linear concurrent constraint programming: Operational and phase semantics (Q1854410) (← links)
• MELL in the calculus of structures (Q1884903) (← links)
• A note on the proof theory of the \(\lambda \Pi\)-calculus (Q1891931) (← links)
• Logical approximation for program analysis (Q1929363) (← links)
• From axioms to synthetic inference rules via focusing (Q2120974) (← links)
• A coinductive approach to proof search through typed lambda-calculi (Q2231698) (← links)
• Focused proof-search in the logic of bunched implications (Q2233409) (← links)
• Mechanized metatheory revisited (Q2323447) (← links)
• Formalizing adequacy: a case study for higher-order abstract syntax (Q2392483) (← links)