Higher-order logic programming

by Gopalan Nadathur , Dale Miller
Venue:HANDBOOK OF LOGIC IN AI AND LOGIC PROGRAMMING, VOLUME 5: LOGIC PROGRAMMING. OXFORD (1998
Citations:153 - 16 self

Documents Related by Co-Citation

845 A Formulation of the Simple Theory of Types – A Church - 1940
373 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
33 A Higher-Order Logic as the Basis for Logic Programming – G Nadathur - 1987
147 A logical analysis of modules in logic programming – Dale Miller - 1989
695 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
301 Higher-order abstract syntax – Frank Pfenning, Conal Elliott
707 The Semantics of Predicate Logic as a Programming Language – M. H. Van Emden, R. A. Kowalski - 1976
70 Specifying theorem provers in a higherorder logic programming language – Amy Felty, Dale Miller - 1988
66 Implementing Tactics and Tacticals in a Higher-Order Logic Programming Language – Amy Felty - 1993
176 An overview of -prolog – D Miller, G Nadathur - 1988
14 NU-Prolog reference manual, version 1.3 – J A Thom, J A Zobel - 1988
99 An Overview of ╬╗Prolog – Gopalan Nadathur, Dale Miller - 1988
287 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
64 Lexical scoping as universal quantification – Dale Miller - 1989
169 A unification algorithm for typed -calculus – G Huet - 1975
614 Light Linear Logic – Jean-yves Girard
77 Elf: A Language for Logic Definition and Verified Metaprogramming – Frank Pfenning - 1989
182 Isabelle: The next 700 theorem provers – L C Paulson - 1990
441 The formulae-as-types notion of construction – W A Howard - 1980