RUS  ENG
Full version
JOURNALS // Proceedings of the Yerevan State University, series Physical and Mathematical Sciences // Archive
Proceedings of the YSU, Physical and Mathematical Sciences, 2012 Issue 2, Pages 42–49 (Mi uzeru135)
This article is cited 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

Language: English


© Steklov Math. Inst. of RAS, 2024