A.S. Troelstra, Notes on second order arithmetic, in : Mathias and Rogers, eds., Cambridge Summer Scool in mathematical Logic, Lecture Notes in Mathematics 337, p. 171-205, Springer Verlag 1973. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Building continuous webbed models for System F - Berardi, Berline (2000) (1 citation) (Correct)
....in our setting. Webbed models vs realizability and PER models . It is worth to say a word about realizability and PER models, since these models are successfully used to study some programming aspects of F , and since Girard s rst model of F was Troelstra s realizability model HRO 2 ( 14] 15] [35]) However these models are rather orthogonal to ours since, as already mentioned, they realize few polymorphic maps while ours are polymax 6 . A connection with intersection type systems. We end with a brief connection with intersection type systems. Engeler s model is transparently equivalent ....
A.S. Troelstra, Notes on second order arithmetic, in : Mathias and Rogers, eds., Cambridge Summer Scool in mathematical Logic, Lecture Notes in Mathematics 337, p. 171-205, Springer Verlag 1973.
Building continuous webbed models for System F - Berardi, Berline (1998) (1 citation) (Correct)
....in our setting. Webbed models vs realizability and PER models . It is worth to say a word about realizability and PER models, since these models are successfully used to study some programming aspects of F , and since Girard s rst model of F was Troelstra s realizability model HRO 2 ( 14] 15] [34]) However these models are rather orthogonal to ours since, as already mentioned, they realize few polymorphic maps while ours are polymax 6 . A connection with intersection type systems. We end with a brief connection with intersection type systems. Engeler s model is transparently equivalent ....
A.S. Troelstra, Notes on second order arithmetic, in : Mathias and Rogers, eds., Cambridge Summer Scool in mathematical Logic, Lecture Notes in Mathematics 337, p. 171-205, Springer Verlag 1973.
βη-complete models for system F - Berardi, Berline (1998) (Correct)
....the (more or less concrete) models of polymorphism we already have. We will justify the choice of a particular model to study. Eventually, we will explain our contribution to the topic. Models of polymorphic maps. In realizability or PER models of F , which originate in Girard and Troelstra [16] [31], polymorphic types are all realized by constant maps. Thus, a PER model, while it is a useful tool for studying the properties of F as a programming language, it is too restrictive for studying polymorphism in full generality. This last sentence also apply to parametric models, which require ....
A.S. Troelstra, Notes on second order arithmetic, in : Mathias and Rogers, eds., Cambridge Summer Scool in mathematical Logic, Lecture Notes in Mathematics 337, p. 171-205, Springer Verlag 1973.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC