Skip to main content
Conference Proceedings

Polymorphism is not set-theoretic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1984) 173 LNCS 145-156
DOI: 10.1007/3-540-13346-1_7
103Citations
Citations of this article
53Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Reynolds, J. C. (1984). Polymorphism is not set-theoretic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 173 LNCS, pp. 145–156). Springer Verlag. https://doi.org/10.1007/3-540-13346-1_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free