4757 search results - page 413 / 952 » Monads for Functional Programming |
184
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
187
click to vote
EMSOFT
2004
Springer
16 years 5 days ago
2004
Springer
The paper introduces a higher-order synchronous data-flow language in which communication channels may themselves transport programs. This provides a mean to dynamically reconfi...
172
click to vote
PLDI
1996
ACM
15 years 11 months ago
1996
ACM
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...
176
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
153
click to vote
FOCS
2005
IEEE
16 years 12 days ago
2005
IEEE
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...