This paper presents a termination technique for positive supercompilation, based on notions
from term algebra. The technique is not particularily biased towards positive …

Bidirectional transformations provide a novel mechanism for synchronizing and maintaining
the consistency of information between input and output. Despite many promising results on …

Languages that integrate functional and logic programming with a complete operational
semantics are based on narrowing, a unification-based goal-solving mechanism which …

Abstract The period between 75,000 and 20,000 years ago was characterized by high
variability in climate,,,,,,,,,,, and sea level,. Southern Ocean records of ice-rafted debris …

Program specialisation aims at improving the overall performance of programs by
performing source to source transformations. A common approach within functional and …

We survey fundamental concepts in inverse programming and present the Universal
Resolving Algorithm (URA), an algorithm for inverse computation in a first-order, functional …

We present an algorithm for inverse computation in a first-order functional language based
on the notion of a perfect process tree. The Universal Resolving Algorithm introduced in this …

This paper is concerned with the problem of removing redundant arguments from logic
programs. Such arguments can be removed without affecting correctness, in a certain sense …

1 INTRODUCTION Verifying a solution for a problem is much easier than finding one—this
common wisdom can be confirmed by anyone who used both to learn and to teach. This …

Program specialization optimizes programs for known values of the input. It is often the case
that the set of possible input values is unknown, or this set is infinite. However, a form of …