Introduction Special Issue on Multiparadigm Languages and Constraint Programming
In recent years much research and implementation effort has been devoted both to multiparadigm languages and constraint programming languages. Following up on a series of 11 workshops (WFLP) on multiparadigm languages and constraint programming, and as ...
Removing redundant arguments automatically
The application of automatic transformation processes during the formal development and optimization of programs can introduce encumbrances in the generated code that programmers usually (or presumably) do not write. An example is the introduction of ...
Combining relational algebra, SQL, constraint modelling, and local search
The goal of this paper is to provide a strong integration between constraint modelling and relational DBMSs. To this end we propose extensions of standard query languages such as relational algebra and SQL, by adding constraint modelling capabilities to ...
Constraint-based automatic verification of abstract models of multithreaded programs
We present a technique for the automated verification of abstract models of multithreaded programs providing fresh name generation, name mobility, and unbounded control. As high level specification language we adopt here an extension of communication ...
Integration of declarative and constraint programming
Combining a set of existing constraint solvers into an integrated system of cooperating solvers is a useful and economic principle to solve hybrid constraint problems. In this paper we show that this approach can also be used to integrate different ...
Mapping Fusion and Synchronized Hyperedge Replacement into logic programming
In this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationships between a process calculus, the Fusion Calculus, graph transformations ...
Demand analysis with partial predicates
To alleviate the inefficiencies caused by the interaction of the logic and functional sides, integrated languages may take advantage of demand information, i.e. knowing in advance which computations are needed and, to which extent, in a particular ...
A comparison between two logical formalisms for rewriting
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed with different objectives. Here we study the relationships between them, both at ...
Forward slicing of functional logic programs by partial evaluation
Program slicing has been mainly studied in the context of imperative languages, where it has been applied to a wide variety of software engineering tasks, like program understanding, maintenance, debugging, testing, code reuse, etc. This work introduces ...