The following pages link to Higher-order Horn clauses (Q3495673):
Displaying 15 items.
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? (Q979076) (← links)
- On the algebraic structure of declarative programming languages (Q1035699) (← links)
- Unification under a mixed prefix (Q1201348) (← links)
- Theory of logic programming. An elementary introduction (Q1202019) (← links)
- Unification with extended patterns (Q1274966) (← 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)
- A semantics for \(\lambda \)Prolog (Q1349686) (← links)
- A new framework for declarative programming (Q1399960) (← links)
- Cut-elimination for a logic with definitions and induction (Q1575931) (← links)
- Uniform proofs as a foundation for logic programming (Q2640596) (← links)
- (Q4499256) (← links)
- Encryption as an abstract data-type (Q4924525) (← links)
- Logic Based Program Synthesis and Transformation (Q5713940) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
