Higher-order Horn clauses
From MaRDI portal
Publication:3495673
Recommendations
Cited in
(27)- A new framework for declarative programming
- A survey of GCLA: a definitional approach to logic programming
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
- Logic Based Program Synthesis and Transformation
- A semantics for Prolog
- Proof-theoretic and higher-order extensions of logic programming
- Higher-order logic learning and \(\lambda\)Progol
- Unification with extended patterns
- scientific article; zbMATH DE number 1508924 (Why is no real title available?)
- On the algebraic structure of declarative programming languages
- HORNLOG: A graph-based interpreter for general Horn clauses
- Uniform proofs as a foundation for logic programming
- Cut-elimination for a logic with definitions and induction
- scientific article; zbMATH DE number 1497833 (Why is no real title available?)
- Encryption as an abstract data-type (extended abstract)
- Higher-order quantification and proof search
- A treatment of higher-order features in logic programming
- A proof procedure for the logic of hereditary Harrop formulas
- scientific article; zbMATH DE number 3988745 (Why is no real title available?)
- Unification under a mixed prefix
- Implementing tactics and tacticals in a higher-order logic programming language
- HoCHC: a refutationally complete and semantically invariant system of higher-order logic modulo theories
- Theory of logic programming. An elementary introduction
- scientific article; zbMATH DE number 3992920 (Why is no real title available?)
- scientific article; zbMATH DE number 1692894 (Why is no real title available?)
- scientific article; zbMATH DE number 4053062 (Why is no real title available?)
- A Survey of the Proof-Theoretic Foundations of Logic Programming
This page was built for publication: Higher-order Horn clauses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495673)