On Turing Completeness of One Minimal Set of Built-in Functions for Functional Programming Languages

Authors

  • G. Martirosyan Yerevan State University

Abstract

N/A

Author Biography

G. Martirosyan, Yerevan State University

Chair of Programming and Information Technologies

References

S.A. Nigiyan, "Functional Languages", Programming and Computer Software, Vol. 17. pp. 290-297, 1992.

S.A. Nigiyan, "On interpretation of functional programming languages", Programming and Computer Software, Vol. 19. pp. 71-78, 1993.

L.E. Budaghyan, “Necessary and sufficient condition of completeness of computation rule for strongly typed functional programs", Proceedings of the Conference on Computer Science and Information Technologies (CSIT-2005), Yerevan, 2005, p. 16-19.

Downloads

Published

2021-12-10

How to Cite

Martirosyan, G. (2021). On Turing Completeness of One Minimal Set of Built-in Functions for Functional Programming Languages. Mathematical Problems of Computer Science, 38, 76–76. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/549

Issue

Vol. 38 (2012): Mathematical Problems of Computer Science

Section

Conference papers

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.