Program slicing is a technique to extract program parts with respect to some special
computation. Since Weiser first proposed the notion of slicing in 1979, hundreds of papers …

Functional and logic programming are the most important declarative programming
paradigms, and interest in combining them has grown over the last decade. Early research …

Functional logic programming languages combine the most important declarative
programming paradigms, and attempts to combine these paradigms have a long history. The …

Functional logic languages extend purely functional languages with two features: operations
defined by overlap** rules and logic variables in both defining rules and expressions to …

In this paper, we present a method for explaining the results produced by dynamic
programming (DP) algorithms. Our approach is based on retaining a granular representation …

This thesis is concerned with the investigation and implementation of a number of
refactorings for Haskell. The refactorings are themselves written in Haskell [108], and …

Program slicing is a well-known technique that extracts from a program those statements
which are relevant to a particular criterion. While static slicing does not consider any input …

Currently, program slicing and algorithmic debugging are two of the most relevant
debugging techniques for declarative languages. They help programmers to find bugs in a …

The system dependence graph (SDG) is a widely used program representation for the static
analysis of programs. In particular, it is the standard way to represent control and flow …

The system dependence graph (SDG) is a data structure used in the imperative paradigm for
different static analysis, and particularly, for program slicing. Program slicing allows us to …