scientific article; zbMATH DE number 3988745
From MaRDI portal
Publication:3751042
zbMATH Open0611.68057MaRDI QIDQ3751042FDOQ3751042
Authors: Gopalan Nadathur, Dale Miller 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
undecidabilitylogic programminghigher-order unificationdefinite clausesHorn-clause programsPROLOG-type interpreter
Cited In (28)
- Title not available (Why is that?)
- Logic programs with equational type specifications
- Refinement of Higher-Order Logic Programs
- Horn clause programs with polymorphic types: Semantics and resolution
- Higher order E-unification
- Title not available (Why is that?)
- Title not available (Why is that?)
- A semantics for \(\lambda \)Prolog
- Mechanized metatheory revisited
- Expressing combinatory reduction systems derivations in the rewriting calculus
- Reasoning with higher-order abstract syntax in a logical framework
- Uniform proofs as a foundation for logic programming
- Coalgebraic semantics for parallel derivation strategies in logic programming
- HiLog: A foundation for higher-order logic programming
- Higher-order quantification and proof search
- Higher-order Horn clauses
- Encoding generic judgments: preliminary results
- HoCHC: a refutationally complete and semantically invariant system of higher-order logic modulo theories
- Making PVS accessible to generic services by interpretation in a universal format
- Implementing type theory in higher order constraint logic programming
- Programming with higher-order logic.
- Simple second-order languages for which unification is undecidable
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The expressive power of higher-order Datalog
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- A unification algorithm for second-order monadic terms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751042)
