Extensional models for polymorphism
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
Categories, types, and structures: an introduction to category theory for the working computer scientist
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Full abstraction for idealized Algol with passive expressions
Theoretical Computer Science - Special issue on linear logic, 1
Axioms for definability and full completeness
Proof, language, and interaction
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Hereditarily Sequential Functionals
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Polymorphism is Set Theoretic, Constructively
Category Theory and Computer Science
Linear Logic, Monads and the Lambda Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Games and Full Abstraction for FPC
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Full abstraction for functional languages with control
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We present axioms on models of system F, which are sufficient to show full completeness for ML-polymorphic types. These axioms are given for hyperdoctrine models, which arise as adjoint models, i.e. co-Kleisli categories of linear categories. Our axiomatization consists of two crucial steps. First, we axiomatize the fact that every relevant morphism in the model generates, under decomposition, a possibly infinite typed Böhm tree. Then, we introduce an axiom which rules out infinite trees from the model. Finally, we discuss the necessity of the axioms.