Kripke Models and the (in)equational Logic of the Second-Order Lambda-Calculus

Kripke Models and the (in)equational Logic of the Second-Order Lambda-Calculus (1995)

by Jean Gallier

264	Interprétation Fonctionnelle et Élimination des Coupures dans l’Arithmétique d’Ordre Supérieure - Girard - 1972
231	Completeness in the theory of types. - Henkin - 1950
172	The system F of variable types, fifteen years later, - Girard - 1986
72	Equality between functionals - Friedman
71	Completeness of many-sorted equational logic - Goguen, Meseguer - 1985
70	Lambda definability in the full type hierarchy”, - Plotkin - 1980
53	Polymorphism is set-theoretic, constructively - Pitts - 1987
52	A Type-Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions (Summary - Mitchell - 1986
51	Kripke-style models for typed lambda calculus”, - Mitchell, Moggi - 1987
46	dI-domains as a model of polymorphism - Coquand, Gunter, et al. - 1987
18	Filter models with polymorphic types - Jacobs, Margaria, et al. - 1992
16	Equality between functionals revisited - Statman - 1985
14	Empty types in polymorphic lambda calculus (preliminary report - Meyer, Mitchell, et al.
11	A semantics for static type inference - Plotkin - 1993
10	Categorical semantics for higher-order polymorphic lambda calculus - Seely - 1987
9	Semantics of Programming Languages. Foundations of Computing - Gunter - 1992