2

Concerning formulas of the types A!BC, A!(Ex)B(x) in intuitionistic formal systems
– R Harrop
 1960

2

The proper treatement of quantification in ordinary English
– R Montague
 1974

2

Implementing Theorem
– A Felty
 1987

169

A unification algorithm for typed calculus
– G Huet
 1975

25

Extending definite clause grammars with scoping constructs
– Remo Pareschi, Dale Miller
 1990

17

Higherorder Unification with Dependent Function Types
– Conal M. Elliott
 1989

33

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

66

Implementing Tactics and Tacticals in a HigherOrder Logic Programming Language
– Amy Felty
 1993

56

Typed Prolog: A semantic reconstruction of the MycroftOâ€™Keefe type system
– T K Lakshman, U S Reddy
 1991

109

Ellipsis and higherorder unification
– Mary Dalrymple, Stuart M. Shieber, Fernando C. N. Pereira
 1991

46

Specifying and Implementing Theorem Provers in a HigherOrder Logic Programming Language
– Amy P. Felty, Dale Miller, Jean Gallier, Amy P. Felty, Supervisor Dale Miller
 1989

35

A SemiFunctional Implementation of a HigherOrder Logic Programming Language
– Conal Elliott, Frank Pfenning
 1991

77

On sentences which are true on direct unions of algebras
– A Horn
 1951

302

Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the ChurchRosser Theorem
– N. G. De Bruijn
 1972

86

A MultipleConclusion MetaLogic
– Dale Miller
 1994

56

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

1858

Foundation of Logic Programming
– J W Lloyd
 1987

374

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

445

The formulaeastypes notion of construction
– W A Howard
 1980
