Natural Science, Other, 2025
ON MINIMALITY OF ONE SET OF BUILT-IN FUNCTIONS FOR FUNCTIONAL PROGRAMMING LANGUAGES
This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Submitted: 2025-02-19; Published: 2025-02-19
© 2025 by author(s) and The Gufo Inc.
This work is licensed under Creative Commons Attribution–NonCommercial International License
(CC BY-NC 4.0).
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.