1989 search results - page 25 / 398 » Set functions for functional logic programming |
AGP
1998
IEEE
13 years 12 months ago
1998
IEEE
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...
GECCO
1999
Springer
13 years 12 months ago
1999
Springer
This paper demonstrates the ability of genetic programming to evolve analog circuits that perform digital functions and mixed analog-digital circuits. The evolved circuits include...
BMCBI
2007
13 years 7 months ago
2007
Background: Gene clustering has been widely used to group genes with similar expression pattern in microarray data analysis. Subsequent enrichment analysis using predefined gene s...
AGP
1998
IEEE
13 years 11 months ago
1998
IEEE
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...