ON TRANSLATION OF TYPED FUNCTIONAL PROGRAMS INTO UNTYPED FUNCTIONAL PROGRAMS

Authors

  • S.A. Nigiyan Chair of Programming and Information Technologies, YSU, Armenia
  • T.V. Khondkaryan Cair of Programming and Information Technologies, YSU, Armenia

DOI:

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

Keywords:

typed functional program, untyped functional program, basic semantics, translation, l-definability

Abstract

In this paper typed and untyped functional programs are considered. Typed functional programs use variables of any order and constants of order $\le$1, where constants of order 1 are strong computable, $\lambda$-definable functions with indeterminate values of arguments. The basic semantics of a typed functional program is a function with indeterminate values of arguments, which is the main component of its least solution. The basic semantics of an untyped functional program is an untyped $\lambda$-term, which is defined by means of a fixed point combinator. An algorithm that translates typed functional program $P$ into untyped functional program $P'$ is suggested. It is proved that the basic semantics of the program $P'$ $\lambda$-defines the basic semantics of the program $P$.

Downloads

Published

2017-06-15

How to Cite

Nigiyan, S., & Khondkaryan, T. (2017). ON TRANSLATION OF TYPED FUNCTIONAL PROGRAMS INTO UNTYPED FUNCTIONAL PROGRAMS. Proceedings of the YSU A: Physical and Mathematical Sciences, 51(2 (243), 177–186. https://doi.org/10.46991/PYSU:A/2017.51.2.177

Issue

Section

Informatics