Skip to Main Content
The functional programs are the recursive functions. Therefore, the paper primarily discuss all the forms having the recursive function. For the data structures, such as the lists, the following forms are available: the parallel recursion, inter-recursion, and the recursion of high level. The paper has exposed each form on the LISP language, being the classic functional language as well as the ground for the development of all other languages. The verification for the forms of the recursive functions was adopted with structural and transfinite induction methods. The analysis describe combined induction technique and its algorithm is discussed which is used for verification for such complex functions, arguments of which are again the recursive functions. The discussed verification method of the programs those being offered for the functional languages was applied for the imperative paradigm languages, in particular for Language C and more precisely for C subset (consider that the C program consists of the assigning, optional and cycle operators only).