ON MINIMALITY OF ONE SET OF BUILT-IN FUNCTIONS FOR FUNCTIONAL PROGRAMMING LANGUAGES

G.A. Martirosyan

doi:10.46991/PYSU:A/2012.46.2.042

ON MINIMALITY OF ONE SET OF BUILT-IN FUNCTIONS FOR FUNCTIONAL PROGRAMMING LANGUAGES

Authors

G.A. Martirosyan Chair of Programming and Information Technologies, YSU, Armenia

DOI:

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

Keywords:

functional programming language, built-in function, Turing completeness, minimality

Abstract

The functional programming language, which uses the set {car, cdr, cons, atom, eq, if_then_else} of built-in functions is Turing complete (see [1]). In the present paper the minimality of this set of functions is proved.

Downloads

Published

2012-05-10

How to Cite

Martirosyan, G. (2012). ON MINIMALITY OF ONE SET OF BUILT-IN FUNCTIONS FOR FUNCTIONAL PROGRAMMING LANGUAGES. Proceedings of the YSU A: Physical and Mathematical Sciences, 46(2 (228), 42–49. https://doi.org/10.46991/PYSU:A/2012.46.2.042