1989 search results - page 78 / 398 » Set functions for functional logic programming |
FLOPS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
146
click to vote
Book
Very well organized and easy to follow book. The table of content can be downloaded from the attachment section below.
GECCO
2009
Springer
14 years 5 months ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
SIGSOFT
2003
ACM
14 years 11 months ago
2003
ACM
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
JELIA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...