scientific article
From MaRDI portal
Publication:3751042
zbMath0611.68057MaRDI QIDQ3751042
Gopalan Nadathur, Dale A. Miller
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilitylogic programminghigher-order unificationdefinite clausesHorn-clause programsPROLOG-type interpreter
Related Items (13)
Uniform proofs as a foundation for logic programming ⋮ Expressing combinatory reduction systems derivations in the rewriting calculus ⋮ A unification algorithm for second-order monadic terms ⋮ Logic programs with equational type specifications ⋮ Making PVS accessible to generic services by interpretation in a universal format ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ The Expressive Power of Higher-Order Datalog ⋮ Horn clause programs with polymorphic types: Semantics and resolution ⋮ Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming ⋮ Implementing type theory in higher order constraint logic programming ⋮ Mechanized metatheory revisited ⋮ Encoding Generic Judgments ⋮ Simple second-order languages for which unification is undecidable
This page was built for publication:
