Geodesic
On incomparability of interpretation algorithms of typed functional programs with respect to undefined value
Proceedings of the Yerevan State University. Physical and mathematical sciences, Tome 52 (2018) no. 2, pp. 109-118.

Voir la notice de l'article provenant de la source Math-Net.Ru

In the paper the interpretation algorithms of typed functional programs are considered. The interpretation algorithm is based on substitution, $\beta$-reduction and canonical $\delta$-reduction. It is shown that seven known interpretation algorithms (FS (of full substitution), PES (of parallel external substitution), LES (of left external substitution), PIS (of parallel inner substitution), LIS (of left inner substitution), ACT (active algorithm), PAS (passive algorithm)) are pairwise incomparable with respect to undefined value ($\bot$-incomparable).
Keywords: typed functional program, canonical $\delta$-reduction, interpretation algorithm, $\bot$-incomparability. 
@article{UZERU_2018_52_2_a5,
     author = {D. A. Grigoryan},
     title = {On incomparability of interpretation algorithms of typed functional programs with respect to undefined value},
     journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
     pages = {109--118},
     publisher = {mathdoc},
     volume = {52},
     number = {2},
     year = {2018},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/UZERU_2018_52_2_a5/}
}
TY  - JOUR
AU  - D. A. Grigoryan
TI  - On incomparability of interpretation algorithms of typed functional programs with respect to undefined value
JO  - Proceedings of the Yerevan State University. Physical and mathematical sciences
PY  - 2018
SP  - 109
EP  - 118
VL  - 52
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/UZERU_2018_52_2_a5/
LA  - en
ID  - UZERU_2018_52_2_a5
ER  - 
%0 Journal Article
%A D. A. Grigoryan
%T On incomparability of interpretation algorithms of typed functional programs with respect to undefined value
%J Proceedings of the Yerevan State University. Physical and mathematical sciences
%D 2018
%P 109-118
%V 52
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/UZERU_2018_52_2_a5/
%G en
%F UZERU_2018_52_2_a5
D. A. Grigoryan. On incomparability of interpretation algorithms of typed functional programs with respect to undefined value. Proceedings of the Yerevan State University. Physical and mathematical sciences, Tome 52 (2018) no. 2, pp. 109-118. http://geodesic.mathdoc.fr/item/UZERU_2018_52_2_a5/

[1] S. A. Nigiyan, “Functional Languages”, Programming and Computer Software, 17:5 (1992), 290–297

[2] S. A. Nigiyan, “On non-classical theory of computability”, Proceedings of the YSU, Physics Mathematics, 2015, no. 1, 52–60 | Zbl

[3] S. A. Nigiyan, T. V. Khondkaryan, “On canonical notion of $\delta$-reduction and on translation of typed $\lambda$-terms into untyped $\lambda$-terms”, Proceedings of the YSU, Physics Mathematics, 51:1 (2017), 46–52 | Zbl

[4] R. Yu. Hakopian, “On procedural semantics of strong typed functional programs”, Proceedings of the YSU, Physics Mathematics, 2008, no. 3, 59–69 (in Russian)