Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
The assembly of components that can handle continuously changing data results in programs that are more interactive. Unfortunately, the code that glues together such components is ...
Abstract. In this paper we present the iData Toolkit. It allows programmers to create interactive, dynamic web applications with state on evel of abstraction. The key element of th...