Global Summary of the FAST Coordinated Project:
The global aim of this project is the development of novel foundations and applications of rigorous software
technologies that contribute to the expressivity, reliability, security and performance of software systems
and programming languages.
Our work will be mainly centered along the following four broad lines of research:

Foundations for new extensions of multi-paradigm declarative languages.

Development of rigorous techniques for improving the development of highly reliable software.

Transfer of declarative technologies to other contexts and paradigms like, e.g., databases and query
languages.

From a scientific and methodological point of view, the project covers�in a well balanced way�both
theoretical aspects about the foundations of the new proposals and practical aspects leading to their
effective implementation.

This project constitutes a natural evolution of previous coordinated efforts by the three participating
research teams. They all have a considerable expertise in R+D projects focused on the areas of
multi-paradigm programming languages and rigorous software development technologies, broad fields in
which Spanish research has a solid international position.

Goals of the STAMP subproject

Extend the system TOY with a competitive implementation of the CFLP(D) scheme that includes a
high-level language to describe the cooperation of constraint glass-box solvers.

Development of a logical framework to express and prove properties of declarative programs with
heterogeneous constraints. Construction of a tool for proving this type of declarative properties in the
Isabelle theorem prover, based on the integration in of combination of decision procedures.

Formulation of a well-founded generic scheme for qualified declarative programming, and integration
of interesting instances in the TOY system. Investigation of practical applications, specially to web
search queries.

Proposal of a rewriting-based framework where different kinds of non-determinism coexist in a coherent
manner, and its integration into TOY. Investigate data structures for efficient management of nondeterminism
in functional languages.

Use of expressive declarative languages as query languages for deductive databases with heterogenous
constraints.

Define and implement in the TOY system a theoretical framework for integrating the XML query
language XQuery in a functional-logic setting. Develop a theoretical scheme for declarative debugging
XQuery expressions and obtain a working debugger prototype.

Development of analysis to infer resource consumption properties and related properties like termination.
Implementation in a certifying compiler, and transformation of the analysis results into formal
certificates. Built of a certification infrastructure able to automatically process the certificates.