Pages that link to "Item:Q2640596"
From MaRDI portal
The following pages link to Uniform proofs as a foundation for logic programming (Q2640596):
Displaying 11 items.
- The practice of logical frameworks (Q5878905) (← links)
- Least and Greatest Fixed Points in Linear Logic (Q5892168) (← links)
- Proofs as computations in linear logic (Q5941199) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- An ecumenical notion of entailment (Q6067097) (← links)
- Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic (Q6067745) (← links)
- Towards substructural property-based testing (Q6102253) (← links)
- Encoding a dependent-type λ-calculus in a logic programming language (Q6488533) (← links)
- Reductive logic, proof-search, and coalgebra: a perspective from resource semantics (Q6612799) (← links)
- Focusing Gentzen's LK proof system (Q6612872) (← links)
- Partial proof terms in the study of idealized proof search (Q6648177) (← links)