ON INCOMPARABILITY OF INTERPRETATION ALGORITHMS OF TYPED FUNCTIONAL PROGRAMS WITH RESPECT TO UNDEFINED VALUE

D.A. Grigoryan

doi:10.46991/PYSU:A/2018.52.2.109

ON INCOMPARABILITY OF INTERPRETATION ALGORITHMS OF TYPED FUNCTIONAL PROGRAMS WITH RESPECT TO UNDEFINED VALUE

Authors

D.A. Grigoryan Chair of Programming and Information Technologies, YSU, Armenia

DOI:

https://doi.org/10.46991/PYSU:A/2018.52.2.109

Keywords:

typed functional program, canonical $ \delta $-reduction, interpretation algorithm, $ \perp $-incomparability

Abstract

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 ($ \perp $-incomparable).

Downloads

Published

2018-08-15

How to Cite

Grigoryan, D. (2018). ON INCOMPARABILITY OF INTERPRETATION ALGORITHMS OF TYPED FUNCTIONAL PROGRAMS WITH RESPECT TO UNDEFINED VALUE. Proceedings of the YSU A: Physical and Mathematical Sciences, 52(2 (246), 109–118. https://doi.org/10.46991/PYSU:A/2018.52.2.109