Sciweavers

1560 search results - page 24 / 312
» Order Functions and Evaluation Codes
Sort
View
ENTCS
2007
113views more  ENTCS 2007»
13 years 7 months ago
The Interactive Curry Observation Debugger iCODE
Debugging by observing the evaluation of expressions and functions is a useful approach for finding bugs in lazy functional and functional logic programs. However, adding and rem...
Parissa H. Sadeghi, Frank Huch
PPDP
2009
Springer
14 years 2 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus
DAGSTUHL
2006
13 years 9 months ago
The complexity of Boolean functions from cryptographic viewpoint
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
Claude Carlet
COMPUTING
2007
108views more  COMPUTING 2007»
13 years 7 months ago
Accurate evaluation of divided differences for polynomial interpolation of exponential propagators
In this paper, we propose an approach to the computation of more accurate divided differences for the interpolation in the Newton form of the matrix exponential propagator ϕ(hA)v...
Marco Caliari
ICFP
2003
ACM
14 years 7 months ago
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
Robert Ennals, Simon L. Peyton Jones