ON MAIN CANONICAL NOTION OF $ \delta $-REDUCTION

D.A. Grigoryan

doi:10.46991/PYSU:A/2018.52.3.191

ON MAIN CANONICAL NOTION OF $ \delta $-REDUCTION

Authors

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

DOI:

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

Keywords:

main canonical notion, $ \delta $-reduction, $ \beta\delta $-reduction, normal form

Abstract

In this paper the main canonical notion of $ \delta $-reduction is considered. Typed $ \lambda $-terms use variables of any order and constants of order $ \leq 1 $, where constants of order 1 are strongly computable, monotonic functions with indeterminate values of arguments. The canonical notion of $ \delta $-reduction is the notion of $ \delta $-reduction that is used in the implementation of functional programming languages. For main canonical notion of d-reduction the uniqueness of $ \beta\delta $-normal form of typed $ \lambda $-terms is shown.

Downloads

Published

2018-12-17

How to Cite

Grigoryan, D. (2018). ON MAIN CANONICAL NOTION OF $ \delta $-REDUCTION. Proceedings of the YSU A: Physical and Mathematical Sciences, 52(3 (247), 191–199. https://doi.org/10.46991/PYSU:A/2018.52.3.191