On the type correctness of polymorphic $\lambda$-terms.~2
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2010), pp. 37-46
Voir la notice de l'article provenant de la source Math-Net.Ru
In this paper the polymorphic lambda terms are considered, where no type information is provided for the variables. The aim of this work is to prove that presented typification algorithm [1] typifies such terms in most common way.
Keywords:
type, skeleton, expansion, principal typing.
Mots-clés : term, constraint
Mots-clés : term, constraint
@article{UZERU_2010_1_a6,
author = {A. H. Arakelyan},
title = {On the type correctness of polymorphic $\lambda$-terms.~2},
journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
pages = {37--46},
publisher = {mathdoc},
number = {1},
year = {2010},
language = {en},
url = {http://geodesic.mathdoc.fr/item/UZERU_2010_1_a6/}
}
TY - JOUR AU - A. H. Arakelyan TI - On the type correctness of polymorphic $\lambda$-terms.~2 JO - Proceedings of the Yerevan State University. Physical and mathematical sciences PY - 2010 SP - 37 EP - 46 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/UZERU_2010_1_a6/ LA - en ID - UZERU_2010_1_a6 ER -
A. H. Arakelyan. On the type correctness of polymorphic $\lambda$-terms.~2. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2010), pp. 37-46. http://geodesic.mathdoc.fr/item/UZERU_2010_1_a6/