Call Pattern Analysis for Functional Logic Programs

zum Volltext (251 kB)   ZIP
Beteiligte Person(en) / Institution(en)Autor :
DatumErschienen :
  • Juni 2008
Seitenbereich30 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.
Statische URLhttps://www.uni-kiel.de/journals/receive/jportal_jparticle_00000115
 
URN:NBNurn:nbn:de:101:1-201203214549
IDNummer des Berichts :
  • TR_0803