Sciweavers

4743 search results - page 91 / 949
» Introduction to Functional Programming
Sort
View
FP
1991
95views Formal Methods» more  FP 1991»
14 years 1 months ago
Making Functionality More General
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
Graham Hutton, Ed Voermans
DAGSTUHL
2006
13 years 11 months ago
Bounds on the Fourier Coefficients of the Weighted Sum Function
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
Igor Shparlinski
ICTAC
2007
Springer
14 years 4 months ago
Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
Abstract. Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan, Cha...
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
14 years 1 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
PLDI
2005
ACM
14 years 3 months ago
Checking type safety of foreign function calls
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...
Michael Furr, Jeffrey S. Foster