Uniform proofs as a foundation for logic programming (1991)

by Dale Miller , Gopalan Nadathur , Frank Pfenning , Andre Scedrov
Venue:ANNALS OF PURE AND APPLIED LOGIC
Citations:383 - 111 self

Active Bibliography

153 Higher-order logic programming – Gopalan Nadathur, Dale Miller
62 Higher-Order Horn Clauses – Gopalan Nadathur, Dale Miller - 1990
123 Unification under a mixed prefix – Dale Miller - 1992
Higher-Order Logic as the Basis for Logic Programming – Higher-order Horn Clauses, Gopalan Nadathur, Gopalan Nadathur, Dale Miller - 1989
305 Logic Programming in a Fragment of Intuitionistic Linear Logic – Joshua S. Hodas, Dale Miller
288 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
423 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
Sequent Calculus and the Specification of Computation Lecture Notes – C Dale Miller, Pond Lab - 2001
849 The Well-Founded Semantics for General Logic Programs – Kenneth A. Ross - 1991