Sciweavers

171 search results - page 10 / 35
» Arithmetic Function Interpreter in C
Sort
View
DATE
2000
IEEE
108views Hardware» more  DATE 2000»
15 years 3 months ago
Automatic Abstraction for Worst-Case Analysis of Discrete Systems
c Abstraction for Worst-Case Analysis of Discrete Systems Felice Balarin Cadence Berkeley Laboratories Recently, a methodology for worst-case analysis of discrete systems has been...
Felice Balarin
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
15 years 11 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov
PLDI
1996
ACM
15 years 3 months ago
Realistic Compilation by Partial Evaluation
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...
Michael Sperber, Peter Thiemann
ICFP
2001
ACM
15 years 11 months ago
Functioning without Closure: Type-Safe Customized Function Representations for Standard ML
The CIL compiler for core Standard ML compiles whole ML programs using a novel typed intermediate language that supports the generation of type-safe customized data representation...
Allyn Dimock, Ian Westmacott, Robert Muller, Frank...
ML
2008
ACM
115views Machine Learning» more  ML 2008»
14 years 11 months ago
Calling variadic functions from a strongly-typed language
The importance of providing a mechanism to call C functions from high-level languages has been understood for many years and, these days, almost all statically-typed high-level-la...
Matthias Blume, Mike Rainey, John H. Reppy