Sciweavers

1631 search results - page 52 / 327
» Observing Functional Logic Computations
Sort
View
NDSS
2003
IEEE
14 years 3 months ago
Moderately Hard, Memory-Bound Functions
A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. It has been sugge...
Martín Abadi, Michael Burrows, Ted Wobber
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
TJS
2002
101views more  TJS 2002»
13 years 9 months ago
Compilation for Adaptive Computing Systems Using Complex Parameterized Hardware Objects
FLAME, the Flexible API for Module-based Environments, is a proposed standard interface for the integration of parameterized hardware generators into high-level design tools. This ...
Andreas Koch
ICNC
2005
Springer
14 years 3 months ago
On the Categorizing of Simply Separable Relations in Partial Four-Valued Logic
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem,and the solution can be reduced to determining the minimal co...
Renren Liu, Zhiwei Gong, Fen Xu
CADE
1992
Springer
14 years 2 months ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne