|
Proceedings of the Yerevan State University, series Physical and Mathematical Sciences, 2012, Issue 2, Pages 42–49
(Mi uzeru135)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Informatics
On minimality of one set of built-in functions for functional programming languages
G. A. Martirosyan Chair of Programming and Information Technologies YSU, Armenia
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.
Keywords:
functional programming language, built-in function, Turing completeness, minimality.
Received: 21.02.2012 Accepted: 30.03.2012
Citation:
G. A. Martirosyan, “On minimality of one set of built-in functions for functional programming languages”, Proceedings of the YSU, Physical and Mathematical Sciences, 2012, no. 2, 42–49
Linking options:
https://www.mathnet.ru/eng/uzeru135 https://www.mathnet.ru/eng/uzeru/y2012/i2/p42
|
Statistics & downloads: |
Abstract page: | 62 | Full-text PDF : | 17 | References: | 22 |
|