P. Giannini, F. Honsell, and S. Ronchi Della Rocca. A strongly normalizable term having no type in the System F (second order -calculus). Rapporto interno, Univ. di Torino, 1987. 36 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Typability and Type Checking in System F Are Equivalent and.. - Wells (1998) (9 citations) (Correct)
....of arbitrarily chosen height, every level of the strati cation of System F in [GRDR91] types a larger set of terms than the previous level. As a nal example, the following slight modi cation of the term J is strongly normalizing but not typable in System F (the rst such term was given in [GHRDR87]) v: y: z:v(yy) yz) x:Kx(x(xv)v) w:ww) Figure 3 diagrams the relationships between various undecidable problems both for F as well as for the related systems F and F , with each arrow indicating a problem reduction. Dotted arrows are trivial reductions, the light dashed arrow is a folk ....
P. Giannini, F. Honsell, and S. Ronchi Della Rocca. A strongly normalizable term having no type in the System F (second order -calculus). Rapporto interno, Univ. di Torino, 1987. 36
Typability and Type Checking in the Second-Order lambda-Calculus.. - Wells (1996) (2 citations) (Correct)
....of arbitrarily chosen height, every level of the stratification of System F in [GRDR91] types a larger set of terms than the previous level. As a final example, the following slight modification of the term J is strongly fi normalizing but not typable in System F (the first such term was given in [GHRDR87]) v: y:z:v(yy) yz) x:Kx(x(xv)v) w:ww) Figure 3 diagrams the relationships between the various undecidable problems both for F as well as for the related systems F and F j, with each arrow indicating a problem reduction. Dotted arrows are trivial reductions, dashed arrows indicate a folk ....
P. Giannini, F. Honsell, and S. Ronchi Della Rocca. A strongly normalizable term having no type in the System F (second order -calculus). Rapporto interno, Univ. di Torino, 1987.
Typability and Type Checking in System F Are Equivalent and.. - Wells (1998) (9 citations) (Correct)
....of arbitrarily chosen height, every level of the strati cation of System F in [GRDR91] types a larger set of terms than the previous level. As a nal example, the following slight modi cation of the term J is strongly normalizing but not typable in System F (the rst such term was given in [GHRDR87]) v: y: z:v(yy) yz) x:Kx(x(xv)v) w:ww) Figure 3 diagrams the relationships between various undecidable problems both for F as well as for the related systems F and F , with each arrow indicating a problem reduction. Dotted arrows are trivial reductions, the light dashed arrow is a folk ....
P. Giannini, F. Honsell, and S. Ronchi Della Rocca. A strongly normalizable term having no type in the System F (second order -calculus). Rapporto interno, Univ. di Torino, 1987.
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