The system F of variable types, fifteen years later
Theoretical Computer Science
Domain theoretic models of polymorphism
Information and Computation
The semantics of second-order lambda calculus
Information and Computation
Retractions on dl-domains as a model for type:type
Information and Computation
Categories, types, and structures: an introduction to category theory for the working computer scientist
The genericity theorem and parametricity in the polymorphic &lgr;-calculus
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
A &kgr;-denotational semantics for map theory in ZFC + SI
Theoretical Computer Science
Uncountable limits and the lambda calculus
Nordic Journal of Computing
A Logic for Parametric Polymorphism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Categorical completeness results for the simply-typed lambda-calculus
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A Powerdomain for Countable Non-Determinism (Extended Abstract)
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
An investigation of a programming language with a polymorphic type structure.
An investigation of a programming language with a polymorphic type structure.
Parametric And Type-Dependent Polymorphism
Fundamenta Informaticae
Building continuous webbed models for system F
Theoretical Computer Science - Mathematical foundations of programming semantics
Effective λ-models versus recursively enumerable λ-theories
Mathematical Structures in Computer Science
Internal normalization, compilation and decompilation for system Fβη
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Internal models of system F for decompilation
Theoretical Computer Science
Lambda theories of effective lambda models
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
We show that Friedman's proof of the existence of non-trivial βη-complete models of λ→ can be extended to system F. We isolate a set of conditions that are sufficient to ensure βη-completeness for a model of F (and α-completeness at the level of types), and we discuss which class of models we get. In particular, the model introduced in Barbanera and Berardi (1997), having as polymorphic maps exactly all possible Scott continuous maps, is βη-complete, and is hence the first known complete non-syntactic model of F. In order to have a suitable framework in which to express the conditions and develop the proof, we also introduce the very natural notion of ‘polymax models’ of System F.