ON MINIMALITY OF ONE SET OF BUILT-IN FUNCTIONS FOR FUNCTIONAL PROGRAMMING LANGUAGES
DOI:
https://doi.org/10.46991/PYSU:A/2012.46.2.042Keywords:
functional programming language, built-in function, Turing completeness, minimalityAbstract
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
Issue
Section
Informatics
License
Copyright (c) 2012 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.