TY - JOUR
AU - Grigoryan, Davit A.
PY - 2021/12/10
Y2 - 2024/05/18
TI - On Dependence of Interpretation Algorithms of Typed Functional Programs on Canonical Notion of δ-Reduction
JF - Mathematical Problems of Computer Science
JA - MPCS
VL - 49
IS -
SE - Articles
DO - 10.51408/1963-0013
UR - http://mpcs.sci.am/index.php/mpcs/article/view/94
SP - 103-109
AB - <p>In this paper the interpretation algorithms of typed functional programs are considered. The interpretation algorithm is based on substitutions, β-reduction and canonical δ-reduction. The basic semantics of typed functional program is a function with indeterminate values of arguments, which is the main component of its least solution. If the value of the basic semantics for some values of arguments is indeterminate, then the interpretation algorithm either stops with the value ┴, or works endlessly. It is shown that seven known interpretation algorithms are ┴-depend on canonical notion of δ-reduction. Here are these 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).</p>
ER -