On procedural semantics of strong typed functional programs
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 3 (2008), pp. 59-69
Cet article a éte moissonné depuis la source Math-Net.Ru
The paper is devoted to procedural semantics of strong typed functional programs that are based on interpretation algorithms. These algorithms use three operations: substitution, one-step $\beta$-reduction and one-step $\delta$-reduction. It is proved that the procedural semantics, based on any of such algorithms are consistent. It is also proved that procedural semantics, based on sevеral interpretation algorithms are incomparable.
@article{UZERU_2008_3_a8,
author = {R. Yu. Hakopian},
title = {On procedural semantics of strong typed functional programs},
journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
pages = {59--69},
year = {2008},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/UZERU_2008_3_a8/}
}
TY - JOUR AU - R. Yu. Hakopian TI - On procedural semantics of strong typed functional programs JO - Proceedings of the Yerevan State University. Physical and mathematical sciences PY - 2008 SP - 59 EP - 69 IS - 3 UR - http://geodesic.mathdoc.fr/item/UZERU_2008_3_a8/ LA - ru ID - UZERU_2008_3_a8 ER -
R. Yu. Hakopian. On procedural semantics of strong typed functional programs. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 3 (2008), pp. 59-69. http://geodesic.mathdoc.fr/item/UZERU_2008_3_a8/
[1] S. A. Nigiyan, “Funktsionalnye yazyki”, Programmirovanie, 1991, no. 5, 77–86 | Zbl
[2] S. A. Nigiyan, “On the interpretation of functional programming languages”, Programmirovanie, 1993, no. 2, 58–68 | MR | Zbl
[3] L. E. Budagyan, “O formalizatsii ponyatiya delta reduktsii v monotonnykh modelyakh tipovogo lyambda-ischisleniya”, Uchenye zapiski EGU, 2003, no. 1, 27–36