A program transformation for tracing functional logic computations

Authors:
Bernd Brassel;Sebastian Fischer;Frank Huch
Affiliations:
Institute of Computer Science, University of Kiel, Kiel, Germany;Institute of Computer Science, University of Kiel, Kiel, Germany;Institute of Computer Science, University of Kiel, Kiel, Germany
Venue:
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Year:
2006

Citing 7
Cited 2

A novel representation of lists and its application to the function "reverse"

Information Processing Letters
Algorithmic Program DeBugging

Algorithmic Program DeBugging
The Evaluation Dependence Tree as a Basis for Lazy FunctionalDebugging

Automated Software Engineering
Distributed Programming in a Multi-Paradigm Declarative Language

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Tracing Lazy Functional Computations Using Redex Trails

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
A semantics for tracing declarative multi-paradigm programs

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Operational semantics for declarative multi-paradigm languages

Journal of Symbolic Computation

A Framework for Interpreting Traces of Functional Logic Computations

Electronic Notes in Theoretical Computer Science (ENTCS)
Systematic generation of glass-box test cases for functional logic programs

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

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.