Natural deduction as higher-order resolution

A theory of type polymorphism in programming

Robin Milner · Journal of Computer and System Sciences · 1978 · 2.2K citations · Full text

Computing, Computer Science, Programming Languages +11

Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem

N.G. de Bruijn · Indagationes Mathematicae (Proceedings) · 1972 · 925 citations

Computing, Computer Science, Mathematics +15

A unification algorithm for typed λ-calculus

G. Huet · Theoretical Computer Science · 1975 · 509 citations

Computing, Computer Science, Programming Languages +10

Proving and applying program transformations expressed with second-order patterns

Bernard Lang · Acta Informatica · 1978 · 285 citations · Full text

Computing, Computer Engineering, Computer Science +12

The undecidability of the second-order unification problem

Warren Goldfarb · Theoretical Computer Science · 1981 · 280 citations

Computing, Computer Science, Algorithms +8