Call Pattern Analysis for Functional Logic Programs

to full text (251 kB)   ZIP
involved person(s) / institution(s)author :
datePublished :
  • June 2008
size30 S.

This paper presents a new program analysis framework to approximate call patterns and their results in functional logic computations. We consider programs containing non-strict, nondeterministic operations in order to make the analysis applicable to modern functional logic languages like Curry or TOY. For this purpose, we present a new fixpoint characterization of functional logic computations w.r.t. a set of initial calls. We show how programs can be analyzed by approximating this fixpoint. The results of such an approximation have various applications, e.g., program optimization as well as verifying safety properties of programs.
Static URL
IDNumber of report :
  • TR_0803