We propose a set of transformation rules for constraint logic programs with negation. We
assume that every program is locally stratified and, thus, it has a unique perfect model. We …

Dynamic linking supports flexible code deployment: partially linked code links further code
on the fly, as needed; and thus, end-users receive updates automatically. On the down side …

Many functional logic languages are based on narrowing, a unification-based goal-solving
mechanism which subsumes the reduction mechanism of functional languages and the …

Multi-adjoint logic programming represents a very recent, extremely flexible attempt for
introducing fuzzy logic into logic programming. Inspired by our previous experiences in the …

This work introduces a transformation methodology for functional logic programs based on
needed narrowing, the optimal and complete operational principle for modern declarative …

We present a generic scheme for the declarative debugging of functional logic programs
which is valid for eager as well as lazy programs. In particular we show that the framework …

We propose a new methodology for synthesizing correct functional logic programs. We aim
to create an integrated development environment in which it is possible to debug a program …

Functional logic languages with a complete operational semantics are based on narrowing,
which combines the instantiation of variables with the reduction of expressions. In this paper …

This paper briefly describes the use of the program transformation methodology for the
development of correct and efficient programs. In particular, we will refer to the case of …

The development of modern routers require a significant effort to be designed, built, and
verified. While hardware routers are faster, they are difficult to configure and maintain …