$ \lambda $-DEFINABILITY OF BUILT-IN McCARTHY FUNCTIONS AS FUNCTIONS WITH INDETERMINATE VALUES OF ARGUMENTS

Authors

  • S.A. Nigiyan Chair of Programming and Information Technologies, YSU, Armenia

DOI:

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

Keywords:

built-in McCarthy functions, indeterminate values of arguments, $ \lambda $-definability

Abstract

The built-in functions of programming languages are functions with indeterminate values of arguments. The built-in McCarthy functions $ car $, $ cdr $, $ cons $, $ null $, $ atom $, $ if $, $ eq $, $ not $, $ and $, $ or $, are used in all functional programming languages. In this paper we show the $ \lambda $-definability of the built-in McCarthy functions as functions with indeterminate values of arguments. This result is necessary when translating typed functional programming languages into untyped functional programming languages.

Downloads

Download data is not yet available.

Downloads

Published

2019-12-16

Issue

Vol. 53 No. 3 (250) (2019)

Section

Informatics

License

Copyright (c) 2019 Proceedings of the YSU

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

How to Cite

Nigiyan, S. (2019). $ \lambda $-DEFINABILITY OF BUILT-IN McCARTHY FUNCTIONS AS FUNCTIONS WITH INDETERMINATE VALUES OF ARGUMENTS. Proceedings of the YSU A: Physical and Mathematical Sciences, 53(3 (250), 191-202. https://doi.org/10.46991/PYSU:A/2019.53.3.191

Most read articles by the same author(s)