Pages that link to "Item:Q2640596"
From MaRDI portal
The following pages link to Uniform proofs as a foundation for logic programming (Q2640596):
Displayed 37 items.
- Forum: A multiple-conclusion specification logic (Q671512) (← 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)
- 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)
- On structuring proof search for first order linear logic (Q2503319) (← links)
- Non-commutative proof construction: a constraint-based approach (Q2503402) (← links)
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols (Q2643568) (← links)
- 2004 Summer Meeting of the Association for Symbolic Logic (Q3370624) (← links)
- A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (Q3540178) (← links)
- The Abella Interactive Theorem Prover (System Description) (Q3541698) (← links)
- The Logic of Bunched Implications (Q4262604) (← links)
- (Q4499269) (← links)
- Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation (Q5458443) (← links)
- Towards Ludics Programming: Interactive Proof Search (Q5504660) (← links)
- Least and Greatest Fixed Points in Linear Logic (Q5892168) (← links)
- Proofs as computations in linear logic (Q5941199) (← links)