3323 search results - page 12 / 665 » Computational Semantics with Functional Programming |
114
click to vote
FOGA
2011
14 years 1 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
100
click to vote
NMELP
1994
15 years 1 months ago
1994
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
ENTCS
2002
14 years 9 months ago
2002
In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential...
TPHOL
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
ISSTA
1998
ACM
15 years 1 months ago
1998
ACM
Program dependence information is useful for a variety of software testing and maintenance tasks. Properly defined, control and data dependencies can be used to identify semantic...