Simple Semantic Analysis Problems for Functional Programs

e terms we define the program property as the limit of the constructed sequence of properties. Forward and backward property analysis problems prove to be undecidable in the general case. However, we give sufficient conditions for solving these problems and present marking algorithms that compute program properties under the conditions required. Further, we sketch examples of forward (essentiality of term occurrences) and backward (hopelessness of term occurrences) property analysis problems. Informally, a term occurrence in a program is essential if it influences the approximation sequence of the program. Suppose a subset Strict(f) of the set 2 f1;:::;arity(f)g is associated to each basic functional symbol f . An interpretation I is strict , if the condition 8d1 :