|
334
|
Uniform proofs as a foundation for logic programming
– Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov
- 1991
|
|
176
|
An Overview of *Prolog
– G Nadathur, D Miller
- 1988
|
|
62
|
Specifying theorem provers in a higher-order logic programming language
– A Felty, D Miller
- 1988
|
|
729
|
A formulation of the simple theory of types
– A Church
- 1940
|
|
169
|
A unification algorithm for typed -calculus
– G'erard Huet
- 1975
|
|
62
|
Lexical scoping as universal quantification
– Dale Miller
- 1989
|
|
43
|
Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language
– Amy Felty
- 1989
|
|
209
|
Investigations into logical deduction
– G Gentzen
- 1969
|
|
269
|
Higher-order abstract syntax
– Frank Pfenning, Conal Elliott
- 1988
|
|
79
|
Partial polymorphic type inference and higher-order unification
– Frank Pfenning
- 1988
|
|
136
|
A logical analysis of modules in logic programming. The
– Dale Miller
- 1989
|
|
201
|
Linear Objects: logical processes with built-in inheritance
– Jean-marc Andreoli, Remo Pareschi
|
|
84
|
An Overview of λProlog
– Gopalan Nadathur, Dale Miller
- 1988
|
|
386
|
The Foundation of a Generic Theorem Prover
– Lawrence C. Paulson
- 1989
|
|
31
|
A higher-order logic as the basis for logic programming
– G Nadathur
- 1987
|
|
142
|
Proving and applying program transformations expressed with second-order patterns
– G'erard Huet, Bernard Lang
- 1978
|
|
97
|
A unification algorithm for typed λ-calculus
– G P Huet
- 1975
|
|
283
|
Logic Programming in a Fragment of Intuitionistic Linear Logic: Extended Abstract
– Joshua S. Hodas, Dale Miller
- 1991
|
|
32
|
A Semi-Functional Implementation of a Higher-Order Logic Programming Language
– Conal Elliott, Frank Pfenning
- 1991
|
