The following pages link to Logic Programming (Q5313189):
Displayed 20 items.
- Constraint logic programming with a relational machine (Q511023) (← links)
- Equivariant unification (Q616849) (← links)
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions (Q714797) (← links)
- Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms (Q964000) (← links)
- A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets (Q1006642) (← links)
- On the algebraic structure of declarative programming languages (Q1035699) (← links)
- Nominal equational problems (Q2233392) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Encoding abstract syntax without fresh names (Q2392477) (← links)
- Nominal syntax with atom substitutions (Q2662669) (← links)
- Executable Relational Specifications of Polymorphic Type Systems Using Prolog (Q2798266) (← links)
- Nominal Equational Logic (Q2864152) (← links)
- Implementing Nominal Unification (Q2867897) (← links)
- Declarative Compilation for Constraint Logic Programming (Q2949715) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- Two-level Lambda-calculus (Q4982628) (← links)
- A Certified Functional Nominal C-Unification Algorithm (Q5097631) (← links)
- α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic (Q5504659) (← links)
- Nominal Unification from a Higher-Order Perspective (Q5892169) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)