We present a general method for constructing extensional models for the Girard-Reynolds polymorphic lambda calculus the polymorphic extensional collapse. The method yields models that satisfy additional, computationally motivated constraints like having only two polymorphic booleans and having only the numerals as polymorphic integers. Moreover, the method can be used to show that any simply typed lambda model can be fully and faithfully embedded into a model of the polymorphic lambda calculusâ€¦Â CONTINUE READING

In Proceedings of the 14th Symposium on Principles of Progmrnming Languages

A. R. Meyer, J . C. Mitchell, E. Moggi, R. Statman. Empty types in polymorphic A-calculus

pages 253-262, ACM, January â€¢ 1987

View 5 Excerpts

Highly Influenced

pages 308-319

J . C. Mitchell. A type-inference approach to reduct properties, semantics of polymorphic expressions. In Proceedings of the LISP, Functional Programming Conference