1173 search results - page 101 / 235 » Program Derivation Using Analogy |
146
Voted
ICLP
2001
Springer
15 years 9 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
254
click to vote
POPL
2007
ACM
16 years 5 months ago
2007
ACM
A method is presented for computing all higher-order partial derivatives of a multivariate function Rn R. This method works by evaluating the function under a nonstandard interpre...
156
Voted
ICALP
1992
Springer
15 years 9 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
169
click to vote
CC
2009
Springer
15 years 2 months ago
2009
Springer
We present the architecture of the Rosser toolkit that allows optimisations to be specified in a domain specific language, then compiled and deployed towards optimising object prog...
147
click to vote
ENTCS
2010
14 years 11 months ago
2010
This is a study of a technique for deriving the session type of a program written in a statically typed imperative language from its control flow. We impose on our unlabelled sess...