8766 search results - page 166 / 1754 » Functional logic programming |
IJON
2007
14 years 10 months ago
2007
MLQ
2010
14 years 8 months ago
2010
CADE
2002
Springer
15 years 10 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
PRICAI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the i...
CADE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...