|
729
|
A formulation of the simple theory of types
– A Church
- 1940
|
|
31
|
A higher-order logic as the basis for logic programming
– G Nadathur
- 1987
|
|
334
|
Uniform proofs as a foundation for logic programming
– Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov
- 1991
|
|
136
|
A logical analysis of modules in logic programming. The
– Dale Miller
- 1989
|
|
641
|
The Semantics of Predicate Logic as a Programming Language
– M. H. Van Emden, R. A. Kowalski
- 1976
|
|
634
|
A Framework for Defining Logics
– Robert Harper , Furio Honsell, Gordon Plotkin
- 1993
|
|
62
|
Specifying theorem provers in a higher-order logic programming language
– A Felty, D Miller
- 1988
|
|
176
|
An Overview of *Prolog
– G Nadathur, D Miller
- 1988
|
|
15
|
NU-Prolog reference manual, version 1.3
– J A Thom, J Zobel
- 1988
|
|
269
|
Higher-order abstract syntax
– Frank Pfenning, Conal Elliott
- 1988
|
|
84
|
An Overview of λProlog
– Gopalan Nadathur, Dale Miller
- 1988
|
|
271
|
A logic programming language with lambda-abstraction, function variables, and simple unification
– Dale Miller
- 1990
|
|
62
|
Lexical scoping as universal quantification
– Dale Miller
- 1989
|
|
169
|
A unification algorithm for typed -calculus
– G'erard Huet
- 1975
|
|
70
|
Elf: A Language for Logic Definition and Verified Metaprogramming
– Frank Pfenning
- 1989
|
|
173
|
Isabelle: The next 700 theorem provers
– L C Paulson
- 1990
|
|
395
|
The formulae-as-types notion of constructions
– W A HOWARD
- 1980
|
|
154
|
Completeness in the theory of types
– L Henkin
- 1950
|
|
386
|
The Foundation of a Generic Theorem Prover
– Lawrence C. Paulson
- 1989
|
