Skip to main content
Conference Proceedings

A categorical approach to realizability and polymorphic types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 298 LNCS 23-42
DOI: 10.1007/3-540-19020-1_2
36Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A categorical calculus of relations is used to derive a unified setting for higher order logic and polymorphic lambda calculus.

Cite

CITATION STYLE

APA

Carboni, A., Freyd, P. J., & Scedrov, A. (1988). A categorical approach to realizability and polymorphic types. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 298 LNCS, pp. 23–42). Springer Verlag. https://doi.org/10.1007/3-540-19020-1_2

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