|
97
|
A unification algorithm for typed λ-calculus
– G P Huet
- 1975
|
|
728
|
A formulation of the simple theory of types
– A Church
- 1940
|
|
142
|
Proving and applying program transformations expressed with second-order patterns
– G P Huet, B Lang
- 1978
|
|
269
|
Higher-order abstract syntax
– Frank Pfenning, Conal Elliott
- 1988
|
|
62
|
Specifying theorem provers in a higher-order logic programming language
– A Felty, D Miller
- 1988
|
|
31
|
A higher-order logic as the basis for logic programming
– G Nadathur
- 1987
|
|
84
|
An Overview of λProlog
– Gopalan Nadathur, Dale Miller
- 1988
|
|
387
|
The Foundation of a Generic Theorem Prover
– Lawrence C. Paulson
- 1989
|
|
79
|
Partial polymorphic type inference and higher-order unification
– Frank Pfenning
- 1988
|
|
634
|
A Framework for Defining Logics
– Robert Harper , Furio Honsell, Gordon Plotkin
- 1993
|
|
157
|
Logic and Computation: Interactive proof with Cambridge LCF
– Lawrence C Paulson
- 1987
|
|
335
|
Uniform proofs as a foundation for logic programming
– Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov
- 1991
|
|
124
|
The undecidability of the second-order unification problem
– W D Goldfarb
- 1981
|
|
173
|
Isabelle: The next 700 theorem provers
– L C Paulson
- 1990
|
|
279
|
An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof
– Peter B Andrews
- 1986
|
|
169
|
A unication algorithm for typed calculus
– G Huet
- 1975
|
|
26
|
Uses of higher-order unification for implementing program transformers
– J Hannan, D Miller
- 1988
|
|
43
|
A Logic Programming Approach To Manipulating Formulas And Programs
– Dale Miller, Gopalan Nadathur
- 1994
|
|
271
|
A logic programming language with lambda-abstraction, function variables, and simple unification
– Dale Miller
- 1990
|
