Geodesic
On minimality of one set of built-in functions for functional programming languages
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 2 (2012), pp. 42-49 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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. 
@article{UZERU_2012_2_a6,
     author = {G. A. Martirosyan},
     title = {On minimality of one set of built-in functions for functional programming languages},
     journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
     pages = {42--49},
     year = {2012},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/UZERU_2012_2_a6/}
}
TY  - JOUR
AU  - G. A. Martirosyan
TI  - On minimality of one set of built-in functions for functional programming languages
JO  - Proceedings of the Yerevan State University. Physical and mathematical sciences
PY  - 2012
SP  - 42
EP  - 49
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/UZERU_2012_2_a6/
LA  - en
ID  - UZERU_2012_2_a6
ER  - 
%0 Journal Article
%A G. A. Martirosyan
%T On minimality of one set of built-in functions for functional programming languages
%J Proceedings of the Yerevan State University. Physical and mathematical sciences
%D 2012
%P 42-49
%N 2
%U http://geodesic.mathdoc.fr/item/UZERU_2012_2_a6/
%G en
%F UZERU_2012_2_a6
G. A. Martirosyan. On minimality of one set of built-in functions for functional programming languages. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 2 (2012), pp. 42-49. http://geodesic.mathdoc.fr/item/UZERU_2012_2_a6/

[1] G.A. Martirosyan, “Turing Completeness of Functional Programming Languages with One Set of Built-in Functions”, Proceedings of the Conference on Computer Science and Information Technologies, CSIT-2011, Yer., 2011, 370–373

[2] S. A. Nigiyan, “Functional Languages”, Programming and Computer Software, 17 (1992), 290–297

[3] S. A. Nigiyan, “On Interpretation of Functional Programming Languages”, Programming and Computer Software, 19 (1993), 71–78 | MR | Zbl

[4] L.E. Budaghyan, “A Necessary and Sufficient Condition Of Completeness of Commutation Rule for Strong Typed Functional Programs”, Proceedings of the Conference on Computer Science and Information Technologies, CSIT-2005, Yer., 2005, 16–19