146

Proving and applying program transformations expressed with secondorder patterns
– G Huet, B Lang
 1978

114

A unification algorithm for typed λcalculus
– G Huet
 1975

302

Higherorder abstract syntax
– F Pfenning, C Elliott
 1988

696

A Framework for Defining Logics
– Robert Harper , Furio Honsell, Gordon Plotkin
 1993

70

Specifying theorem provers in a higherorder logic programming language
– Amy Felty, Dale Miller
 1988

854

A formulation of the simple theory of types
– Alonzo Church
 1940

99

An Overview of λProlog
– Gopalan Nadathur, Dale Miller
 1988

33

A HigherOrder Logic as the Basis for Logic Programming
– G Nadathur
 1987

374

Uniform proofs as a foundation for logic programming
– Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov
 1991

80

Partial polymorphic type inference and higherorder unification
– Frank Pfenning
 1988

169

A unification algorithm for typed calculus
– G Huet
 1975

49

A Logic Programming Approach To Manipulating Formulas And Programs
– Dale Miller, Gopalan Nadathur
 1994

27

Uses of higherorder unification for implementing program transformers
– J Hannan, D Miller
 1988

422

The Foundation of a Generic Theorem Prover
– Lawrence C. Paulson
 1989

132

The undecidability of the secondorder unification problem
– W D Goldfarb
 1981

176

An overview of prolog
– D Miller, G Nadathur
 1988

167

Logic and Computation: Interactive Proof with Cambridge LCF
– L C Paulson
 1987

56

Unification of simply typed lambdaterms as logic programming
– Dale Miller
 1991

311

An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof (2nd Ed
– Peter B Andrews
 2002
