A Program Transformation for Tracing Functional Logic Computations

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Tracing program executions is a promising technique to find bugs in lazy functional logic programs. In previous work we developed an extension of a heap based semantics for functional logic languages which generates a trace reflecting the computation of the program. This extension was also prototypically implemented by instrumenting an interpreter for functional logic programs. Since this interpreter is too restricted for real world applications, we developed a program transformation which efficiently computes the trace by means of side effects during the computation. This paper presents our program transformation.

This work has been partially supported by the DFG under grant Ha 2457/5-1.