4757 search results - page 195 / 952 » Monads for Functional Programming |
156
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
243
click to vote
ICPP
2009
IEEE
16 years 1 months ago
2009
IEEE
We are currently faced with the situation where applications have increasing computational demands and there is a wide selection of parallel processor systems. In this paper we fo...
143
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
178
click to vote
ICTAC
2005
Springer
15 years 12 months ago
2005
Springer
Case studies can significantly contribute towards improving the understanding of formalisms and thereby to their applicability in practice. One such case, namely a cascade of the ...
172
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...