Sciweavers

98 search results - page 18 / 20
» Binding-Time Analysis for Polymorphic Types
Sort
View
FPCA
1989
13 years 11 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
BMCBI
2007
163views more  BMCBI 2007»
13 years 7 months ago
Strainer: software for analysis of population variation in community genomic datasets
Background: Metagenomic analyses of microbial communities that are comprehensive enough to provide multiple samples of most loci in the genomes of the dominant organism types will...
John M. Eppley, Gene W. Tyson, Wayne M. Getz, Jill...
HICSS
2006
IEEE
124views Biometrics» more  HICSS 2006»
14 years 1 months ago
Missing the Forest for the Trees - Object Technology's Second Hiatus
Object technology was first created in 1967, but it had to wait till the mid 80’s for widespread acceptance and adoption. We observe that that was not the only hiatus for the te...
Viswanathan Kodaganallur
PLDI
2004
ACM
14 years 23 days ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
BMCBI
2007
200views more  BMCBI 2007»
13 years 7 months ago
Assessment of algorithms for high throughput detection of genomic copy number variation in oligonucleotide microarray data
Background: Genomic deletions and duplications are important in the pathogenesis of diseases, such as cancer and mental retardation, and have recently been shown to occur frequent...
Ágnes Baross, Allen D. Delaney, H. Irene Li...