Higher-Order Horn Clauses (1990)

by Gopalan Nadathur , Dale Miller
Venue:JOURNAL OF THE ACM
Citations:60 - 19 self

Documents Related by Co-Citation

373 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
176 An overview of -prolog – D Miller, G Nadathur - 1988
70 Specifying theorem provers in a higherorder logic programming language – Amy Felty, Dale Miller - 1988
845 A Formulation of the Simple Theory of Types – A Church - 1940
169 A unification algorithm for typed -calculus – G Huet - 1975
64 Lexical scoping as universal quantification – Dale Miller - 1989
46 Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language – Amy P. Felty, Dale Miller, Jean Gallier, Amy P. Felty, Supervisor Dale Miller - 1989
259 Investigations into logical deduction – G Gentzen - 1969
301 Higher-order abstract syntax – Frank Pfenning, Conal Elliott
80 Partial polymorphic type inference and higher-order unification – Frank Pfenning - 1988
147 A logical analysis of modules in logic programming – Dale Miller - 1989
418 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
205 Linear Objects: logical processes with built-in inheritance – Jean-Marc Andreoli, Remo Pareschi - 1990
99 An Overview of λProlog – Gopalan Nadathur, Dale Miller - 1988
33 A Higher-Order Logic as the Basis for Logic Programming – G Nadathur - 1987
145 Proving and Applying Program Transformation Expressed with Second-Order Patterns – G Huet, B Lang - 1978
113 A unification algorithm for typed λ-calculus – G Huet - 1975
20 Gopalan Nadathur. A logic programming approach to manipulating formulas and programs – Dale Miller - 1987
35 A Semi-Functional Implementation of a Higher-Order Logic Programming Language – Conal Elliott, Frank Pfenning - 1991