论文信息 - Polymorphism is not Set-Theoretic

Polymorphism is not Set-Theoretic

The polymorphic, or second-order, typed lambda calculus is an extension of the typed lambda calculus in which polymorphic functions can be defined. In this paper, we will prove that the standard set-theoretic model of the ordinary typed lambda calculus cannot be extended to model this language extension.

John C. Reynolds | J. C. Reynolds

[1] M. Arbib,et al. Arrows, Structures, and Functors: The Categorical Imperative , 1975 .

[2] John C. Reynolds,et al. Types, Abstraction and Parametric Polymorphism , 1983, IFIP Congress.

[3] John C. Reynolds,et al. Towards a theory of type structure , 1974, Symposium on Programming.

[4] Daniel Leivant,et al. The Expressiveness of Simple and Second-Order Type Structures , 1983, JACM.

[5] Nancy Jean Mccracken,et al. An investigation of a programming language with a polymorphic type structure. , 1979 .

[6] R. E. A. Mason,et al. Information Processing 83 , 1984 .

[7] Nancy J. McCracken. A finitary retract model for the polymorphic lambda-calculus , 1982 .

[8] Gordon D. Plotkin,et al. The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).