4835 search results - page 425 / 967 » Refactoring Functional Programs |
200
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...
192
Voted
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...
167
click to vote
FOCS
2005
IEEE
16 years 1 months 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 ...
349
Voted
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
209
click to vote
ICFP
2005
ACM
16 years 7 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...