Unsolvability of type correctness problem for functional programs
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2011), pp. 28-35
Cet article a éte moissonné depuis la source Math-Net.Ru
In the present paper the type correctness problem is considered for functional programs without the type information. The aim of this research is to prove that there is no algorithm to reject all programs, during execution of which the type error would occur and accept all programs, during execution of which the type error would not occur.
Keywords:
redex, reduction strategy, type error.
Mots-clés : term
Mots-clés : term
@article{UZERU_2011_1_a5,
author = {A. H. Arakelyan},
title = {Unsolvability of type correctness problem for functional programs},
journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
pages = {28--35},
year = {2011},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/UZERU_2011_1_a5/}
}
TY - JOUR AU - A. H. Arakelyan TI - Unsolvability of type correctness problem for functional programs JO - Proceedings of the Yerevan State University. Physical and mathematical sciences PY - 2011 SP - 28 EP - 35 IS - 1 UR - http://geodesic.mathdoc.fr/item/UZERU_2011_1_a5/ LA - en ID - UZERU_2011_1_a5 ER -
A. H. Arakelyan. Unsolvability of type correctness problem for functional programs. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2011), pp. 28-35. http://geodesic.mathdoc.fr/item/UZERU_2011_1_a5/