1989 search results - page 39 / 398 » Set functions for functional logic programming |
IJCSA
2007
13 years 7 months ago
2007
This article presents experiences in the automation of a testing process. The main goal is the unified testing of not only one program, but a whole family of programs. The family ...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
MST
2006
13 years 7 months ago
2006
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
ADC
2006
Springer
14 years 1 months ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
DEXA
1994
Springer
13 years 11 months ago
1994
Springer
We describe a functional database language OR-SML for handling disjunctive information in database queries, and its implementation on top of Standard ML 12]. The core language has ...