Natural Sciences, Mathematics, 2026
UNSOLVABILITY OF TYPE CORRECTNESS PROBLEM FOR FUNCTIONAL PROGRAMS
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-22
© 2026 by author(s) and The Gufo Inc.
This work is licensed under Creative Commons Attribution–NonCommercial International License
(CC BY-NC 4.0).
Abstract
In the present paper the type correctness problem is considered for functional programs without the type information. The aim of this research is to prove that there is no algorithm to reject all programs, during execution of which the type error would occur and accept all programs, during execution of which the type error would not occur.