A characterization of lambda definability in categorical models of implicit polymorphism

https://doi.org/10.1016/0304-3975(94)00283-OGet rights and content
Under a Creative Commons license
open archive

Abstract

Lambda definability is characterized in categorical models of simply typed lambda calculus with type variables. A category-theoretic framework known as glueing or sconing is used to extend the Jung-Tiuryn (1993) characterization of lambda definability first to ccc models, and then to categorical models of the calculus with type variables.

Cited by (0)

Research supported by a graduate fellowship from the University of Pennsylvania Institute for Research in Cognitive Science.

*

Deceased 29 August 1994. An obituary appears in this issue. Correspondence to A. Scedrov, Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104, USA.