Main concepts of a theory of functional programs

A. M. Mironov

Institute of Informatics Problems of the Russian Academy of Sciences

Abstract: The paper covers mathematical models and methods for the analysis of functional programs. There is presented a theory of functions which are computed by functional programs (these functions are called least fixed points of functional programs). Basic methods of verification of functional programs are described in this paper, namely: a method of computational induction and a method of structural induction.

Keywords: least fixed point, verification, computational induction, structural induction.