Extensional Models for Polymorphism

@inproceedings{Tannen1987ExtensionalMF,
  title={Extensional Models for Polymorphism},
  author={Val Tannen and Thierry Coquand},
  booktitle={TAPSOFT, Vol.2},
  year={1987}
}
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

References

Publications referenced by this paper.
Showing 1-10 of 38 references

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
ACM, New York, August • 1986
View 6 Excerpts
Highly Influenced

The Semantics of Second Order Polymorphic Lambda Calculus

Semantics of Data Types • 1984
View 4 Excerpts
Highly Influenced

Conservative extensions of type theories

V. Breazu-Tannen
PhD thesis, Massachusetts Institute of Technology, • 1987

Hyland

M. EJ.
A small complete category. • 1987
View 1 Excerpt

Ieee

J . C. Mitchell, E. Moggi. Kripke-style models for typed lambda calcul Science
June • 1987
View 2 Excerpts

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

V. Breazu-Tannen, A. R. Meyer. Computable values can be classical
pages 238-245, ACM, January • 1987
View 2 Excerpts

Polymorphism is Set Theoretic, Constructively

Category Theory and Computer Science • 1987

Similar Papers

Loading similar papers…