211 search results - page 21 / 43 » The Representation of Program Synthesis in Higher Order Logi... |
150
click to vote
ISCA
1999
IEEE
15 years 9 months ago
1999
IEEE
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve the promised performance increases of superscalar and VLIW processors. One of the...
170
click to vote
LISP
2007
15 years 5 months ago
2007
In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...
133
click to vote
IOLTS
2008
IEEE
15 years 12 months ago
2008
IEEE
Sets of Pairs of Functions to be Distinguished (SPFD) is a functional flexibility representation method that was recently introduced in the logic synthesis domain, and promises s...
170
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
135
click to vote
DEXA
2000
Springer
15 years 10 months ago
2000
Springer
The event calculus is a logic programming formalism for representing events and their effects especially in database applications. This paper presents the use of the event calculus...