Higher-order Horn clauses
From MaRDI portal
Publication:3495673
DOI10.1145/96559.96570zbMATH Open0711.68091OpenAlexW2169526198MaRDI QIDQ3495673FDOQ3495673
Authors: Gopalan Nadathur, Dale Miller 
Publication date: 1990
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cis_reports/847
Recommendations
Cited In (27)
- A new framework for declarative programming
- A survey of GCLA: a definitional approach to logic programming
- Logic Based Program Synthesis and Transformation
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
- A semantics for \(\lambda \)Prolog
- Proof-theoretic and higher-order extensions of logic programming
- Higher-order logic learning and \(\lambda\)Progol
- Unification with extended patterns
- Title not available (Why is that?)
- HORNLOG: A graph-based interpreter for general Horn clauses
- On the algebraic structure of declarative programming languages
- Uniform proofs as a foundation for logic programming
- Title not available (Why is that?)
- Cut-elimination for a logic with definitions and induction
- 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
- HoCHC: a refutationally complete and semantically invariant system of higher-order logic modulo theories
- Title not available (Why is that?)
- Implementing tactics and tacticals in a higher-order logic programming language
- Unification under a mixed prefix
- Theory of logic programming. An elementary introduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
