A completeness result for a realisability semantics for an intersection type system

The | lambda-Calculus.

Harold T. Hodes, Henk Barendregt · The Philosophical Review · 1988 · 567 citations

A filter lambda model and the completeness of type assignment

Henk Barendregt, Mario Coppo, Mariangiola Dezani-Ciancaglini · Journal of Symbolic Logic · 1983 · 496 citations

Computing, Computer Science, Logic +13

An extension of the basic functionality theory for the $\lambda$-calculus.

Massimiliano Coppo, Mariangiola Dezani-Ciancaglini · Notre Dame Journal of Formal Logic · 1980 · 276 citations · Full text

Computing, Computer Science, Formal Methods +10

The completeness theorem for typing λ-terms

Roger Hindley · Theoretical Computer Science · 1983 · 100 citations

Computing, Computer Science, Formal Methods +11

Curry's type-rules are complete with respect to the F-semantics too

Roger Hindley · Theoretical Computer Science · 1983 · 30 citations

Computing, Computer Science, Logic +9