Sciweavers

207 search results - page 21 / 42
» Elementary Strong Functional Programming
Sort
View
FCCM
2002
IEEE
174views VLSI» more  FCCM 2002»
14 years 20 days ago
PAM-Blox II: Design and Evaluation of C++ Module Generation for Computing with FPGAs
This paper explores the implications of integrating flexible module generation into a compiler for FPGAs. The objective is to improve the programmabilityof FPGAs, or in other wor...
Oskar Mencer
POPL
2010
ACM
14 years 5 months ago
A Theory of Indirection via Approximation
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
ICFP
2010
ACM
13 years 8 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce
BMCBI
2008
129views more  BMCBI 2008»
13 years 7 months ago
Prediction of the outcome of preoperative chemotherapy in breast cancer using DNA probes that provide information on both comple
Background: DNA microarray technology has emerged as a major tool for exploring cancer biology and solving clinical issues. Predicting a patient's response to chemotherapy is...
René Natowicz, Roberto Incitti, Euler Guima...
CORR
2008
Springer
158views Education» more  CORR 2008»
13 years 7 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau