UNSOLVABILITY OF TYPE CORRECTNESS PROBLEM FOR FUNCTIONAL PROGRAMS
DOI:
https://doi.org/10.46991/PYSU:A/2011.45.1.028Keywords:
term, redex, reduction strategy, type errorAbstract
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.
Downloads
Published
2011-02-16
How to Cite
Arakelyan, A. (2011). UNSOLVABILITY OF TYPE CORRECTNESS PROBLEM FOR FUNCTIONAL PROGRAMS. Proceedings of the YSU A: Physical and Mathematical Sciences, 45(1 (224), 28–35. https://doi.org/10.46991/PYSU:A/2011.45.1.028
Issue
Section
Informatics
License
Copyright (c) 2011 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.