UNSOLVABILITY OF TYPE CORRECTNESS PROBLEM FOR FUNCTIONAL PROGRAMS

Author(s)

UNSOLVABILITY OF TYPE CORRECTNESS PROBLEM FOR FUNCTIONAL PROGRAMS Ara Arakelyan

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.

DOI: 10.46991/PYSUA.2011.45.1.028 Physical and Mathematical Sciences, 45(1 (224) 28-35

Download PDF

Keywords

term, redex, reduction strategy, type error

Check for updates

Share

Contact admin with any questions, comments or concerns

[email protected]